Abstract
Presented in this research paper is an attempt to apply a cat swarm optimization (CSO)-based algorithm to the urban transit routing problem (UTRP). Using the proposed algorithm, we can attain feasible and efficient (near) optimal route sets for public transportation networks. It is, to our knowledge, the first time that cat swarm optimization (CSO)-based algorithm is applied to cope with this specific problem. The algorithm’s efficiency and excellent performance are demonstrated by conducting experiments with both real-world as well as artificial data. These specific data have also been used as test instances by other researchers in their publications. Computational results reveal that the proposed cat swarm optimization (CSO)-based algorithm exhibits better performance, using the same evaluation criteria, compared to most of the other existing approaches applied to the same test instances. The differences of the proposed algorithm in comparison with other published approaches lie in its main process, which is a modification of the classic cat swarm optimization (CSO) algorithm applied to solve the urban transit routing problem. This modification in addition to a variation of the initialization process, as well as the enrichment of the algorithm with a process of improving the final solution, constitute the innovations of this contribution. The UTRP is studied from both passenger and provider sides of interest, and the algorithm is applied in both cases according to necessary modifications.
Highlights
The urban transport system is an important feature of today’s urban areas
People throughout the world recognize the importance of having efficient urban public transport systems [2]
The formalism used to model the urban transit routing problem (UTRP) in this paper is the same with the one used in all contributions presented in the previous section
Summary
The urban transport system is an important feature of today’s urban areas. The design of high-quality urban transport systems comprises a major issue for modern cities due to their development, it and affects both pollution and environmental matters. In the last decades, scheduling and urban routing problems have attracted much attention of the respective scientific society, and many researchers have attempted to solve scheduling and urban routing problems by applying many different soft computing techniques Some of these attempts are presented in short in the related work section (see Section 1.1). In order to demonstrate the efficiency and effectiveness of the CSO-based algorithm, we compare its performance on the widely known Mandl’s Swiss transit network [25] with twelve other approaches presented in the respective literature. These approaches are presented in short in the related work section (see Section 1.1).
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
