Iterated local search for the multiple depot vehicle scheduling problem

Authors:
Benoít Laurent;Jin-Kao Hao
Affiliations:
Perinfo SA, 41 Avenue Jean Jaurès, 67100 Strasbourg, France and LERIA, Université d'Angers 2 Boulevard Lavoisier, 49045 Angers Cedex 01, France;LERIA, Université d'Angers 2 Boulevard Lavoisier, 49045 Angers Cedex 01, France
Venue:
Computers and Industrial Engineering
Year:
2009

Citing 8
Cited 1

Linear network optimization: algorithms and codes

Linear network optimization: algorithms and codes
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
Vehicle scheduling in public transit and Lagrangean pricing

Management Science
Models and Algorithms for Single-Depot Vehicle Scheduling

Transportation Science
A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems

Management Science
Design and Analysis of Experiments

Design and Analysis of Experiments
A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem

Operations Research
A comparison of five heuristics for the multiple depot vehicle scheduling problem

Journal of Scheduling

Transit network timetabling and vehicle assignment for regulating authorities

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

The multiple depot vehicle scheduling problem (MDVSP) is a well-known and important problem arising in public transport. Although many solution approaches have been published in the literature, algorithms using metaheuristics appeared only very recently (large neighborhood search and Tabu search). In this paper, we introduce an iterated local search algorithm for the MDVSP, incorporating a neighborhood schema called ''block moves'', based on the notion of ejection chains. Using a set of benchmark instances, we show empirically that the proposed algorithm performs better than the best metaheuristics implemented so far and obtains high quality results within short computational times.