An Evolutionary Algorithm for the Multi-objective shortest path problem

DOI

10.2991/iske.2007.217How to use a DOI?

Keywords

Shortest path; Evolutionary algorithm; Multi- objective; Combinatorial optimization

Abstract

In this paper, a multi-objective shortest path evolutionary algorithm (MOSPEA) is presented for an undirected network. The algorithm differs from the others as it uses an external set to maintain non-dominated solutions and different selection strategy. Property of MOSPEA about stochastic convergence is analyzed. Simulation experiments demonstrate the availability and efficiency of MOSPEA. The study shows that MOSPEA may hopefully be a feasible approach for multi-objective shortest path

Copyright

© 2007, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Fangguo He
AU  - Huan Qi
AU  - Qiong Fan
PY  - 2007/10
DA  - 2007/10
TI  - An Evolutionary Algorithm for the Multi-objective shortest path problem
BT  - Proceedings of the 2007 International Conference on Intelligent Systems and Knowledge Engineering (ISKE 2007)
PB  - Atlantis Press
SP  - 1276
EP  - 1280
SN  - 1951-6851
UR  - https://doi.org/10.2991/iske.2007.217
DO  - 10.2991/iske.2007.217
ID  - He2007/10
ER  -