Sascha Häckel
ABSTRACT
This paper covers a multi-objective Ant Colony Optimization, which is applied to the NP-complete multi-objective shortest path problem in order to approximate Pareto-fronts. The efficient single-objective solvability of the problem is used to improve the results of the ant algorithm significantly. A dynamic program is developed which generates local heuristic values on the edges of the problem graph. These heuristic values are used by the artificial ants.
- R. Bellman. Dynamic programming. Princeton Univ. Press, Princeton, 1957.]] Google Scholar
Digital Library
- G. Bol. Deskriptive Statistik. Oldenbourg Verlag, München, 1998.]]Google Scholar
- 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.]] Google ScholarDigital Library
- E. Dijkstra. A note on two problems in connexion with graphs. Number 1, pages 269--271. Mathematisch Centrum, Amsterdam, The Netherlands, 1959.]]Google Scholar
- 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.]] Google ScholarDigital Library
- 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.]] Google ScholarDigital Library
- M. Fischer. Partnerauswahl in Netzwerken -- Ein mehrkriterieller Optimierungsansatz zur Bestimmung effizienter Netzkonfigurationen basierend auf Ant Colony Optimization. Verlag Dr. Kovac, Hamburg, 2008.]]Google Scholar
- 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.]]Google Scholar
- R. Floyd. Algorithm 97: Shortest Path. Communications of the ACM, 5(6):345, 1962.]] Google ScholarDigital Library
- M. Guntsch. Ant algorithms in stochastic and multi-criteria environments. PhD thesis, Universität Karlsruhe (TH), 2004.]]Google Scholar
- 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.]]Google Scholar
- 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.]] Google ScholarDigital Library
- J. Jahn. Vector Optimization -- Theory, Applications, and Extensions. Springer, London, 2004.]]Google Scholar
- K. Miettinen. Nonlinear Multiobjective Optimization, volume 12 of International series in operations research und management science. Kluwer, Acad. Publ, Boston, MA, 1999.]]Google Scholar
- P. Sera¯ni. 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.]]Google Scholar
- S. Warshall. A Theorem on Boolean Matrices. Journal of the ACM, 9(1):11--12, 1962.]] Google ScholarDigital Library
Index Terms
- A multi-objective ant colony approach for pareto-optimization using dynamic programming
Recommendations
A Multi-objective Ant Colony Optimization Algorithm with Local Optimum Avoidance Strategy
Machine Learning for Cyber SecurityAbstractAnt colony optimization (ACO) algorithm has rapid convergence speed and competitive performance in multi-objective optimization. However, for complicated multi-objective problems (MOPs), it faces the issue of the local optimum trap, which hinders ...
Fuzzy goal programming-based ant colony optimization algorithm for multi-objective topology design of distributed local area networks
AbstractTopology design of a distributed local area network (DLAN) is a complex optimization problem and has been generally modelled as a single-objective optimization problem. Traditionally, iterative techniques such as genetic algorithms and simulated ...
Bi-Objective Ant Colony Optimization approach to optimize production and maintenance scheduling
This paper presents an algorithm based on Ant Colony Optimization paradigm to solve the joint production and maintenance scheduling problem. This approach is developed to deal with the model previously proposed in [3] for the parallel machine case. This ...
Comments