New metaheuristic approaches for the leaf-constrained minimum spanning tree problem

Asia-Pacific Journal of Operational Research

Volumn 25, Issue 4, 2008, Pages 575-589

  Singh, Alok ^a   Baghel, Anurag Singh ^b  

^a UNIVERSITY OF HYDERABAD   (India)

^b BANASTHALI UNIVERSITY   (India)

Author keywords

Ant colony optimization; Combinatorial optimization; Leaf constrained minimum spanning tree; Subset coding; Tabu search

Indexed keywords

ALGORITHMS; GENETIC ALGORITHMS; GRAPH THEORY; HEURISTIC ALGORITHMS; HEURISTIC METHODS; HEURISTIC PROGRAMMING; OPTIMIZATION; PROGRAMMING THEORY; QUERY PROCESSING; TABU SEARCH;

ANT COLONY OPTIMIZATION ALGORITHMS; ANT-COLONY OPTIMIZATION; COMBINATORIAL OPTIMIZATION; CONSTRAINED MINIMUM SPANNING TREE; GREEDY HEURISTIC; LEAF-CONSTRAINED MINIMUM SPANNING TREE; METAHEURISTIC APPROACHES; NEW APPROACHES; SPANNING TREES; SUBSET CODING; WEIGHTED GRAPHS;

TREES (MATHEMATICS);

EID: 51949092467     PISSN: 02175959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0217595908001870     Document Type: Article

References (26)

1. Alaya, I, C Solnon and K Ghédira (2004). Ant algorithm for the multi-dimensional knapsack problem. In Proceedings of the International Conference on Bioinspired Optimization Methods and their Applications (BIOMA 2004), 63-72.
2. Blum, C (2002). Ant colony optimization for the edge-weighted k-cardinality tree problem. In Proceedings of the GEECCO-2002, 27-34.
3. Blum, C and M Blesa (2005). New metaheuristic approaches for the edge-weighted fc-cardinality tree problem. Computers & Operations Research, 32, 1355-1377.
4. Bullnheimer, B, RF Hartl and C Strauss (1999). A new rank based version of ant system: A computational study. Central European Journal of Operations Research and Economics, 7, 25-38.
5. Deo, N and P Micikevicius (1999). A heuristic for the leaf-constrained minimum spanning tree problem. Congressus Numerantium, 141, 61-72.
6. Dorigo, M, A Colorni and V Maniezzo (1991). Positive feedback as a search strategy. Technical Report 91-016, Departmento di Electronica, Politecnico di Milano, Milan, Italy.
7. Dorigo, M and LM Gambardella (1997). Ant colony system: A cooperative learning approach to the travelling salesman problem. IEEE Transactions on Evolutionary Computation, 1, 53-66.
8. Dorigo, M, V Maniezzo and A Colorni (1996). The ant system: Optimization by a colony of cooperating ants. IEEE Transactions on Systems, Men and Cybernetics - Part B, 26, 29-41.
9. Dorigo, M and T Stutzle (2004). Ant Colony Optimization. Cambridge, MA: MIT Press.
10. Edelson, W and ML Gargano (2002). Leaf-constrained minimal spanning trees solved by a genetic algorithm. Congressus Numerantium, 157, 41-48.
11. Even, R (1973). Algorithmic Combinatorics. New York: Macmillan.
12. Fenet, S and C Solnon (2003). Searching for maximum cliques with ant colony optimization. In Proceedings of the 3 rd European Conference on Evolutionary Coputation in Combinatorial Optimization (EvoCOP 2003), LNCS 2611, 236-245. Springer-Verlag.
13. Gambardella, LM and M Dorigo (1995). Ant-Q: A reinforcement learning approach to the traveling salesman problem. In Proceedings of the Twelfth International Conference on Machine Learning, 252-260. Morgan Kauffman.
14. Glover, F and M Laguna (1997). Tabu Search. Norwell, MA: Kluwer Academic Publishers.
15. Hoelting, CJ, DA Schoenefeld and RL Wainwright (1995). Approximation techniques for variations of the p-median problem. In Proceedings of the 1995 ACM Symposium on Applied Computing, 293-299. ACM Press.
16. Julstrom, BA (2004a). Better greedy heuristics for the leaf-constrained minimum spanning tree problem in complete graphs. Communicated to Discrete Applied Mathematics.
17. Julstrom, BA (2004b). Codings and operators in two genetic algorithms for the leaf-constrained minimum spanning tree problem. International Journal of Applied Mathematics and Computer Science, 14, 385-396.
18. Leguizamon, G and Z Michalewicz (1999). A new version of ant system for subset problem. In Proceedings of the Congress on Evolutionary Computation, 1459-1464.
19. Picciotto, S (1999). How to encode a tree. Ph.D. Thesis, University of California, San Diego.
20. Sammoud, O, C Solnon and K Ghédira (2005). Ant algorithm for the graph matching problem. In Proceedings of the 5 th European Conference on Evolutionary Computation in Combinatorial Optimization (EvoCOP 2005), LNCS 3448, 213-223. Springer-Verlag.
21. Sammoud, O, S Sorlin, C Solnon and K Ghédira (2006). A comparative study of ant colony optimization and reactive search for graph matching problems. In Proceedings of the 6 th European Conference on Evolutionary Computation in Combinatorial Optimization (EvoCOP 2006), LNCS 3906, 234-246. Springer-Verlag.
22. Solnon, C (2002). Ants can solve constraint satisfaction problems. IEEE Transactions on Evolutionary Computation, 6, 347-357.
23. Solnon, C and D Bridge (2006). An ant colony optimization meta-heuristic for subset selection problems. In System Engineering Using Particle Swarm Optimization, 7-29. Nova Science Publisher.
24. Solnon, C and S Fenet (2006). A study of ACO capabilities for solving the maximum clique problem. Journal of Heuristics, 12, 155-180.
25. Stutzle, T and H Hoos (1997). Improvements on ant system: Introducing MAX-MIN ant system. In Proceedings of the International Conference on Artificial Neural Networks and Genetic Algorithms, 245-249.
26. Tarrant, F and D Bridge (2006). When ants attack: Ant algorithms for constraint satisfaction problems. Artificial Intelligence Review, 24, 455-476.