Optimal timetable development for community shuttle network with metro stations |
| |
Institution: | 1. State Key Laboratory of Rail Traffic Control and Safety, Beijing Jiaotong University, Beijing 100044, PR China;2. Deparment of Engineering, Roma Tre University, via della vasca navale 79, Rome 00146, Italy;1. Transportation Research Center, Department of Civil and Environmental Engineering,University of Auckland, Auckland,1142 New Zealand;2. Faculty of Civil and Environmental Engineering, Technion-Israel Institute of Technology, Haifa, 32000 Israel |
| |
Abstract: | This paper investigates an issue for optimizing synchronized timetable for community shuttles linked with metro service. Considering a passenger arrival distribution, the problem is formulated to optimize timetables for multiple community shuttle routes, with the objective of minimizing passenger’s schedule delay cost and transfer cost. Two constraints, i.e., vehicle capacity and fleet size, are modeled in this paper. The first constraint is treated as soft, and the latter one is handled by a proposed timetable generating method. Two algorithms are employed to solve the problem, i.e., a genetic algorithm (GA) and a Frank–Wolfe algorithm combined with a heuristic algorithm of shifting departure times (FW-SDT). FW-SDT is an algorithm specially designed for this problem. The simulated and real-life examples confirm the feasibility of the two algorithms, and demonstrate that FW-SDT outperforms GA in both accuracy and effectiveness. |
| |
Keywords: | Timetable development Community shuttle Metro Fleet size Vehicle capacity |
本文献已被 ScienceDirect 等数据库收录! |
|