Authors:
Antoine Giret
1
;
Yannick Kergosien
1
;
Gael Sauvanet
2
and
Emmanuel Neron
1
Affiliations:
1
Université François Rabelais de Tours and CNRS, France
;
2
La Compagnie des Mobilités, France
Keyword(s):
Label-setting Algorithm, Pareto front, Bi-Objective Shortest Path Problem, Cycling, Exact Method.
Related
Ontology
Subjects/Areas/Topics:
Applications
;
Artificial Intelligence
;
Knowledge Discovery and Information Retrieval
;
Knowledge-Based Systems
;
Methodologies and Technologies
;
Operational Research
;
Optimization
;
Routing
;
Symbolic Systems
Abstract:
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´eov´elo 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 non-dominated
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.