Search for the best compromise solution on Multiobjective shortest path problem

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.