Simple Search:

Genetic algorithm for biobjective urban transit routing problem


Citation

Chew, J. S. C. and Lee, Lai Soon and Seow, Hsin Vonn (2013) Genetic algorithm for biobjective urban transit routing problem. Journal of Applied Mathematics, 2013. art. no. 698645. pp. 1-15. ISSN 1110-757X; ESSN: 1687-0042

Abstract / Synopsis

This paper considers solving a biobjective urban transit routing problem with a genetic algorithm approach. The objectives are to minimize the passengers’ and operators’ costs where the quality of the route sets is evaluated by a set of parameters. The proposed algorithm employs an adding-node procedure which helps in converting an infeasible solution to a feasible solution. A simple yet effective route crossover operator is proposed by utilizing a set of feasibility criteria to reduce the possibility of producing an infeasible network. The computational results from Mandl’s benchmark problems are compared with other published results in the literature and the computational experiments show that the proposed algorithm performs better than the previous best published results in most cases.


Download File

[img]
Preview
PDF (Abstract)
Genetic algorithm for biobjective urban transit routing problem.pdf

Download (177kB) | Preview

Additional Metadata

Item Type: Article
Divisions: Faculty of Science
Institute for Mathematical Research
DOI Number: https://doi.org/10.1155/2013/698645
Publisher: Hindawi Publishing Corporation
Keywords: Genetic algorithm; Urban transit network design problem; Routing; Urban transit
Depositing User: Umikalthom Abdullah
Date Deposited: 24 Sep 2014 08:37
Last Modified: 15 Feb 2016 12:48
URI: http://psasir.upm.edu.my/id/eprint/30330
Statistic Details: View Download Statistic

Actions (login required)

View Item View Item