Competition controlled pheromone update for ant colony optimization

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

Volumn 3172 LNCS, Issue , 2004, Pages 95-105

  Merkle, Daniel ^a   Middendorf, Martin ^a  

^a UNIVERSITY OF LEIPZIG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ITERATIVE METHODS; SWARM INTELLIGENCE; ALGORITHMS; ARTIFICIAL INTELLIGENCE; OPTIMIZATION;

ACO ALGORITHMS; ANT COLONY OPTIMIZATION (ACO); DETERMINISTIC MODELING; KULLBACK-LEIBLER DISTANCE; OPTIMIZATION ALGORITHMS; SEARCH PROCESS; SIMPLE TESTS;

ANT COLONY OPTIMIZATION;

EID: 77049119750     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28646-2_9     Document Type: Conference Paper

References (15)

1. Blum, C. and Sampels, M. (2002). Ant Colony Optimization for FOP Shop scheduling: A case study on different pheromone representations Proc. of the 2002 Congress on Evolutionary Computation (CEC'02), 1558-1563.
2. Bullnheimer, B., Hartl, R.F., and Strauss, C. (1999). A new rank based version of the ant system - a computational study. Central Europ. J. Oper. Res. 7(1): 25-38.
3. Dorigo, M. (1992). Optimization, Learning and Natural Algorithms (in Italian). PhD thesis, Dipartimento di Elettronica, Politecnico di Milano, Italy.
4. Dorigo, M., and Di Caro, G. (1999). The ant colony optimization meta-heuristic. In Corne, D., Dorigo, M., and Glover, F., editors, New Ideas in Optimization, 11-32, McGraw-Hill, London.
5. Dorigo, M., Maniezzo, V., and Colorni, A. (1996). The Ant System: Optimization by a Colony of Cooperating Agents. IEEE Trans. Systems, Man, and Cybernetics - Part B, 26: 29-41.
6. Dorigo, M., Zlochin, M., Meuleau, N., and Birattari, M. (2002). Updating ACO Pheromones Using Stochastic Gradient Ascent and Cross-Entropy Methods. Proc. EvoWorkshops, LNCS 2279, 21-30.
7. Meuleau, N. and Dorigo, M. (2002). Ant colony optimization and stochastic gradient descent. Artificial Life, 8(2):103-121.
8. Merkle, D. and Middendorf, M. (2000). An Ant Algorithm with a new Pheromone Evaluation Rule for Total Tardiness Problems. In Cagnoni, S., et al. (Eds.) Real-World Applications of Evolutionary Computing, LNCS 1803, 287-296, Springer.
9. Merkle, D. and Middendorf, M. (2001). A New Approach to Solve Permutation Scheduling Problems with Ant Colony Optimization. In Boers, E. J. W., et al. (Eds.) Applications of Evolutionary Computing, LNCS 2037, 213-222, Springer.
10. Merkle, D. and Middendorf, M. (2002). Ant Colony Optimization with the Relative Pheromone Evaluation Method. Proc. 3rd European Workshop on Scheduling and Timetabling and 3rd European Workshop on Evolutionary Methods for AI Planning (EvoSTIM/EvoPLAN-2002), LNCS 2279, 325-333.
11. Merkle, D. and Middendorf, M. (2002). Modelling the Dynamics of Ant Colony Optimization Algorithms. Evolutionary Computation 10(3): 235-262, 2002.
12. Merkle, D. and Middendorf, M. (2002). Modelling ACO: Composed Permutation Problems. Proceedings of Third International Workshop ANTS 2002, Springer, LNCS 2463, 149-162.
13. Merkle, D., Middendorf, M., and Schmeck, H. (2002): Ant Colony Optimization for Resource-Constrained Project Scheduling. IEEE Transactions on Evolutionary Computation, 6(4): 333-346.
14. Randall, M. and Tonkes, E. (2000). Intensification and Diversification Strategies in Ant Colony Optimisation. TR00-02, School of Inf. Technology, Bond University.
15. Stützle, T. and Hoos, H. H. (2000). MAX-MIN Ant System. Future Generation Computer Systems. 16(8):889-914.