The Multi-objective Shortest Path Problem (MSP) is a widely studied NP-Hard problem. A few exact algorithms were already proposed to solve this problem, however none is able to solve large instances with three or more objectives. Recently, some metaheuristics have been proposed for the MSP, but little can be said about their efficiency regarding each other, since no comparisons among them are presented in the literature. In this paper an Ant Colony Optimization (ACO) algorithm, called GRACE, is proposed for the MSP. The proposed approach is compared to the well-known evolutionary algorithm NSGA-II. Furthermore, GRACE is compared to another ACO algorithm proposed previously for the MSP. Results of a computational experiment with eighteen instances, with three objectives each, show that the proposed approach is able to produce high quality results for the tested instances. © 2011 Springer-Verlag.
CITATION STYLE
Bezerra, L. C. T., Goldbarg, E. F. G., Buriol, L. S., & Goldbarg, M. C. (2011). GRACE: A generational randomized ACO for the multi-objective shortest path problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6576 LNCS, pp. 535–549). https://doi.org/10.1007/978-3-642-19893-9_37
Mendeley helps you to discover research relevant for your work.