본문 바로가기
  • Home

Swap-Insert Algorithm for Driver Scheduling Problem

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2014, 19(11), pp.175-181
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science

Sang-Un, Lee 1

1강릉원주대학교

Accredited

ABSTRACT

This paper suggests O(m) polynomial time heuristic algorithm to obtain the solution for the driverscheduling problem, DSP, that has been classified as NP-complete problem. The proposed algorithm getsthe initial assignment of n minimum number of drivers from given m schedules. Nextly, this algorithmgets the minimum total time (TC) using 5 rules of swap and insert for decrease of over times (OT) and idletimes (IT). Although this algorithm is a heuristic polynomial time algorithm with O(m)time complexityrules to be find a optimal (or approximate) solution, this algorithm is equal to metaheuristic methods forthe 5 experimental data. To conclude, this paper shows the DSP is not NP-complete problem butPolynomial time (P)-problem with polynomial time rules.

Citation status

* References for papers published after 2023 are currently being built.