论文信息 - Optimal urban bus routing with scheduling flexibilities

Optimal urban bus routing with scheduling flexibilities

These results show that urban transit routing problems with flexible schedules can be solved optimally. Problems with wider time intervals could be solved, and the network aggregation used allows systems of up to 500 trips to be handled without memory problems.

[1] Ulf Bokinge,et al. Improved vehicle scheduling in public transport through systematic changes in the time-table , 1980 .

[2] Abraham Mehrez. Development and marketing strategies for a class of R and D projects, with time independent stochastic returns , 1983 .

[3] L. Bodin. ROUTING AND SCHEDULING OF VEHICLES AND CREWS–THE STATE OF THE ART , 1983 .

[4] P. Toth,et al. Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem , 1980 .

[5] Amos Levin. Scheduling and Fleet Routing Models for Transportation Systems , 1971 .

[6] Mandell Bellmore,et al. Pathology of Traveling-Salesman Subtour-Elimination Algorithms , 1971, Oper. Res..

[7] J. Desrosiers,et al. Plus court chemin avec contraintes d'horaires , 1983 .

[8] Jacques Desrosiers,et al. ROUTING AND SCHEDULING WITH TIME WINDOWS SOLVED BY NETWORK RELAXATION AND BRANCH-AND-BOUND ON TIME VARIABLES. FROM THE BOOK COMPUTER SCHEDULING OF PUBLIC TRANSPORT 2 , 1985 .