Genetic algorithm for biobjective urban transit routing problem

Tools

Chew, J.S.C., Lee, L.S. and Seow, H.V. (2013) Genetic algorithm for biobjective urban transit routing problem. Journal of Applied Mathematics, 2013 (698645). ISSN 1110-757X

[img] PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Available under Licence Creative Commons Attribution.
Download (2MB)

Abstract

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.

Item Type: Article
Schools/Departments: University of Nottingham, Malaysia > Faculty of Arts and Social Sciences > Nottingham University Business School
Identification Number: https://doi.org/10.1155/2013/698645
Depositing User: Davies, Mrs Sarah
Date Deposited: 30 Apr 2014 12:17
Last Modified: 14 Oct 2017 13:46
URI: https://eprints.nottingham.ac.uk/id/eprint/2994

Actions (Archive Staff Only)

Edit View Edit View