Open Access
Translator Disclaimer
2013 Genetic Algorithm for Biobjective Urban Transit Routing Problem
J. S. C. Chew, L. S. Lee, H. V. Seow
J. Appl. Math. 2013: 1-15 (2013). DOI: 10.1155/2013/698645


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 Citation

J. S. C. Chew. L. S. Lee. H. V. Seow. "Genetic Algorithm for Biobjective Urban Transit Routing Problem." J. Appl. Math. 2013 1 - 15, 2013.


Published: 2013
First available in Project Euclid: 14 March 2014

MathSciNet: MR3147872
Digital Object Identifier: 10.1155/2013/698645

Rights: Copyright © 2013 Hindawi


Vol.2013 • 2013
Back to Top