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

Authors:
Sascha Häckel;Marco Fischer;David Zechel;Tobias Teich
Affiliations:
Chemnitz University of Technology, Chemnitz, Germany;Chemnitz University of Technology, Chemnitz, Germany;Chemnitz University of Technology, Chemnitz, Germany;Zwickau University of Applied Science of West Saxony, Zwickau, Germany
Venue:
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Year:
2008

Citing 6
Cited 1

A Theorem on Boolean Matrices

Journal of the ACM (JACM)
Algorithm 97: Shortest path

Communications of the ACM
Evolutionary Algorithms for Solving Multi-Objective Problems

Evolutionary Algorithms for Solving Multi-Objective Problems
Dynamic Programming

Dynamic Programming
Ant colony system: a cooperative learning approach to the traveling salesman problem

IEEE Transactions on Evolutionary Computation
Ant system: optimization by a colony of cooperating agents

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

GRACE: a generational randomized ACO for the multi-objective shortest path problem

EMO'11 Proceedings of the 6th international conference on Evolutionary multi-criterion optimization

Quantified Score

Hi-index	0.00

Visualization

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.