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

List-graph colouring for multiple depot vehicle scheduling

Abstract :

This article addresses a multiple depot vehicle scheduling problem (MDVSP) arising in public transportation. The general problem consists in assigning vehicles to trips while minimising the number of scheduled vehicles and the operational costs. The MDVSP considered here takes into account heterogeneous types of vehicles with complex relations among them. This special feature matches well situations encountered in practice, but makes the problem particularly difficult. We introduce a new formulation based on list-graph colouring, from which an iterative tabu search is developed for vehicle minimisation. The approach is assessed on seven real-world benchmarks and yields highly satisfactory results in terms of solution quality and computation time.

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

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

Lien texte intégral

Identifiants

Collections

Citation

Benoit Laurent, Jin-Kao Hao. List-graph colouring for multiple depot vehicle scheduling. International Journal of Mathematics in Operational Research, Inderscience, 2009, 1 (1), pp.228 - 245. ⟨10.1504/IJMOR.2009.022883⟩. ⟨hal-03255378⟩

Partager

Métriques

Consultations de la notice

3