Genetic algorithm for scheduling routes in public transport

N/ACitations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper a genetic algorithm for scheduling routes in public transport is presented. It combines bus, light rail and metro, with access to other sea and air communication nodes. Results are compared with the shortest path routing algorithm Dijkstra, optimizing the distance and generation of a greenhouse gas as CO2. The proposed algorithm has a computational cost advantage compared to shortest path algorithms.

Cite

CITATION STYLE

APA

de Los Angeles Saez Blazquez, M., Garcia-Galan, S., Munoz-Exposito, J. E., & De Prado, R. P. (2014). Genetic algorithm for scheduling routes in public transport. In Advances in Intelligent Systems and Computing (Vol. 233, pp. 399–406). Springer Verlag. https://doi.org/10.1007/978-3-319-01622-1_45

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free