A local search algorithm for train unit shunting with service scheduling
| Year of publication: |
2022
|
|---|---|
| Authors: | Broek, Roel van den ; Hoogeveen, J. A. ; Akker, J. M. van den ; Huisman, Bob |
| Published in: |
Transportation science. - Hanover, Md. : INFORMS, ISSN 1526-5447, ZDB-ID 2015901-8. - Vol. 56.2022, 1, p. 141-161
|
| Subject: | local search | scheduling | shunting | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Tourenplanung | Vehicle routing problem | Theorie | Theory |
-
A k-swap local search for makespan scheduling
Rohwedder, Lars, (2025)
-
An effective iterated two-stage heuristic algorithm for the multiple Traveling Salesmen Problem
Zheng, Jiongzhi, (2022)
-
An efficient heuristic for the fixed-route vehicle-refueling problem
Schulz, Arne, (2023)
- More ...
-
Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs
Akker, J. M. van den, (2010)
-
Decomposition approaches for recoverable robust optimization problems
Akker, J. M. van den, (2016)
-
Tönissen, D. D., (2017)
- More ...