论文信息 - Methods for routing with time windows - 字舞流文

Methods for routing with time windows

J. Desrosiers | M. Desrochers | F. Soumis | Michel SauvéGerad

[1] R. A. Zemlin,et al. Integer Programming Formulation of Traveling Salesman Problems , 1960, JACM.

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

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

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

[5] Paolo Toth,et al. State-space relaxation procedures for the computation of bounds to routing problems , 1981, Networks.

[6] Marshall L. Fisher,et al. A generalized assignment heuristic for vehicle routing , 1981, Networks.

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

[8] Martin Desrochers,et al. Optimal urban bus routing with scheduling flexibilities , 1984 .

[9] Jacques Desrosiers,et al. Routing with time windows by column generation , 1983, Networks.

[10] Arthur J. Swersey,et al. Scheduling School Buses , 1984 .