Travel Plans in Public Transit Networks Using Artificial Intelligence Planning Models
- 1 March 2019
- journal article
- research article
- Published by Taylor & Francis in Applied Artificial Intelligence
- Vol. 33 (5) , 440-461
Abstract
Users of public transit networks require tools that generate travel plans to traverse them. The main issue is that public transit networks are time and space dependent. Travel plans depend on the current location of users and transit units, along with a set of user preferences and time restrictions. In this work, we propose the design and development of artificial intelligence (AI) planning models for engineering travel plans for such networks. The proposed models consider temporal actions, bus locations, and user preferences as constraints, to restrict the set of travel plans generated. Our approach decouples model design from algorithm construction, providing a greater level of flexibility and richness of solutions. We also introduce an integer linear programming formulation, and a fast preprocessing procedure, to evaluate the quality of the solutions returned by the proposed planning models. Experimental results show that AI planning models can efficiently generate close to optimal solutions. Furthermore, our analysis identifies user preferences as the most critical factor that increases solution complexity for planning models.Keywords
Funding Information
- Secretaría de Ciencia, Humanidades, Tecnología e Innovación (CB-2013/220811)
- Universidad Autónoma de Nuevo León (PAICYT CE333-15)
This publication has 23 references indexed in Scilit:
- Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithmACM Journal of Experimental Algorithmics, 2010
- SHARCACM Journal of Experimental Algorithmics, 2009
- Engineering multilevel overlay graphs for shortest-path queriesACM Journal of Experimental Algorithmics, 2009
- Engineering Time-Expanded Graphs for Faster Timetable Information2009
- Fast Routing in Road Networks with Transit NodesScience, 2007
- Temporal Planning using Subgoal Partitioning and Resolution in SGPlanJournal of Artificial Intelligence Research, 2006
- Combining speed-up techniques for shortest-path computationsACM Journal of Experimental Algorithmics, 2005
- PDDL2.1: An Extension to PDDL for Expressing Temporal Planning DomainsJournal of Artificial Intelligence Research, 2003
- Planning Through Stochastic Local Search and Temporal Action Graphs in LPGJournal of Artificial Intelligence Research, 2003
- A note on two problems in connexion with graphsNumerische Mathematik, 1959