Automated selection of appropriate pheromone representations in ant colony optimization

Artificial Life

Volumn 11, Issue 3, 2005, Pages 269-291

  Montgomery, James ^a   Randall, Marcus ^a   Hendtlass, Tim ^b  

^a BOND UNIVERSITY   (Australia)

^b SWINBURNE UNIVERSITY OF TECHNOLOGY   (Australia)

Author keywords

Ant colony optimization; Combinatorial optimization; Metaheuristic; Pheromone

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; HEURISTIC METHODS; MATHEMATICAL MODELS;

ANT COLONY OPTIMIZATION; COMBINATORIAL OPTIMIZATION; METAHEURISTIC; PHEROMONE REPRESENTATION;

OPTIMIZATION;

PHEROMONE;

ALGORITHM; ANIMAL; ANIMAL BEHAVIOR; ANT; BIOLOGICAL MODEL; GENETIC SELECTION; PHYSIOLOGY; REVIEW;

ALGORITHMS; ANIMALS; ANTS; BEHAVIOR, ANIMAL; MODELS, BIOLOGICAL; PHEROMONES; SELECTION (GENETICS);

EID: 22944463619     PISSN: 10645462     EISSN: None     Source Type: Journal    
DOI: 10.1162/1064546054407149     Document Type: Article

References (44)

