Artificial intelligence based bus routing in urban areas

Public transportation consists mostly of fixed transit systems, which have fixed stations, routes, and schedules. In this paper, a new approach for bus routing in public transportation is proposed, in which buses are traveling unbounded, adapting to passengers (not vice versa) by picking them up at...

Full description

Saved in:
Bibliographic Details
Published in2020 23rd International Symposium on Measurement and Control in Robotics (ISMCR) pp. 1 - 6
Main Authors Dimitriu, Adonisz, Harmati, Istvan
Format Conference Proceeding
LanguageEnglish
Published IEEE 15.10.2020
Subjects
ant colony optimization
artificial intelligence
artificial intelligence based bus routing
average travel time
bus routing
dial-a-ride problem
Economics
fixed transit systems
graph theory
Junctions
max-min ant system algorithm
minimax techniques
passenger layout
public transport
public transportation
road-network
road-network graphs
Roads
Routing
Schedules
scheduling
Task analysis
teleporting ants
urban areas
Online AccessGet full text

Cover

More Information
Summary:Public transportation consists mostly of fixed transit systems, which have fixed stations, routes, and schedules. In this paper, a new approach for bus routing in public transportation is proposed, in which buses are traveling unbounded, adapting to passengers (not vice versa) by picking them up at their current location and transferring them to their destinations. Bus routes need to be adjusted to the passenger layout. This problem is close to the Dial-a-Ride Problem (DARP), but the solution is searched on real road-network graphs. The goal is to find a globally optimal set of paths for a given number of buses, such that all passengers are transferred to their destinations while the average travel time is minimal. In this paper, a modified Max-Min Ant System (MMAS) algorithm is utilized.
DOI:10.1109/ISMCR51255.2020.9263763