A study of neighborhood structures for the multiple depot vehicle scheduling problem

Authors:
Benoît Laurent;Jin-Kao Hao
Affiliations:
Perinfo SA, Strasbourg, France and LERIA, Université d'Angers, Angers, France;LERIA, Université d'Angers, Angers, France
Venue:
SLS'07 Proceedings of the 2007 international conference on Engineering stochastic local search algorithms: designing, implementing and analyzing effective heuristics
Year:
2007

Citing 1
Cited 0

Ejection chains, reference structures and alternating path methods for traveling salesman problems

Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces the "block moves" neighborhood for the Multiple Depot Vehicle Scheduling Problem. Experimental studies are carried out on a set of benchmark instances to assess the quality of the proposed neighborhood and to compare it with two existing neighborhoods using shift and swap. The "block moves" neighborhood can be beneficial for any local search algorithm.