JOURNAL BROWSE
Search
Advanced SearchSearch Tips
A Heuristic Polynomial Time Algorithm for Crew Scheduling Problem
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
A Heuristic Polynomial Time Algorithm for Crew Scheduling Problem
Lee, Sang-Un;
  PDF(new window)
 Abstract
This paper suggests heuristic polynomial time algorithm for crew scheduling problem that is a kind of optimization problems. This problem has been solved by linear programming, set cover problem, set partition problem, column generation, etc. But the optimal solution has not been obtained by these methods. This paper sorts transit costs to ascending order, and the task i and j crew paths are merged in case of the sum of operation time is less than day working time T. As a result, we can be obtain the minimum number of crews and minimum transit cost . For the transit cost of specific number of crews >, we delete the maximum as much as the number of , and to partition a crew path. For the 5 benchmark data, this algorithm can be gets less transit cost than state-of-the-art algorithms, and gets the minimum number of crews.
 Keywords
Tasks;Crews;Transit cost;Ascending sort;Path merge and partition;
 Language
Korean
 Cited by
 References
1.
J. E. Beasley and B. Cao, "A Tree Search Algorithm for the Crew Scheduling Problem," European Journal of Operational Research, Vol. 94, No. 3, pp. 517-526, Nov. 1996. crossref(new window)

2.
J. C. Falkner and D. M. Ryan, "Aspects of Bus Crew Scheduling System Using a Set Partitioning Model," Computer-Aided Transit Scheduling, Lecture Note in Economics Mathematical Systems, Vol. 308, pp. 91-103, 1988.

3.
G. W Graves, R. D. McBride, I. Gershkoff, D. Anderson, and D. Mahidhara, "Flight Crew Scheduling," Management Science, Vol. 39, No. 6, pp. 736-745, Jun. 1993. crossref(new window)

4.
I. Gershkoff, "Optimizing Flight Crew Schedules," Interfaces, Vol. 19, No. 4, pp. 29-43, Jul. 1989.

5.
K. L. Hoffman and M. Padberg, "Solving Airline Crew Scheduling Problems by Branch-and-Cut," Management Science, Vol. 39, No. 6, pp. 657-682, Jun. 1993. crossref(new window)

6.
T. G. Crainic and J. M. Rousseau, "The Column Generation Principle and the Airline Crew Scheduling Problem," INFOR, Vol. 25, pp. 136-151, 1987.

7.
M. Desrchers and F. Soumis, "A Column Generation Approach to the Urban Transit Crew Scheduling Problem," Transportation on Science, Vol. 23, nO. 1, pp. 1-13, Feb. 1989. crossref(new window)

8.
S. Lavoie, M. Minoux, and E. Gdier, "A New Approach for Crew Pairing Problems by Column Generation with an Application to Air Transportation," European Journal of Operational Research, Vol. 35, No. 1, pp. 45-58, Apr. 1988. crossref(new window)

9.
B. M. Smith, "IMPACS - a Bus Crew Scheduling System Using Integer Programming," Mathematical Programming, Vol. 42, No. 1-3, pp. 181-187, Apr. 1988. crossref(new window)

10.
H. Cheddad, "Algorithms for Crew Scheduling Problems," Ph.D thesis, Imperial College, London, 1987.

11.
M. Ball, L. Bodin and R. Dial, "A Matching Based Heuristic for Scheduling Mass Transit Crews and Vehicles," Transportation Science, Vol. 17, No. 1, pp. 4-31, Feb. 1983. crossref(new window)

12.
M. Ball and A. Roberts, "A Graph Partitioning Approach to Airline Crew Scheduling," Transportation Science, Vol. 19, No. 2, pp. 107-126, May. 1985. crossref(new window)

13.
S. Martello and P. Toth, "A Heuristic Approach to the Bus Driver Scheduling Problem," European Journal of Operational Research, Vol. 24, No. 1, pp. 106-117, Jan. 1986. crossref(new window)

14.
W. Qiao, "An Algorithm for Crew Scheduling Problem with Bin Packing Features," Master of Science, Department of Civil and Environmental Engineering, Faculty of the Graduate School of the University of Maryland, pp. 1-88, 2008.

15.
M. Chen and H. Niu, "A Model for Bus Crew Scheduling Problem with Multiple Duty Types," Discrete Dynamics in Nature and Society, Vol. 2012, Article ID: 649213, pp. 1-11, Aug. 2012.

16.
J. E. Beasley, "OR-Library: Crew Scheduling," http://people.brunel.ac.uk/-mastjjb/jeb/orlib/csinfo.html, 2013.

17.
R. G. Jeroslow, "Trivial Integer Programs Unsolvable by Branch-and-Bound," Mathematical Programming, Vol. 6, No. 1, pp. 105-109, Dec. 1974. crossref(new window)