loading
Papers Papers/2020

Research.Publish.Connect.

Paper

Authors: Arthur Finkelstein 1 and Jean-Charles Régin 2

Affiliations: 1 Instant System, Garden Space B2, Rue Evariste Galois, 06410 Biot, France ; 2 Université Côte d’Azur, I3S, CNRS, France

Keyword(s): Public Transit Routing, Shortest Path, Pareto Optimization, Preprocessing.

Abstract: One of the main problems for a realistic journey planning in public transit is the need to give the user multiple qualitative choices. Usually, public transit journeys involve 4 main criteria: the departure time, the arrival time, the number of transfers and the walking distance. The problem of computing Pareto sets with these criteria is called the Pareto range query problem. This problem is complex and difficult to solve within the constraints of the industrial world of smartphone applications, like a response time of the order of a second. In this paper, we present the Goal Directed Connection Scan Algorithm (GDCSA), an algorithm that allows, for the first time, to solve this problem with run times of less than 0.5 seconds on most European city or country-wide networks, like Berlin or Switzerland. In addition, GDCSA satisfies other industrial needs: it is conceptually simple and easy to implement. It partitions the graph in geographically small areas and precomputes some lower bou nds on the duration of a trip in order to select for each itinerary a sub-set of these areas to decrease the number of scanned connections. Combining this sub-set and a journey planning using 4 criteria, the number of scanned connections is lowered by a factor of up to 17 times compared to the best algorithms (CSA and RAPTOR), the number of nodes opened during the search is lowered by a factor of up to 2.9 and the query times are lowered by a factor of up to 9 on metropolitan networks. The integration of GDCSA in a smartphone app backend server led to an improvement in results by a factor of 5. (More)

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 52.23.219.12

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Finkelstein, A. and Régin, J. (2021). Using Goal Directed Techniques for Journey Planning with Multi-criteria Range Queries in Public Transit. In Proceedings of the 10th International Conference on Operations Research and Enterprise Systems - ICORES, ISBN 978-989-758-485-5; ISSN 2184-4372, pages 347-357. DOI: 10.5220/0010235303470357

@conference{icores21,
author={Arthur Finkelstein. and Jean{-}Charles Régin.},
title={Using Goal Directed Techniques for Journey Planning with Multi-criteria Range Queries in Public Transit},
booktitle={Proceedings of the 10th International Conference on Operations Research and Enterprise Systems - ICORES,},
year={2021},
pages={347-357},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0010235303470357},
isbn={978-989-758-485-5},
issn={2184-4372},
}

TY - CONF

JO - Proceedings of the 10th International Conference on Operations Research and Enterprise Systems - ICORES,
TI - Using Goal Directed Techniques for Journey Planning with Multi-criteria Range Queries in Public Transit
SN - 978-989-758-485-5
IS - 2184-4372
AU - Finkelstein, A.
AU - Régin, J.
PY - 2021
SP - 347
EP - 357
DO - 10.5220/0010235303470357

0123movie.net