Abstract
In transport planning, one should allow passengers to travel through the complicated transportation scheme with efficient use of different modes of transport. In this paper, we propose the use of a cockroach swarm optimization algorithm for determining paths with the shortest travel time. In our approach, this algorithm has been modified to work with the time-expanded model. Therefore, we present how the algorithm has to be adapted to this model, including correctly creating solutions and defining steps and movement in the search space. By introducing the proposed modifications, we are able to solve journey planning. The results have shown that the performance of our approach, in terms of converging to the best solutions, is satisfactory. Moreover, we have compared our results with Dijkstra’s algorithm and a particle swarm optimization algorithm.
Highlights
Intensive studies on journey planning problems produced several models and many algorithms over the last few decades
We present the influence of the selected parameters of the cockroach swarm optimization (CSO) approach on the quality of the obtained solutions, using the variance analysis (ANOVA)
We developed many experiments to assess the performance of the presented CSO algorithm
Summary
Intensive studies on journey planning problems produced several models and many algorithms over the last few decades. The popularity of automated planning systems have motivated researchers to search for methods that are sufficient for practical applications and meet travellers’ expectations. There was considerable progress in the performance methods for journey planning in public transit networks in recent years. Upon consideration of public transport timetable models in respect of how they provide the best possible routes, we can divide them into graph-based models, representing the timetable as a graph, and array-based models, using an array for the given timetable. We focus on the time-expanded model, which is based on the concept of the shortest path problem and is still used in many practical applications
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
