A memetic algorithm for routing in urban public transportation networks

Authors:
Jolanta Koszelew;Krzysztof Ostrowski
Affiliations:
Faculty of Computer Science, Bialystok University of Technology;Faculty of Computer Science, Bialystok University of Technology
Venue:
ICAIS'11 Proceedings of the Second international conference on Adaptive and intelligent systems
Year:
2011

Citing 4
Cited 0

Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length

Journal of the ACM (JACM)
Multi-cast ant colony system for the bus routing problem

Metaheuristics
Efficient models for timetable information in public transportation systems

Journal of Experimental Algorithmics (JEA)
A cultural algorithm for the urban public transportation

HAIS'10 Proceedings of the 5th international conference on Hybrid Artificial Intelligence Systems - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a new memetic algorithm, which solves bi-criteria version of Routing Problem in Urban Public Transportation Networks. Our solution returns a set of routes, containing at most k quasi-optimal paths with the earliest arrival in the first instance and with minimal number of transfers in the second. The method was implemented and tested on the real-life public transportation network of Warsaw city in Poland. This network was completed with walk links and therefore resultant routes are more practical. Effectiveness of the described solution was compared in two aspects: time complexity and quality of results, with another three algorithms for considered problem. Computational experiments clearly show the memetic algorithm be highly competitive with comparable ones, yielding new improved solutions in the most cases of tested source/destination specifications.