A Variable Neighborhood Search heuristic for rolling stock rescheduling.
Rowan HoogervorstTwan DollevoetGábor MarótiDennis HuismanPublished in: EURO J. Transp. Logist. (2021)
Keyphrases
- variable neighborhood search
- tabu search
- metaheuristic
- neighborhood search
- heuristic methods
- traveling salesman problem
- benchmark instances
- minimum spanning tree
- search procedure
- hybrid method
- vehicle routing problem
- routing problem
- single machine scheduling problem
- path relinking
- job shop
- feasible solution
- optimal solution
- exact algorithms
- simulated annealing
- scatter search
- job shop scheduling problem
- search algorithm
- limited discrepancy search
- combinatorial optimization problems
- solution quality
- combinatorial optimization