Author(s)

Ahmed Tarajo Buba¹, Lai Soon Lee^1,2

¹Department of Mathematics, Faculty of Science, Universiti Putra Malaysia, Selangor, Malaysia.
²Laboratory of Computational Statistics and Operations Research, Institute for Mathematical Research, Universiti Putra Malaysia, Selangor, Malaysia.

The urban transit routing problem (UTRP) involves the construction of route sets on existing road networks to cater for the transit demand efficiently. This is an NP-hard problem, where the generation of candidate route sets can lead to a number of potential routes being discarded on the grounds of infeasibility. This paper presents a new repair mechanism to complement the existing terminal repair and the make-small-change operators in dealing with the infeasibility of the candidate route set. When solving the UTRP, the general aim is to determine a set of transit route networks that achieves a minimum total cost for both the passenger and the operator. With this in mind, we propose a differential evolution (DE) algorithm for solving the UTRP with a specific objective of minimizing the average travel time of all served passengers. Computational experiments are performed on the basis of benchmark Mandl’s Swiss network. Computational results from the proposed repair mechanism are comparable with the existing repair mechanisms. Furthermore, the combined repair mechanisms of all three operators produced very promising results. In addition, the proposed DE algorithm outperformed most of the published results in the literature.

Urban Transit, Routing, Network, Repair Mechanism, Differential Evolution

Buba, A. and Lee, L. (2016) Differential Evolution for Urban Transit Routing Problem. Journal of Computer and Communications, 4, 11-25. doi: 10.4236/jcc.2016.414002.