An iterated local search metaheuristic for the capacitated demand-driven timetabling problem
Year of publication: |
2023
|
---|---|
Authors: | Schettini, Tommaso ; Gendreau, Michel ; Jabali, Ola ; Malucelli, Federico |
Subject: | capacity | demand-driven timetabling | iterated local search | metaheuristic | metro timetabling | short-turning | variable neighborhood search | Heuristik | Heuristics | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Mathematische Optimierung | Mathematical programming | Tourenplanung | Vehicle routing problem | Linienverkehr | Scheduled transport |
-
Branch-and-bound-based local search heuristics for train timetabling on single-track railway network
Ampol Karoonsoontawong, (2017)
-
Robust university course timetabling problem subject to single and multiple disruptions
Gülcü, Ayla, (2020)
-
A hybrid iterated local search heuristic for the traveling salesperson problem with hotel selection
Sousa, Marques Moreira de, (2021)
- More ...
-
A Benders decomposition algorithm for demand-driven metro scheduling
Schettini, Tommaso, (2022)
-
Demand-driven timetabling for a metro corridor using a short-turning acceleration strategy
Schettini, Tommaso, (2022)
-
The traveling salesman problem with time-dependent service times
Taş, Duygu, (2016)
- More ...