A multi-objective ant colony approach for pareto-optimization using dynamic programming

GECCO'08: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation 2008

Volumn , Issue , 2008, Pages 33-40

  Häckel, Sascha ^a   Fischer, Marco ^a   Zechel, David ^a   Teich, Tobias ^b  

^a CHEMNITZ UNIVERSITY OF TECHNOLOGY   (Germany)

^b Zwickau University of Applied Science of West Saxony   (Germany)

Author keywords

Ant colony optimization; Dynamic programming; Hybridization; Multi objective optimization; Pareto optimization; Shortest path problems

Indexed keywords

ANT COLONY OPTIMIZATION; ARTIFICIAL INTELLIGENCE; GRAPH THEORY; MULTIOBJECTIVE OPTIMIZATION; PARETO PRINCIPLE;

ANT ALGORITHMS; DYNAMIC PROGRAMS; HYBRIDIZATION; MULTI OBJECTIVE; MULTI-OBJECTIVE SHORTEST PATH PROBLEMS; PARETO OPTIMIZATION; SHORTEST PATH PROBLEM; SINGLE OBJECTIVE;

DYNAMIC PROGRAMMING;

EID: 57349111783     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1389095.1389101     Document Type: Conference Paper

References (16)

1. R. Bellman. Dynamic programming. Princeton Univ. Press, Princeton, 1957.
2. G. Bol. Deskriptive Statistik. Oldenbourg Verlag, München, 1998.
3. C. Coello Coello, V. Veldhuizen, D. Allen, and G. Lamont. Evolutionary Algorithms for Solving Multi-Objective Problems, volume 5 of Genetic algorithms and evolutionary computation. Kluwer, Acad. Publ, New York, NY, 2002.
4. E. Dijkstra. A note on two problems in connexion with graphs. Number 1, pages 269-271. Mathematisch Centrum, Amsterdam, The Netherlands, 1959.
5. M. Dorigo and L. Gambardella. Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem. IEEE Transactions on Evolutionary Computation, 1(1):53-66, 1997.
6. M. Dorigo, V. Maniezzo, and A. Colorni. The Ant System: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics-Part B, 26(1):1-13, 1996.
7. M. Fischer. Partnerauswahl in Netzwerken - Ein mehrkriterieller Optimierungsansatz zur Bestimmung effizienter Netzkonfigurationen basierend auf Ant Colony Optimization. Verlag Dr. Kovač, Hamburg, 2008.
8. M. Fischer, S. Häckel, and J. Kaminski. Improving Ant Colony Optimization for solving Multiobjective Shortest Path Problems by Using the new Look-Ahead-Heuristic-Concept. In Proceedings of the 22th International Conference on CAD/CAM, Robotics and Factories of the Future (CARS & FOF 2006), Vellore (India), July 19.-22. 2006.
9. R. Floyd. Algorithm 97: Shortest Path. Communications of the ACM, 5(6):345, 1962.
10. M. Guntsch. Ant algorithms in stochastic and multi-criteria environments. PhD thesis, Universität Karlsruhe (TH), 2004.
11. P. Hansen. Bicriterion Path Problems. In G. Fandel and T. Gal, editors, Multiple Criteria Decision Making Theory and Application, Lecture notes in economics and mathematical systems 177, pages 109-127, Berlin, Heidelberg, 1980. Springer.
12. S. Iredi, D. Merkle, and M. Middendorf. Bi-Criterion Optimization with Multi Colony Ant Algorithms. In E. Zitzler et al., editor, Proceedings of the First International Conference on Evolutionary Multi-Criterion-Optimization (EMO'01 ), Lecture Notes on Computer Science 1993, pages 359-372, Zürich, 2001. Springer.
13. J. Jahn. Vector Optimization - Theory, Applications, and Extensions. Springer, London, 2004.
14. K. Miettinen. Nonlinear Multiobjective Optimization, volume 12 of International series in operations research und management science. Kluwer, Acad. Publ, Boston, MA, 1999.
15. P. Serafini. Some considerations about computational complexity for multi objective combinatorial problems. In J. Jahn and W. Krabs, editors, Recent Advances and Historical Develpment of Vector Optimization, Lecture notes in economics and mathematical systems 294, page 405, Berlin, 1987. Springer.
16. S. Warshall. A Theorem on Boolean Matrices. Journal of the ACM, 9(1):11-12, 1962.