Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2013, Article ID 698645, 15 pages
Research Article

Genetic Algorithm for Biobjective Urban Transit Routing Problem

1Department of Mathematics, Faculty of Science, Universiti Putra Malaysia, (UPM), 43400 Serdang, Selangor, Malaysia
2Institute for Mathematical Research, Universiti Putra Malaysia, (UPM), 43400 Serdang, Selangor, Malaysia
3Nottingham University Business School, University of Nottingham Malaysia Campus, Jalan Broga, 43500 Semenyih, Selangor, Malaysia

Received 14 June 2013; Revised 21 October 2013; Accepted 21 October 2013

Academic Editor: Julián López-Gómez

Copyright © 2013 J. S. C. Chew et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


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.