Evolutionary algorithms find routes in public transport network with optimal time of realization

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

Abstract

This paper presents a new evolutionary algorithm, called Routes Generation Evolutionary Algorithm with Knowledge (RGEAwK), for determining routes with optimal travel time in graph which models the public transport network. The method was implemented and tested on the real transport network. The effectiveness of the method was compared with Routes Generation Matrix Algorithm (RGMA) [8]. This comparison is based on the experimental results which were performed on realistic data. The paper ends with some remarks about future work on improving of RGEAwK. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Piwonska, A., & Koszelew, J. (2010). Evolutionary algorithms find routes in public transport network with optimal time of realization. In Communications in Computer and Information Science (Vol. 104 CCIS, pp. 194–201). Springer Verlag. https://doi.org/10.1007/978-3-642-16472-9_21

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