Mixed integer programming with decomposition for workforce scheduling and routing with time-dependent activities constraints

Wasakorn Laesanklang, Dario Landa-Silva, J. Arturo Castillo-Salazar

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationICORES 2016 - Proceedings of the 5th International Conference on Operations Research and Enterprise Systems
EditorsBegona Vitoriano, Greg H. Parlier, Dominique de Werra
PublisherSciTePress
Pages330-339
Number of pages10
ISBN (Electronic)9789897581717
DOIs
Publication statusPublished - 2016
Externally publishedYes
Event5th International Conference on Operations Research and Enterprise Systems, ICORES 2016 - Rome, Italy
Duration: 23 Feb 201625 Feb 2016

Publication series

NameICORES 2016 - Proceedings of the 5th International Conference on Operations Research and Enterprise Systems

Conference

Conference5th International Conference on Operations Research and Enterprise Systems, ICORES 2016
Country/TerritoryItaly
CityRome
Period23/02/1625/02/16

Keywords

  • Mixed integer programming
  • Problem decomposition
  • Time-dependent activities constraints
  • Workforce scheduling and routing problem

Fingerprint

Dive into the research topics of 'Mixed integer programming with decomposition for workforce scheduling and routing with time-dependent activities constraints'. Together they form a unique fingerprint.

Cite this