Ant colony optimization and the minimum spanning tree problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5313 LNCS, Issue , 2008, Pages 153-166

  Neumann, Frank ^a   Witt, Carsten ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; COMPUTATIONAL METHODS; HEURISTIC ALGORITHMS; HEURISTIC METHODS; QUERY PROCESSING; RANDOM PROCESSES; TREES (MATHEMATICS);

ACO ALGORITHMS; ANT COLONY OPTIMIZATIONS; COMBINATORIAL OPTIMIZATION PROBLEMS; CONSTRUCTION PROCEDURES; HEURISTIC INFORMATIONS; INCREMENTAL CONSTRUCTIONS; INPUT GRAPHS; METAHEURISTIC; MINIMUM SPANNING TREE PROBLEMS; MINIMUM SPANNING TREES; NUMBER OF ITERATIONS; RANDOM WALKS; RIGOROUS ANALYSIS; SPANNING TREES; TO MANY;

OPTIMIZATION;

EID: 58349093918     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-92695-5_12     Document Type: Conference Paper

References (17)

1. Broder, A.: Generating random spanning trees. In: Proc. of FOCS 1989, pp. 442-447. IEEE Press, Los Alamitos (1989)
2. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)
3. Doerr, B., Johannsen, D.: Refined runtime analysis of a basic ant colony optimization algorithm. In: Proc. of CEC 2007, pp. 501-507. IEEE Press, Los Alamitos (2007)
4. Doerr, B., Neumann, F., Sudholt, D., Witt, C., Witt, C.: On the runtime analysis of the 1-ANT ACO algorithm. In: Proc. of GECCO 2007, pp. 33-40. ACM Press, New York (2007)
5. Dorigo, M., Blum, C.: Ant colony optimization theory: A survey. Theoretical Computer Science 344, 243-278 (2005)
6. Dorigo, M., Maniezzo, V., Colorni, A.: The ant system: An autocatalytic optimizing process. Technical Report 91-016 Revised, Politecnico di Milano (1991)
7. Dorigo, M., Stützle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)
8. Feller, W.: An Introduction to Probability Theory and Its Applications, 3rd edn., vol. 1. Wiley, Chichester (1968)
9. Gutjahr, W.J.: Mathematical runtime analysis of ACO algorithms: Survey on an emerging issue. Swarm Intelligence 1, 59-79 (2007)
10. Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)
11. Neumann, F., Sudholt, D., Witt, C.: Comparing variants of MMAS ACO algorithms on pseudo-boolean functions. In: Stützte, T., Birattari, M., H. Hoos, H. (eds.) SLS 2007. LNCS, vol. 4638, pp. 61-75. Springer, Heidelberg (2007)
12. Neumann, F., Wegener, I.: Minimum spanning trees made easier via multi-objective optimization. Natural Computing 5(3), 305-319 (2006)
13. Neumann, F., Wegener, L: Randomized local search, evolutionary algorithms, and the minimum spanning tree problem. Theoretical Computer Science 378(1), 32-40 (2007)
14. Neumann, F., Witt, C.: Runtime analysis of a simple ant colony optimization algorithm. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol. 4288, pp. 618-627. Springer, Heidelberg (2006)
15. Wegener, I.: Simulated annealing beats Metropolis in combinatorial optimization. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 589-601. Springer, Heidelberg (2005)
16. Wilson, D.B.: Generating random spanning trees more quickly than the cover time. In: Proc. of STOC 1996, pp. 296-303. ACM Press, New York (1996)
17. Witt, C.: Worst-case and average-case approximations by simple randomized search heuristics. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol. 3404, pp. 44-56. Springer, Heidelberg (2005)