Subgraph Ejection Chains and Tabu Search for the Crew Scheduling Problem

1999 ◽  
Vol 50 (6) ◽  
pp. 608 ◽  
Author(s):  
L. Cavique ◽  
C. Rego ◽  
I. Themido
Keyword(s):  
Tabu Search ◽  
Crew Scheduling ◽  
Scheduling Problem ◽  
Ejection Chains ◽  
Crew Scheduling Problem

Tabu Search for Bus Crew Scheduling with Feasible Sets of Shifts

2014 ◽  
Vol 989-994 ◽  
pp. 2523-2527
Author(s):  
Jiao Wang ◽  
Ji Hui Ma ◽  
Wei Guan ◽  
Hai Ting Gu
Keyword(s):  
Tabu Search ◽  
Computational Experiment ◽  
Crew Scheduling ◽  
Scheduling Problem ◽  
Operational Cost ◽  
Multi Objective Programming ◽  
Labor Agreement ◽  
Feasible Sets ◽  
Operational Constraints ◽  
Crew Scheduling Problem

Public transit crew scheduling problem is to carry out the operations task with the minimum drivers and operational cost. It is a multi-objective programming problem, which is well-known to be NP-hard. Restrained by the operational constraints and labor agreement, all the feasible sets of shifts were pre-generated in this paper. This work established a penalty function to ensure the validity of the schedule, and a cost function to reduce costs. With the help of Tabu Search, a solution can be found easily. A computational experiment based on the real-world crew scheduling problem in China demonstrates the strength of this method.

Sign in / Sign up

Export Citation Format

Share Document