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

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

All Outputs (3)

A Genetic Algorithm for a Workforce Scheduling and Routing Problem (2016)
Conference Proceeding

The Workforce Scheduling and Routing Problem refers to the assignment of personnel to visits across various geographical locations. Solving this problem demands tackling scheduling and routing constraints while aiming to minimise the total operationa... Read More about A Genetic Algorithm for a Workforce Scheduling and Routing Problem.

Towards an efficient API for optimisation problems data (2016)
Conference Proceeding

The literature presents many application programming interfaces (APIs) and frameworks that provide state of the art algorithms and techniques for solving optimisation problems. The same cannot be said about APIs and frameworks focused on the problem... Read More about Towards an efficient API for optimisation problems data.

Mixed integer programming with decomposition for workforce scheduling and routing with time-dependent activities constraints (2016)
Conference Proceeding

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 (RD... Read More about Mixed integer programming with decomposition for workforce scheduling and routing with time-dependent activities constraints.