TY - GEN
T1 - Mixed integer programming with decomposition for workforce scheduling and routing with time-dependent activities constraints
AU - Laesanklang, Wasakorn
AU - Landa-Silva, Dario
AU - Castillo-Salazar, J. Arturo
N1 - Publisher Copyright:
Copyright © 2016 by SCITEPRESS - Science and Technology Publications, Lda. All rights reserved.
PY - 2016
Y1 - 2016
N2 - We present a mixed integer programming decomposition approach to tackle workforce scheduling and routing problems (WSRP) that involve time-dependent activities constraints. The proposed method is called repeated decomposition with conflict repair (RDCR) and it consists of repeatedly applying a phase of problem decomposition and sub-problem solving, followed by a phase dedicated to conflict repair. Five types of timedependent activities constraints are considered: overlapping, synchronisation, minimum difference, maximum difference, and minimum-maximum difference. Experiments are conducted to compare the proposed method to a tailored greedy heuristic. Results show that the proposed RDCR is an effective approach to harness the power of mixed integer programming solvers to tackle the difficult and highly constrained WSRP in practical computational time.
AB - We present a mixed integer programming decomposition approach to tackle workforce scheduling and routing problems (WSRP) that involve time-dependent activities constraints. The proposed method is called repeated decomposition with conflict repair (RDCR) and it consists of repeatedly applying a phase of problem decomposition and sub-problem solving, followed by a phase dedicated to conflict repair. Five types of timedependent activities constraints are considered: overlapping, synchronisation, minimum difference, maximum difference, and minimum-maximum difference. Experiments are conducted to compare the proposed method to a tailored greedy heuristic. Results show that the proposed RDCR is an effective approach to harness the power of mixed integer programming solvers to tackle the difficult and highly constrained WSRP in practical computational time.
KW - Mixed integer programming
KW - Problem decomposition
KW - Time-dependent activities constraints
KW - Workforce scheduling and routing problem
UR - http://www.scopus.com/inward/record.url?scp=84964903269&partnerID=8YFLogxK
U2 - 10.5220/0005757503300339
DO - 10.5220/0005757503300339
M3 - Conference contribution
AN - SCOPUS:84964903269
T3 - ICORES 2016 - Proceedings of the 5th International Conference on Operations Research and Enterprise Systems
SP - 330
EP - 339
BT - ICORES 2016 - Proceedings of the 5th International Conference on Operations Research and Enterprise Systems
A2 - Vitoriano, Begona
A2 - Parlier, Greg H.
A2 - de Werra, Dominique
PB - SciTePress
T2 - 5th International Conference on Operations Research and Enterprise Systems, ICORES 2016
Y2 - 23 February 2016 through 25 February 2016
ER -