Discrete wolf pack search algorithm based transit network design

摘要

Transit network design problem is a typical NP-complete problem, when designing the transit network, we have to maximize the number of satisfied passengers, the total number of transfers and the total travel time of all served passengers. To some extent, it is also a multi-criteria decision-making problem. In this paper, a new model based on discrete wolf pack search algorithm (DWPS) is proposed to solve this problem. Our method can coordinate the exploration and exploitation abilities, which are the main factors that affect the performance of swarm intelligence algorithms. The experimental results show that the proposed DWPS is quite competitive compared with many existing techniques.