He, F., Huan, Q. and Qiong, F. (2007) An Evolutionary Algorithm for the Multi-Objective Shortest Path Problem. Proceedings of the International Conference on Intelligent Systems and Knowledge Engineering (2007), ISKE 2007, Chengdu 15-16 October 2007.
https://doi.org/10.2991/iske.2007.217

has been cited by the following article:

• TITLE: An Evolutionary Algorithm Coupled to an Outranking Method for the Multicriteria Shortest Paths Problem

  AUTHORS: Frédéric Guidana Gazawa,   Kolyang, Irépran Damakoa

  KEYWORDS: Multi-Criteria Decision Making, Evolutionary Algorithm, Shortest Path, Outranking Method, Induced Subgraphs

  JOURNAL NAME: American Journal of Operations Research, Vol.9 No.3, May 31, 2019

  ABSTRACT: In this article, we are interested in solving a combinatorial optimization problem, the shortest path problem in a multi-attribute graph, by the out-ranking methods. A multi-attribute graph has simultaneously qualitative and quantitative criteria. This situation gives rise to incomparable paths thus forming the Pareto front. Outranking methods in Multi-criteria Decision Making (MCDM) are the only methods that can take into account this situation (incomparability of actions). After presenting the categories of Multi-criteria Decision Making (MCDM) and the difficulties related to the problems of the shortest paths, we propose an evolutionary algorithm based on the outranking methods to solve the problem of finding “best” paths in a multi-attribute graph with non-additive criteria. Our approach is based on the exploration of induced subgraphs of the outranking graph. Properties have been established to serve as algorithmic basis. Numerical experiments have been carried out and the results presented in this article.