Browse > Article
http://dx.doi.org/10.9708/jksci.2014.19.11.175

Swap-Insert Algorithm for Driver Scheduling Problem  

Lee, Sang-Un (Dept. of Multimedia Eng., Gangneung-Wonju National University)
Publication Information
Journal of the Korea Society of Computer and Information / v.19, no.11, 2014 , pp. 175-181 More about this Journal
Abstract
This paper suggests O(m) polynomial time heuristic algorithm to obtain the solution for the driver scheduling problem, DSP, that has been classified as NP-complete problem. The proposed algorithm gets the initial assignment of n minimum number of drivers from given m schedules. Nextly, this algorithm gets the minimum total time (TC) using 5 rules of swap and insert for decrease of over times (OT) and idle times (IT). Although this algorithm is a heuristic polynomial time algorithm with O(m) time complexity rules to be find a optimal (or approximate) solution, this algorithm is equal to metaheuristic methods for the 5 experimental data. To conclude, this paper shows the DSP is not NP-complete problem but Polynomial time (P)-problem with polynomial time rules.
Keywords
Driver scheduling problem; Parallelogram; Swap; Insert; Idle time;
Citations & Related Records
연도 인용수 순위
  • Reference
1 S. Groot and D. Huisman, "Vehicle and Crew Scheduling Solving Large Real-World Instances with an Integrated Approach," 9th International Conference onComputer-Aided Scheduling of Public Transport, San Diego, California, Lecture Notes in Economics and Mathematical Systems, Vol. 600, pp 43-56, 2008.
2 A.Wren, S. Fores, A. Kwan, R. Kwan,M. Parker, and L. Proll, "A Flexible Systemfor Scheduling Drivers," Journal of Scheduling, Vol. 6, No. 5, pp. 437-455, Sep. 2003.   DOI
3 H. R. Lourenco, J. P. Paixao, and R. Portugal, "Multiobjective Metaheuristics for the Bus-Driver Scheduling Problem," Transportation Science, Vol. 35, No. 3, pp. 331-343, Jun. 2001.   DOI   ScienceOn
4 G. R.Mauri and L. A. N. Lorena, "Driver Scheduling Generation Using a Population Training Algorithm," Brazilian Symposiumin Neural Networks, Sao Luis, Maranhao, Brazil, pp. 1-6, Sep. 2004.
5 G. R. Mauri and L. A. N. Lorena, "A New Hybrid Heuristic forDriver Scheduling," International Journal of Hybrid Intelligent Systems, Vol. 4, No. 1, pp. 39-47, Jan. 2007.   DOI
6 H. R. Lourenco, J. P. Paixao, and R. Portugal, "Metaheuristics for theBus-Driver SchedulingProblem," Department of Economics and Management, Universitat Pompeu Fabra, Vol. 35, pp. 1-26, Jul. 1998.
7 T. G. Dias, J. P. Sousa, and J. F. Cunha, "AGenetic Algorithmfor the Bus Driver Scheduling Problem," 4th InternationalConference of Metaheuristics, pp. 35-40, Jul. 2001.
8 R. Bai, J. Li, J. Atkin, and G. Kendall, "A Novel Approach to Independent Taxi Scheduling Problem Based on Stable Matching," Journal of Operational Research Society, pp. 1-10, Sep. 2013.
9 R. Portugal, H. R. Lourenco, and J. P. Paixao, "Driver Scheduling ProblemModeling," Public Transportation, Vol. 1, No. 2, pp. 103-120, Jun. 2009.   DOI
10 B. Laurent, V. Guihaire, and J. K. Hao, "AHeuristic Solution for a Driver-Vehicle Scheduling Problem," Proceedings of Operations Research, Vol. 2005, pp. 703-708, 2005.
11 R. Leone, P. Festa, and E.Marchitto, "A Bus Driver Scheduling Problem: ANewMathematicalModel and GRASP Approximate Solution," Journal of Heuristics, Vol. 17, No. 4, pp. 441-466, Aug. 2011.   DOI   ScienceOn
12 L. T. Shung, R. Ramli, and H. Ibrahim, "An Evolutionary Algorithm Approach to a Bus Driver Scheduling Problemwith Break-Time Consideration," Proceedings of the 5th Asian Mathematical Conference, Malaysia, pp. 652-658, Jun. 2009.
13 R. M. Karp, "Reducibility Among Combinatorial Problems," In Complexity of Computer Computations, Plenum Press, New York, pp. 85-103, 1972.
14 L. A. N. Lorena, "Problem Instances: Driver Scheduling," http://www.lac.inpe.br/-lorena/ nstancias.html, 2014.
15 Y. Shen and R. S. K. Kwan, "Tabu Search for Driver Scheduling," Computer-Aided Scheduling of Public Transport, Lecture Notes in Economics and Mathematical Systems, Springer-Velag, Berlin, Vol. 505, pp. 121-135, 2001.