Adaptive ant colony optimization algorithm based on information entropy: Foundation and application

Fundamenta Informaticae

Volumn 77, Issue 3, 2007, Pages 229-242

  Li, Yancang ^a,b   Li, Wanqing ^a  

^a HEBEI UNIVERSITY OF ENGINEERING   (China)

^b TIANJIN UNIVERSITY   (China)

Author keywords

Ant Colony Optimization; Information entropy; Modification; Self adaptive; Traveling Salesman Problem

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; GLOBAL OPTIMIZATION; HEURISTIC METHODS; INFORMATION ANALYSIS; STATE SPACE METHODS; TRAVELING SALESMAN PROBLEM;

ANT COLONY OPTIMIZATION; EVOLUTIONARY ADAPTIVE ALGORITHMS; INFORMATION ENTROPY;

ADAPTIVE ALGORITHMS;

EID: 34547600083     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (30)

1. Dorigo M., Maniezzo V., Colorni A.: The Ant System: An autocatalytic optimizing process.Technical Report 91-106 revised, Department of Electronic, Politecnico of Milano, Milan, Italy, 1991.
2. Colorni A., Dorigo M. and Maniezzo V.: Distributed Optimization by Ant Colonies. Proceedings of the First European Conference on Artificial Life, Elsevier Publishing, Paris, France, 134-142,1991.
3. Hölldobler B., Wilson E.O.: The Ants. Springer-Verlag, Berlin, Germany, 1990.
4. Dorigo M.Gambardella L M.: Ant colony system: a cooperative learning approach to the traveling salesman problem, IEEC Trans on Evolutionary Computing, 1 (1), 1997, 53-56.
5. Colorni ADorigo M and Maniezzo V.: Ant colony system for job-shop scheduling, Belgian Journal of Operations Research Statistics and Computer Science, 34(1) (1994), 39-53.
6. Maniezzo V, Dorigo M and Colorni A: The ant system applied to Quadratic Assignment Problem, Technical Report IRIDIA 94-28, University de Bruxelles, Belgium,1994.
7. Gambardella L MDorigo M.: HAS-SOP: Hybrid ant system for the sequential problem, Technical Report, IDSIA, 1997.
8. Chen L., Shen J., Qin L.: A method for solving optimization problem in continuous space using ant colony algorithm, Systems Engineering-Theory and Practice, 3, 2003, 48-53.
9. Wang Y., Xie J.Y. An ant system algorithm for multicast routing, Systems Engineering and Electronics, 23 (8), 2001, 98-101.
10. Dorigo M. Caro D.: The Ant Colony Optimization m Meta-heuristic: New ideas in Optimization. McGrawHill, New York, 1999.
11. Dorigo M., Stutzle T.: Ant Colony Optimization. Cambridge, MIT Press, MA, July, 2004.
12. Dorigo M., Maniezzo V. and Colorni A.: Ant system: optimization by a colony of cooperating agents, IEEE Trans on SMC26 (1), 1996, 28-41.
13. Bullnheimer B., Hartl R. F. and Stauss C.: a new rank-based version of the ant system: A computational study, European Journal for Operations Research and Economics, 7(1), 1999, 25-38.
14. Stutzle THoos H.: MAX-MIN ant system, Future Generation Computer systems, 16, 2000, 889-914.
15. Cordon O., Fernodezde V.I. and Moreno L.: A new ACO model integrating evolutionary concepts: the bestworst ant system, From ant colonies to artificial ants A series of inter workshop on ant Algorithm, 2000: Proc. of ANTS Brussels, 22-29.
16. Wanhua Q.: Management decision making and the applied entropy, 2002, China Mechanical Press, Beijing, China.
17. Gutjahr W. J. A.: graph-based ant system and its convergence, Future General Computer System. 16(8), 2001, 873-888.
18. Randall M., Montgomery J.: Candidate set strategies for Ant Colony Optimization, Technical Report TR02-04, School of Information Technology, Bond University.
19. Reimann M., Shtovba S. and nepomuceno E.: A hybrid Ant Colony Optimization and Genetic Algorithm approach for vehick routing problems solving, Student Papers of Complex System Summer School, Budapest,2001, 134-141.
20. Dorigo M.Luca M.: A study of Ant-Q, 1996: Proceedings of 4th International Conference on Parallel Problem from Nature, Berlin: Springer Verlag, 656-665.
21. Blum.C., Roli.A and Dorigo.M.: HC-ACO: The hyper-cube framework for Ant Colony Optimization. Proceedings of MIC 2001-meta-heuristics International Conference, Porto, Portugal, 2,399-403.
22. Wu Q.H., ZHang J.H. and XU X.H.: An ant colony algorithm with mutation features, Journal of computer Research and Development, 36(10), 1999, 1240-1245.
23. Asmar D. and ElshamliA.and Areibi S.: A comparative assessment of ACO Algorithms within a TSP environment, Dynamics of Continuous Discrete and Impulsive systems-series B-Application and Algorithm, SP. ISS. SI, 1, 2005, 462-467.
24. JS Chun, MK Kim, HK Jung, SK Hong: Shape optimization of electromagnetic devices using immune algorithm, IEEE Trans on Magnetics, 33(2), 1997, 1876-1879.
25. Durbin, R., Willshaw, D.: An analogue approach to the traveling salesman problem using an elastic net method, Nature, 326, 1987, 689-691.
26. Potvin, J.Y.: The traveling salesman problem: A neural network Perpective, ORSA Journal of Computing, 5 (4), 1993, 328-347.
27. Fogel, D.: Applying evolutionary programming to selected traveling salesman problems, Cybernetics and Systems: An International Journal, 24, 1993, 27-36.
28. Dorigo M., L.M. Gambardella.: Ant Colonies for the Traveling Salesman Problem, BioSystems, 43, 1997:7381.
29. Also Tecnical Report TR/IRIDIA/1996-3, IRIDIA, Universit Libre de Bruxelles.
30. Lin, S., Kernighan, B.W.: An effective Heuristic Algorithm for the TSP, Operations Research, 21, 1973, 498-516.