An efficient label-setting Algorithm for the Bi-Objective Shortest Path problem

Antoine Giret (1, 2) , Emmanuel Neron (1, 2) , Gaël Sauvanet (3) , Yannick Kergosien (1, 2)

1 LIFAT - Laboratoire d'Informatique Fondamentale et Appliquée de Tours
2 ROOT - Recherche Opérationnelle, Ordonnancement, Transport ERL 7002
3 La Compagnie des Mobilités

In this paper, we consider a classical Bi-objective Shortest Path problem (BSP) that takes into account both distance and insecurity criteria. This work is in collaboration with an enterprise who provide a web platform called Géovélo that aims to propose routes for cycling. We propose a new exact method to solve a BSP, called Label Setting algorithm with Dynamic update of Pareto Front (LSDPF), which aims to find all nondominated solutions of the problem. Different exploration strategies have been proposed and tested. Numerical experiments on real data sets and on instances of the literature were conducted. Comparison with recent benchmarks algorithms solving BSP-the bounded Label Setting algorithm by (Raith, 2010) and the pulse algorithm by (Duque et al., 2015)-shows that our method outperform these benchmarks algorithms.

Mots clés: label-setting Algorithm; pareto Front; Bi-Objective Shortest Path problem; cycling; exact method

Domaines: Recherche opérationnelle [math.OC]

Antoine Giret, Emmanuel Neron, Gaël Sauvanet, Yannick Kergosien. An efficient label-setting Algorithm for the Bi-Objective Shortest Path problem. 5th International Conference on Operations Research and Enterprise Systems, 2016, Rome, France. ⟨hal-03018287⟩