An efficient optimisation procedure for the Workforce Scheduling and Routing Problem: Lagrangian relaxation and iterated local search

Open Webpage

Hanyu Gu, Yefei Zhang, Yakov Zinder

Published: 01 Jan 2022, Last Modified: 14 Apr 2025Comput. Oper. Res. 2022EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: Highlights•New iterated local search algorithm for the Workforce Scheduling and Routing Problem.•Iterated local search penalising constraint violation, using Lagrangian relaxation.•Good performance on instances based on standard Solomon’s benchmark routing problems.

OpenReview is a long-term project to advance science through improved peer review with legal nonprofit status. We gratefully acknowledge the support of the OpenReview Sponsors. © 2025 OpenReview