Tabu Search for Bus Crew Scheduling with Feasible Sets of Shifts

Jiao Wang; Ji Hui Ma; Wei Guan; Hai Ting Gu

doi:10.4028/www.scientific.net/AMR.989-994.2523

Paper Titles

The Application of Correlation Dimension in the Multi-Objective Comprehensive Evaluation of the Large Complex Equipment Procurement Scheme
p.2507

Modeling and Simulation of Vehicle Traffic Detection System Based on Ground Sense Coil
p.2511

Efficient Simulation for Dynamic Systems with Discontinuities
p.2515

Optimization Model and Algorithm for Responsive Closed-Loop Supply Chain Logistics Network with Direct Shipment under E-Commerce
p.2519

Tabu Search for Bus Crew Scheduling with Feasible Sets of Shifts
p.2523

Modified Harmony Search Algorithm for Unconstrained Numerical Optimization Problems
p.2528

A Modified Harmony Search Algorithm for Numerical Optimization Problems
p.2532

Modified Differential Evolution Algorithm for Numerical Optimization Problems
p.2536

People Counting Based on the Moving Feature of the Mass
p.2540

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 989-994Tabu Search for Bus Crew Scheduling with Feasible...

Tabu Search for Bus Crew Scheduling with Feasible Sets of Shifts

Abstract:

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.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 989-994)

Pages:

2523-2527

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.989-994.2523

Citation:

Cite this paper

Online since:

July 2014

Authors:

Jiao Wang*, Ji Hui Ma, Wei Guan, Hai Ting Gu

Keywords:

Crew Scheduling, Feasible Sets of Shifts, Tabu Search

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] Darby-Dowman K, Mitra G. An extension of set partitioning with application to scheduling problems [J]. European Journal of Operational Research, 1985, 21(2): 200-205.

DOI: 10.1016/0377-2217(85)90031-1

Google Scholar

[2] Clement R, Wren A. Greedy genetic algorithms, optimizing mutations and bus driver scheduling [M]. Springer Berlin Heidelberg, (1995).

DOI: 10.1007/978-3-642-57762-8_14

Google Scholar

[3] Lourenço H R, Paixão J P, Portugal R. Multiobjective metaheuristics for the bus driver scheduling problem[J]. Transportation Science, 2001, 35(3): 331-343.

DOI: 10.1287/trsc.35.3.331.10147

Google Scholar

[4] Freling R, Lentink R M, Odijk M A. Scheduling train crews: A case study for the Dutch railways[M]. Springer Berlin Heidelberg, (2001).

DOI: 10.1007/978-3-642-56423-9_9

Google Scholar

[5] Deng G F, Lin W T. Ant colony optimization-based algorithm for airline crew scheduling problem[J]. Expert Systems with Applications, 2011, 38(5): 5787-5793.

DOI: 10.1016/j.eswa.2010.10.053

Google Scholar

[6] De Leone R, Festa P, Marchitto E. A Bus Driver Scheduling Problem: a new mathematical model and a GRASP approximate solution [J]. Journal of Heuristics, 2011, 17(4): 441-466.

DOI: 10.1007/s10732-010-9141-3

Google Scholar

[7] F. Glover and E. Taillard, A User's Guide to Tabu Search, Annals of Operations Research, 41, 1993, 3-28.

DOI: 10.1007/bf02078647

Google Scholar