1. Abramson, D., & Randall, M. (1999). A simulated annealing code for general integer linear programs. Annals of Operations Research, 86 3-21.
2. Bauer, A., Bullnheimer, B., Hartl, R. F., & Strauss, C. (1999). Applying ant colony optimization to solve the single machine total tardiness problem (Technical report No. 42). Vienna, Austria: Vienna University of Economics and Business Administration.
3. Birattari, M., Di Caro, G., & Dorigo, M. (2002). Toward the formal foundation of ant programming. In M. Dorigo, G. Di Caro, & M. Sampels (Eds.), Proceedings of the Third International Workshop on Ant Algorithms, ANTS 2002, Brussels, Belgium (pp. 188-201). Berlin: Springer-Verlag.
4. Blum, C. (2002). Ant colony optimization for the edge-weighted k -cardinality tree problem. In W. Langdon (Ed.), Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2002), New York, USA (pp. 27-34). San Francisco: Morgan Kaufman.
5. Blum, C. (2004). Theoretical and practical aspects of ant colony optimization. Volume 282 of Dissertations in Artificial Intelligence. Nieuwe Hernweg, The Netherlands: IOS Press.
6. Blum, C., & Dorigo, M. (2003). The hyper-cube framework for ant colony optimization. IEEE Transactions on Systems, Man and Cybernetics - Part B, 34, 1161-1172.
7. Blum, C., & Sampels, M. (2002). Ant colony optimization for FOP shop scheduling: A case study on different pheromone representations. In Proceedings of the 2002 Congress on Evolutionary Computation (pp. 1558-1563).
8. Blum, C., & Sampels, M. (2002). When model bias is stronger than selection pressure. In J. M. Guervós, P. Adamidis, H. G. Beyer, J. L. Fernández-Villacañas, & H. P. Schwefel (Eds.), Proceedings of the Seventh International Conference on Parallel Problem Solving from Nature (PPSN2002) (pp. 893-902). Berlin: Springer-Verlag.
9. Bullnheimer, B., Hartl, R. F., & Strauss, C. (1999). An improved ant system algorithm for the vehicle routing problem. Annals of Operations Research, 89, 319-328.
10. Burke, E. K., Hart, E., Kendall, G., Newall, J., Ross, P., & Schulenburg, S. (2002). Hyper-heuristics: An emerging direction in modern search technology. In F. Glover, & G. Kochenberger (Eds.), Handbook of meta-heuristics (pp. 457-474). Boston: Kluwer Academic Publishers.
11. Colorni, A., Dorigo, M., Maniezzo, V., & Trubian, M. (1994). Ant system for job-shop scheduling. Belgian Journal of Operations Research, Statistics and Computer Science, 34, 39-53.
12. Costa, D., & Hertz, A. (1997). Ants can colour graphs. Journal of the Operational Research Society, 48, 295-305.
13. Di Caro, G., & Dorigo, M. (1998). AntNet: Distributed stigmergetic control for communications networks. Journal of Artificial Intelligence Research, 9, 317-365.
14. Dorigo, M., Bonabeau, E., & Theraulaz, G. (2000). Ant algorithms and stigmergy. Future Generation Computer Systems, 16, 851-871.
15. Dorigo, M., & Di Caro, G. (1999). The ant colony optimization metaheuristic. In D. Corne, M. Dorigo, & F. Glover (Eds.), New ideas in optimization (pp. 11-32). London: McGraw-Hill.
16. Dorigo, M., Maniezzo, V., & Colorni, A. (1996). The ant system: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man and Cybernetics - Part B, 26, 1-13.
17. Dorigo, M., & Stützle, T. (2002). The ant colony optimization metaheuristic: Algorithms, applications and advances. In F. Glover, & G. Kochenberger (Eds.), Handbook of metaheuristics (pp. 251-285). Boston: Kluwer Academic.
18. Ducatelle, F., & Levine, J. (2004). Ant colony optimisation and local search for bin packing and cutting stock problems. Journal of the Operational Research Society, 55, 705-716.
19. Ernst, A. T., & Krishnamoorthy, M. (1996). Efficient algorithms for the uncapacitated single allocation p-hub median problem. Location Science, 4, 139-154.
20. Fenet, S., & Solnon, C. (2003). Searching for maximum cliques with ant colony optimization. In S. Cagnoni, J. Romero Cardalda, D. Corne, J. Gottlieb, A. Guillot, E. Hart, C. Johnson, E. Marchiori, J. A. Meyer, M. Middendorf, & G. Raidl (Eds.), Proceedings of the EvoWorkshops 2003, Essex, UK (pp. 236-245). Berlin: Springer-Verlag.
21. Fiorenzo Catalamo, M. S., & Malucelli, F. (2001). Parallel randomized heuristics for the set covering problem. In M. Paprzycki, L. Tarricone, & L. T. Yang (Eds.), Practical parallel computing (pp. 113-132). Hauppause, NY: Nova Science Publishers.
22. Gottlieb, J., Puchta, M., & Solnon, C. (2003). A study of greedy, local search, and ant colony optimization approaches to car sequencing problems. In S. Cagnoni, J. Romero Cardalda, D. Corne, J. Gottlieb, A. Guillot, E. Hart, C. Johnson, E. Marchiori, J. A. Meyer, M. Middendorf, & G. Raidl (Eds.), Proceedings of the EvoWorkshops 2003, Essex, UK (pp. 246-257). Berlin: Springer-Verlag.
23. Gutjahr, W. J. (2000). A graph-based ant system and its convergence. Future Generation Computer Systems, 16, 873-888.
24. Iredi, S., Merkle, D., & Middendorf, M. (2001). Bi-criterion optimization with multicolony ant algorithms. In Proceedings of the First International Conference on Evolutionary Multi-Criterion Optimization (EMO'01), Zurich (pp. 359-372). Berlin: Springer-Verlag.
25. Johnson, D. S., Aragon, C. R., McGeoch, L. A., & Schevon, C. (1991). Optimization by simulated annealing: An experimental evaluation; Part ii, graph coloring and number partitioning. Operations Research, 39, 378-405.
26. Leguizamón, G., & Michalewicz, Z. (1999). A new version of ant system for subset problems. In Proceedings of the 1999 Congress on Evolutionary Computation (pp. 1459-1464). Piscataway, NJ: IEEE.
27. Lourenço, H., R., & Serra, D. (2002). Adaptive search heuristics for the generalized assignment problem. Mathware and Soft Computing, 9, 209-234.
28. Maniezzo, V., & Carbonaro, A. (2000). An ANTS heuristic for the frequency assignment problem. Future Generation Computer Systems, 16, 927-935.
29. Merkle, D., & Middendorf, M. (2000). An ant algorithm with a new pheromone evaluation rule for total tardiness problems. In Proceedings of the EvoWorkshops 2000 (pp. 287-296). Berlin: Springer-Verlag.
30. Merkle, D., & Middendorf, M. (2002). Ant colony optimization with the relative pheromone evaluation method. In S. Cagnoni, J. Gottlieb, E. Hart, M. Middendorf, & G. Raidl (Eds.), Proceedings of the EvoWorksbops 2002, Kinsale, Ireland, (pp. 321-329). Berlin: Springer-Verlag.
31. Merkle, D., Middendorf, M., & Schmeck, H. (2000). Ant colony optimization for resource-constrained project scheduling. In D. Whitley; D. Goldberg, E. Cantu-Paz, L. Spector, I. Parmee, & H. G. Beyer (Eds.), Proceedings of the 2000 Genetic and Evolutionary Computation Conference, Las Vegas, NV, USA (pp. 893-900). San Francisco: Morgan Kaufman.
32. Michel, R., & Middendorf, M. (1999). An ant system for the shortest common supersequence problem. In D. Corne, M. Dorigo, & F. Glover (Eds.), New ideas in optimization (pp. 51-61). London: McGraw-Hill.
33. Montgomery, J., Randall, M., & Hendtlass, T. (2003). Automated selection of appropriate pheromone representations in ant colony optimisation. In H. A. Abbass, & J. Wiles (Eds.), Proceedings of the First Australian Conference on Artificial Life (ACAL03), Canberra, Australia (pp. 170-184). University of New South Wales.
34. Montgomery, J., Randall, M., & Hendtlass, T. (2004). Search bias in constructive metaheuristics and implications for ant colony optimisation. In Proceedings of the Fourth International Workshop on Ant Algorithms, ANTS 2004, Brussels, Belgium. Berlin: Springer-Verlag.
35. Rahoual, M., Hadji, R., & Bachdet, V. (2002). Parallel ant system for the set covering problem. In M. Dorigo, G. Di Caro, & M. Sampels (Eds.), Proceedings of the Third International Workshop on Ant Algorithms, ANTS 2002, Brussels, Belgium (pp. 262-267). Berlin: Springer-Verlag.
36. Randall, M. (2002). A general framework for constructive meta-heuristics. In E. Kozan, & A. Ohuchi (Eds.), Operations research/management science at work (pp. 111-128). Boston: Kluwer Academic.
37. Randall, M. (2002). Scheduling aircraft landings using ant colony optimisation. In Proceedings of the Sixth IASTED International Conference on Artificial Intelligence and Soft Computing, Banff, Alberta, Canada (pp. 129-133).
38. Randall, M., & Abramson, D. (2001). A general meta-heuristic based solver for combinatorial optimisation problems. Journal of Computational Optimization and Applications, 20, 185-210.
39. Roli, A., Blum, C., & Dorigo, M. (2001). ACO for maximal constraint satisfaction problems. In Proceedings of the Fourth Metaheuristics International Conference, Porto, Portugal (pp. 187-192).
40. Smith, K., Palaniswami, M., & Krishnamoorthy, M. (1996). A hybrid neural network approach to combinatorial optimisation. Computers and Operations Research, 73, 501-508.
41. Socha, K., Knowles, J., & Sampels, M. (2002). A MAX-MIN ant system for the university course timetabling problem. In M. Dorigo, G. Di Caro, & M. Sampels (Eds.), Proceedings of the Third International Workshop on Ant Algorithms, ANTS 2002, Brussels, Belgium (pp. 1-13). Berlin: Springer-Verlag.
42. Stützle, T. (1998). An ant approach to the flow shop problem. In Proceedings of the Sixth European Congress on Intelligent Techniques & Soft Computing (EUFIT '98), Aachen, Germany (pp. 1560-1564). Berlin: Verlag Mainz.
43. Stützle, T., & Dorigo, M. (1999). ACO algorithms for the quadratic assignment problem. In D. Corne, M. Dorigo, & F. Glover (Eds.), New ideas in optimization (pp. 33-50). London: McGraw-Hill.
44. Zlochin, M., & Dorigo, M. (2002). Model-based search for combinatorial optimization: A comparative study. In Proceedings of the Seventh International Conference on Parallel Problem Solving from Nature (PPSN2002) (pp. 651-662).