A hybrid algorithm for Urban transit schedule optimization

2018 ◽  
Vol 512 ◽  
pp. 745-755 ◽  
Author(s):  
Jinjun Tang ◽  
Yifan Yang ◽  
Yong Qi
2019 ◽  
Vol 2019 ◽  
pp. 1-16 ◽  
Author(s):  
Ahmed Tarajo Buba ◽  
Lai Soon Lee

This paper considers an urban transit network design problem (UTNDP) that deals with construction of an efficient set of transit routes and associated service frequencies on an existing road network. The UTNDP is an NP-hard problem, characterized by a huge search space, multiobjective nature, and multiple constraints in which the evaluation of candidate route sets can be both time consuming and challenging. This paper proposes a hybrid differential evolution with particle swarm optimization (DE-PSO) algorithm to solve the UTNDP, aiming to simultaneously optimize route configuration and service frequency with specific objectives in minimizing both the passengers’ and operators’ costs. Computational experiments are conducted based on the well-known benchmark data of Mandl’s Swiss network and a large dataset of the public transport system of Rivera City, Northern Uruguay. The computational results of the proposed hybrid algorithm improve over the benchmark obtained in most of the previous studies. From the perspective of multiobjective optimization, the proposed hybrid algorithm is able to produce a diverse set of nondominated solutions, given the passengers’ and operators’ costs are conflicting objectives.


ICT Express ◽  
2020 ◽  
Author(s):  
Pankaj Nanglia ◽  
Sumit Kumar ◽  
Aparna N. Mahajan ◽  
Paramjit Singh ◽  
Davinder Rathee

Sign in / Sign up

Export Citation Format

Share Document