An Integrated Model of Vehicle and Crew Scheduling with Multi-Depots

Author

Zhao Le ; Shen Yindong

Author_Institution

Dept. of Control Sci. & Eng., Huazhong Univ. of Sci. & Technol., Wuhan, China

fYear

2009

fDate

11-13 Dec. 2009

Firstpage

1

Lastpage

4

Abstract

In mass transit scheduling, the number of precompiled potential shifts would be extremely large, usually more than the exponential of the number of potential spells. To solve the integrated vehicle and crew scheduling problem (ISP) without the aid of precompiled potential shifts, a spell-based integer linear programming (ILP) model is proposed. The model can deal with the ISP with multi-depots. The integrated vehicle and crew schedule is formed simultaneously by linking the spells and assigning depots to the spells during the scheduling process. The computational complexity of the model is finally analyzed. Experiments have shown the validity and efficiency of the model.

Keywords

computational complexity; integer programming; linear programming; vehicles; computational complexity; integrated vehicle and crew scheduling problem; multidepots; spell-based integer linear programming model; Automotive engineering; Computational complexity; Costs; Integer linear programming; Joining processes; Processor scheduling; Quality of service; Vehicles;

fLanguage

English

Publisher

ieee

Conference_Titel

Computational Intelligence and Software Engineering, 2009. CiSE 2009. International Conference on

Conference_Location

Wuhan

Print_ISBN

978-1-4244-4507-3

Electronic_ISBN

978-1-4244-4507-3

Type

conf

DOI

10.1109/CISE.2009.5365348

Filename

5365348