An Efficient Label-setting Algorithm for the Bi-objective Shortest Path Problem

Antoine Giret, Yannick Kergosien, Gael Sauvanet, Emmanuel Neron

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.

References

  1. Bertsekas, D. (1998). Network optimization: Continuous and discrete models.
  2. Brumbaugh-Smith, J. and Shier, D. (1989). An empirical investigation of some bicriterion shortest path algorithms. European Journal of Operational Research, 43:216-224.
  3. Carlyle, W. and Wood, R. (2005). Near-shortest and kshortest simple paths. Networks, 46:98-109.
  4. Climaco, J. and Martins, E. (1982). A bicriterion shortest path algorithm. European Journal of Operational Research, 11:399-404.
  5. C.T. Tung, K. C. (1992). A multicriteria pareto-optimal path algorithm. European Journal of Operational Research, 62:203-209.
  6. Demeyer, S. and al. (2013). Speeding up martins' algorithm for multiple objective shortest path problems. 4OR, 11:323-348.
  7. Dijkstra, E. (1959). A note on two problems in connection with graphs. Numerische Mathematik, (1):269-271.
  8. Duque, D., Lozano, L., and Medaglia, A. (2015). An exact method for the biobjective shorstest path problem for large-scale road networks. European Journal of Operational Research, (242):788-797.
  9. Guerriero, F. and Musmanno, R. (2001). Label correcting methods to solve multicriteria shortest path problems. Journal of optimization theory and applications, 111:589-613.
  10. Hansen, P. (1980). Multiple criteria decision making theory and application. Lecture Notes in Economics and Mathematical Systems, 177:109-127.
  11. Martins, E. (1984). On a multicriteria shortest path problem. European Journal of Operational Research, (16):236-245.
  12. Raith, A. (2010). Speed-up of labelling algorithms for biobjective shortest path problems. pages 313-322.
  13. Raith, A. and Ehrgott, M. (2009). A comparison of solution strategies for biobjective shortest path problems. Computers & OR, 36(4):1299-1331.
  14. Sauvanet, G. and Neron, E. (2010). Search for the best compromise solution on multiobjective shortest path problem. Electronic Notes in Discrete Mathematics, (36):615-622.
  15. Serafini, P. (1987). Some considerations about computational complexity for multiobjective combinatorial problems. In Lecture Notes in Economics and Mathematical Systems, pages 222-232. Springer-Verlag.
  16. Skriver, A. and Andersen, K. (2000). A label correcting approach for solving bicriterion shortest-path problems. Computers & Operations Research, 27:507-524.
  17. Tarapata, Z. (2007). Selected multicriteria shortest path problems: An analysis of complexity, models and adaptation of standard algorithms. International Journal Of Applied Mathematics And Computer Science, 17:269-287.
  18. Ulungu, E. and Teghem, J. (1994). Multi-objective combinatorial optimization problems: A survey. Journal of Multi-Criteria Decision Analysis, 3:83-104.
  19. Ulungu, E. and Teghem, J. (1995). The two phases method : An efficient procedure to solve biobjective combinatorial optimization problems. Foundations of Computing and Decision Sciences, 20(2):149-165.
Download


Paper Citation


in Harvard Style

Giret A., Kergosien Y., Sauvanet G. and Neron E. (2016). An Efficient Label-setting Algorithm for the Bi-objective Shortest Path Problem . In Proceedings of 5th the International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-758-171-7, pages 197-203. DOI: 10.5220/0005757101970203


in Bibtex Style

@conference{icores16,
author={Antoine Giret and Yannick Kergosien and Gael Sauvanet and Emmanuel Neron},
title={An Efficient Label-setting Algorithm for the Bi-objective Shortest Path Problem},
booktitle={Proceedings of 5th the International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},
year={2016},
pages={197-203},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005757101970203},
isbn={978-989-758-171-7},
}


in EndNote Style

TY - CONF
JO - Proceedings of 5th the International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,
TI - An Efficient Label-setting Algorithm for the Bi-objective Shortest Path Problem
SN - 978-989-758-171-7
AU - Giret A.
AU - Kergosien Y.
AU - Sauvanet G.
AU - Neron E.
PY - 2016
SP - 197
EP - 203
DO - 10.5220/0005757101970203