Journal of the Korean Operations Research and Management Science Society (한국경영과학회지)
- Volume 17 Issue 3
- /
- Pages.159-170
- /
- 1992
- /
- 1225-1119(pISSN)
- /
- 2733-4759(eISSN)
Iterative time constraint addition algorithm for the crew scheduling problem
Abstract
The size of time constaints is the critical bottleneck of the Crew Scheduling Problem (CSP). This paper deals with a method to extract the minimum required time constraints by k-shortest path algorithm. These time constraints are added as the "insurance constraints" to avoid the unnecessary tree search, which are very time-consuming procedures, for the integer solutions. The computational results show that the problem size in LP formulation could be reduced by our method.
Keywords