cAS: Ant colony optimization with cunning ants

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

Volumn 4193 LNCS, Issue , 2006, Pages 162-171

  Tsutsui, Shigeyoshi ^a  

^a HANNAN UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ITERATIVE METHODS; PROBLEM SOLVING;

ACO ALGORITHM; ANT COLONY OPTIMIZATION; CUNNING ANT SYSTEM (CAS); PHEROMONE DENSITY;

OPTIMIZATION;

EID: 33750266573     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11844297_17     Document Type: Conference Paper

References (19)

1. Dorigo, M., Maniezzo, V., Colorni, A.: The ant system: Optimization by a colony of cooperating agents. IEEE Trans. on SMC-Part B 26(1) (1996) 29-41
2. Dorigo, M., Gambardella, L.M.: Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE TEC 1(1) (1997) 53-66
3. Stützle, T., Hoos, H.: Max-min ant system. Future Generation Computer Systems 16(9) (2000) 889-914
4. Gambardella, L.M., Taillard, E.D., Dorigo, M.: Ant colony for the quadratic assignment problem. J. of the Operational Research Society 50 (1999) 167-176
5. Stützle, T.: An ant approach to the flowshop problem. Proc. of the 6th European Congress in Intelligent Thech. and Com. 3 (1998) 1560-1564
6. Bullnheimer, B., Hartl, R.F., Strauss, C.: An improved ant system algorithm for the vehicle routing problem. Annals of Operations Research 89 (1999) 319-328
7. Dorigo, M., Stützle, T.: Ant Colony Optimization. MIT press, Massachusetts (2004)
8. Tsutsui, S.: Probabilistic model-building genetic algorithms in permutation representation domain using edge histogram. Proc. of the 7th Int. Conf. on Parallel Problem Solving from Nature (PPSN VII) (2002) 224-233
9. Pelikan, M., Goldberg, D.E., F.Lobo: A survey of optimization by building and using probabilistic models. Computational Optimization and Applications 21(1) (2002) 5-20
10. Acan, A.: An external memory implementation in ant colony optimization. Proc. of the Fourth International Workshop on Ant Algorithms and Swarm Intelligence (ANTS-2004) (2004) 73-84
11. Acan, A.: An external partial permutations memory for ant colony optimization. Proc. of the 5th European Conference on Evolutionary Computation in Combinatorial Optimization (2005) 1-11
12. Wiesemann, W., Stützle, T.: An experimental investigation of iterated ants for the quadratic assign-ment problem. IRIDIA Technical Report Series Technical Re-port TR/IRIDIA/2006-003 (2006)
13. Tsutsui, S.: An enhanced aggregation pheromone system for real-parameter optimization in the aco metaphor. Proc. of the Fifth International Workshop on Ant Algorithms and Swarm Intelligence (ANTS-2006) (2006)
14. Tsutsui, S., Pelikan, M., Goldberg, D.E.: Using edge histogram models to solve permutation problems with probabilistic model-building genetic algorithms. IlliGAL Report No. 2003022 (2003)
15. Gambardella, L.M., Dorigo, M.: Solving symmetric and asymmetric tsps by ant colonies. Proc. the IEEE Int. Conf. on Evo. Comp.(ICEC'96) (1996) 622-627
16. Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the traveling salesman problem. Operations Research 21 (1973) 498-516
17. Applegate, D., Cook, W., Rohe, A.: Chained lin-kernighan for large traveling salesman problems. INFORMS J. on Computing 15 (2003) 82-92
18. Johnson, D.S.: Experimental analysis of heuristics for the stsp. G. Gutin and A. P. Punnen (ed.), The Traveling Salesman Problem and Variations 9 (2002) 369-443
19. http://www.tsp.gatech.edu/concorde.html. Concorde tsp solver, Ansi c code as gzipped tar file (2005)