Latest revision as of 18:06, 28 January 2021

Abstract

Part 7: Networking; International audience; In this paper, we consider the problem of finding itineraries in bus networks under multiple independent optimization criteria, namely arrival time at destination and number of transfers. It is also allowed to walk from one stop to another if the two stops are located within a small distance. A time–dependent model is proposed to solve this problem. While focusing on the network where the size of the Pareto set in the multi–criteria shortest path problem might grow exponentially, we develop an efficient algorithm with its speed–up techniques. An evaluation on the qualities of found paths and the empirical results of different implementations are given. The results show that the allowance of walking shortcuts between nearby stops gives a better route planning.

Document type: Part of book or chapter of book

Full document

Original document

The different versions of the original document can be found in:

• https://link.springer.com/content/pdf/10.1007%2F978-3-662-45237-0_49.pdf

• http://link.springer.com/content/pdf/10.1007/978-3-662-45237-0_49,

http://dx.doi.org/10.1007/978-3-662-45237-0_49 under the license http://www.springer.com/tdm

• https://hal.inria.fr/hal-01405639,

https://hal.inria.fr/hal-01405639/document,

https://hal.inria.fr/hal-01405639/file/978-3-662-45237-0_49_Chapter.pdf under the license http://creativecommons.org/licenses/by/

• https://link.springer.com/chapter/10.1007/978-3-662-45237-0_49,

https://dblp.uni-trier.de/db/conf/cisim/cisim2014.html#KhoaPNH14,

https://hal.inria.fr/hal-01405639/document,

https://hal.inria.fr/IFIP-LNCS-8838/hal-01405639,

https://rd.springer.com/chapter/10.1007/978-3-662-45237-0_49,

https://academic.microsoft.com/#/detail/2102611762