skip to main content
10.1145/3205455.3205556acmconferencesArticle/Chapter ViewAbstractPublication PagesgeccoConference Proceedingsconference-collections
research-article

Multi-objective journey planning under uncertainty: a genetic approach

Published: 02 July 2018 Publication History

Abstract

Multi-modal journey planning, which allows multiple modes of transport to be used within a single trip, is becoming increasingly popular, due to a strong practical interest and an increasing availability of data. In real life situations, transport networks often involve uncertainty, and yet, most approaches assume a deterministic environment, making plans more prone to failures such as major delays in the arrival or waiting for a long time at stations. In this paper, we tackle the multi-objective stochastic journey planning problem in multi-modal transportation networks. The problem is modeled as a Markov decision process with two objective functions: expected arrival time and journey convenience. We develop a GA-based MDP solver as a baseline search method for producing optimal policies for traveling from a given origin to a given destination. Our empirical evaluation uses Melbourne transportation network using probabilistic density functions for estimated departure/arrival time of the trips. Numerical results suggest that the proposed method is effective for practical purposes and provide strong evidence in favor of switching from deterministic to non-deterministic planning.

References

[1]
2018. (2018). https://www.data.vic.gov.au/data/dataset/ptv-timetable-and-geographic- information-2015-gtfs
[2]
Hannah Bast, Daniel Delling, Andrew Goldberg, Matthias Müller-Hannemann, Thomas Pajor, Peter Sanders, Dorothea Wagner, and Renato F Werneck. 2016. Route planning in transportation networks. In Algorithm engineering. Springer, 19--80.
[3]
Adi Botea, Evdokia Nikolova, and Michele Berlingerio. 2013. Multi-Modal Journey Planning in the Presence of Uncertainty. In ICAPS.
[4]
Kalyanmoy Deb. 2001. Multi-objective optimization using evolutionary algorithms. Vol. 16. John Wiley & Sons.
[5]
Kalyanmoy Deb, Samir Agrawal, Amrit Pratap, and Tanaka Meyarivan. 2000. A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II. In International Conference on Parallel Problem Solving From Nature. Springer, 849--858.
[6]
Julian Dibbelt et al. {n. d.}. Engineering Algorithms for Route Planning in Multimodal Transportation Networks. Transportation ({n. d.}).
[7]
Donatella Firmani, Giuseppe F Italiano, Luigi Laura, and Federico Santaroni. 2013. Is timetabling routing always reliable for public transportl. In ATMOS-13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems-2013, Vol. 33. Schloss Dagstuhl?Leibniz-Zentrum fuer Informatik, 15--26.
[8]
Mogens Fosgerau and Anders Karlström. 2010. The value of reliability. Transportation Research Part B: Methodological 44, 1 (2010), 38--49.
[9]
Lauri Häme and Harri Hakula. 2013. Dynamic journeying under uncertainty. European Journal of Operational Research 225, 3 (2013), 455--471.
[10]
Mohammad Haqqani, Xiaodong Li, and Xinghuo Yu. 2017. An Evolutionary Multi-criteria Journey Planning Algorithm for Multimodal Transportation Networks. In Australasian Conference on Artificial Life and Computational Intelligence. Springer, 144--156.
[11]
John Henry Holland. 1992. Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence. MIT press.
[12]
Leslie Pack Kaelbling, Michael L Littman, and Anthony R Cassandra. 1998. Planning and acting in partially observable stochastic domains. Artificial intelligence 101, 1 (1998), 99--134.
[13]
Lu Liu and Liqiu Meng. 2009. Algorithms of multi-modal route planning based on the concept of switch point. Photogrammetrie-Fernerkundung-Geoinformation 2009, 5 (2009), 431--444.
[14]
Tim Nonner. 2012. Polynomial-Time Approximation Schemes for Shortest Path with Alternatives. In ESA, Vol. 7501. Springer, 755--765.
[15]
Tim Nonner and Marco Laumanns. 2014. Shortest path with alternatives for uniform arrival times: Algorithms and experiments. In OASIcs-OpenAccess Series in Informatics, Vol. 42. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.
[16]
Evangelia Pyrga, Frank Schulz, Dorothea Wagner, and Christos Zaroliagis. 2008. Efficient models for timetable information in public transportation systems. Journal of Experimental Algorithmics (JEA) 12 (2008), 2--4.
[17]
Evangelia Pyrga, Frank Schulz, Dorothea Wagner, and Christos D Zaroliagis. 2004. Experimental Comparison of Shortest Path Approaches for Timetable Information. In ALENEX/ANALC. Citeseer, 88--99.
[18]
Eckart Zitzler, Kalyanmoy Deb, and Lothar Thiele. 2000. Comparison of multiobjective evolutionary algorithms: Empirical results. Evolutionary computation 8, 2 (2000), 173--195.
[19]
Konstantinos G Zografos and Konstantinos N Androutsopoulos. 2008. Algorithms for itinerary planning in multimodal transportation networks. IEEE Transactions on Intelligent Transportation Systems 9, 1 (2008), 175--184.

Cited By

View all
  • (2022)A Public Transportation Reservation System for Congestion Relief with E-tickets2022 12th International Congress on Advanced Applied Informatics (IIAI-AAI)10.1109/IIAIAAI55812.2022.00085(397-402)Online publication date: Jul-2022

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
GECCO '18: Proceedings of the Genetic and Evolutionary Computation Conference
July 2018
1578 pages
ISBN:9781450356183
DOI:10.1145/3205455
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 02 July 2018

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. contingent planning
  2. markov decision process
  3. multi-objective journey planning
  4. non-deterministic planning

Qualifiers

  • Research-article

Funding Sources

  • Australian Research Council

Conference

GECCO '18
Sponsor:

Acceptance Rates

Overall Acceptance Rate 1,669 of 4,410 submissions, 38%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)10
  • Downloads (Last 6 weeks)0
Reflects downloads up to 20 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2022)A Public Transportation Reservation System for Congestion Relief with E-tickets2022 12th International Congress on Advanced Applied Informatics (IIAI-AAI)10.1109/IIAIAAI55812.2022.00085(397-402)Online publication date: Jul-2022

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media