Accéder directement au contenu Accéder directement à la navigation
Article dans une revue

Iterated local search for the multiple depot vehicle scheduling problem

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.

Type de document :
Article dans une revue
Liste complète des métadonnées

https://hal.univ-angers.fr/hal-03255365
Contributeur : Okina Université d'Angers <>
Soumis le : mercredi 9 juin 2021 - 14:58:10
Dernière modification le : jeudi 10 juin 2021 - 03:39:58

Lien texte intégral

Identifiants

Collections

Citation

Benoit Laurent, Jin-Kao Hao. Iterated local search for the multiple depot vehicle scheduling problem. Computers & Industrial Engineering, Elsevier, 2009, 57 (1), pp.277 - 286. ⟨10.1016/j.cie.2008.11.028⟩. ⟨hal-03255365⟩

Partager

Métriques

Consultations de la notice

2