Search for the best compromise solution on multiobjective shortest path problem - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

Search for the best compromise solution on multiobjective shortest path problem

Résumé

This paper deals with the multiobjective shortest path problem in the context of routing for cycling. Many studies focus on the computation of the entire set of Pareto paths. Here we focus on the determination of a well-balanced trade-off path between the objectives. We recall the original Best Compromise A* method and then we present two improvements in order to speed up the search of the best compromise solution. Finally we present various numerical tests on real-life instances, that prove the efficiency of the improved methods.
Fichier non déposé

Dates et versions

hal-01025716 , version 1 (18-07-2014)

Identifiants

  • HAL Id : hal-01025716 , version 1

Citer

Gaël Sauvanet, Emmanuel Neron. Search for the best compromise solution on multiobjective shortest path problem. International Symposium on Combinatorial Optimization, Mar 2010, Hammamet, Tunisia. ⟨hal-01025716⟩
36 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More