Creating Bus Timetables with Maximal Synchronization by a New Algorithm Based on the PSO

摘要

This paper addresses the problem of receiving a timetable for a settled network with maximal synchronization. In this paper, a model has been developed to solve the problem which attaches importance to creating a timetable for maximizing their synchronization and enables the transfer of passengers from one route to another with least waiting times at transfer nodes. Next, this problem is formulated as a mixed integer linear programming problem, and a new algorithm based on the traditional particle swarm optimization (PSO) has been developed to solve the problem in a short time. Finally, the relationship of iterative time and the complexity of the given network is qualitatively established.