An efficient optimisation procedure for the Workforce Scheduling and Routing Problem : Lagrangian relaxation and iterated local search
Year of publication: |
2022
|
---|---|
Authors: | Gu, Hanyu ; Zhang, Yefei ; Zinder, Yakov |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 144.2022, p. 1-18
|
Subject: | Iterated local search | Lagrangian relaxation | Workforce Scheduling and Routing | Tourenplanung | Vehicle routing problem | Mathematische Optimierung | Mathematical programming | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Personaleinsatzplanung | Crew scheduling | Heuristik | Heuristics |
-
An iterated local search metaheuristic for the capacitated demand-driven timetabling problem
Schettini, Tommaso, (2023)
-
A hybrid iterated local search heuristic for the traveling salesperson problem with hotel selection
Sousa, Marques Moreira de, (2021)
-
Upper and lower bounding procedures for the multiple knapsack assignment problem
Kataoka, Seiji, (2014)
- More ...
-
Bi-criteria sequencing of courses and formation of classes for a bottleneck classroom
Czibula, Oliver G., (2016)
-
A multi-stage IP-based heuristic for class timetabling and trainer rostering
Czibula, Oliver, (2017)
-
Improving problem reduction for 0-1 multidimensional Knapsack problems with valid inequalities
Gu, Hanyu, (2016)
- More ...