A hybrid optimization approach for employee rostering: Use cases at Swissgrid and lessons learned

11/21/2021
by   Jangwon Park, et al.
0

Employee rostering is a process of assigning available employees to open shifts. Automating it has ubiquitous practical benefits for nearly all industries, such as reducing manual workload and producing flexible, high-quality schedules. In this work, we develop a hybrid methodology which combines Mixed-Integer Linear Programming (MILP) with scatter search, an evolutionary algorithm, having as use case the optimization of employee rostering for Swissgrid, where it is currently a largely manual process. The hybrid methodology guarantees compliance with labor laws, maximizes employees' preference satisfaction, and distributes workload as uniformly as possible among them. Above all, it is shown to be a robust and efficient algorithm, consistently solving realistic problems of varying complexity to near-optimality an order of magnitude faster than an MILP-alone approach using a state-of-the-art commercial solver. Several practical extensions and use cases are presented, which are incorporated into a software tool currently being in pilot use at Swissgrid.

READ FULL TEXT
research
04/29/2023

Local Search for Integer Linear Programming

Integer linear programming models a wide range of practical combinatoria...
research
03/16/2017

A Visual Web Tool to Perform What-If Analysis of Optimization Approaches

In Operation Research, practical evaluation is essential to validate the...
research
04/26/2023

Hybrid Genetic Algorithm and Mixed Integer Linear Programming for Flying Sidekick TSP

The increasing use of drones to perform various tasks has motivated an e...
research
06/10/2020

Toward a standardized methodology for constructing quantum computing use cases

We propose a standardized methodology for developing and evaluating use ...
research
03/12/2023

Towards Practical Multi-Robot Hybrid Tasks Allocation for Autonomous Cleaning

Task allocation plays a vital role in multi-robot autonomous cleaning sy...
research
11/15/2021

Sometimes, Convex Separable Optimization Is Much Harder than Linear Optimization, and Other Surprises

An influential 1990 paper of Hochbaum and Shanthikumar made it common wi...

Please sign up or login with your details

Forgot password? Click here to reset