List-graph colouring for multiple depot vehicle scheduling

Benoit Laurent and Jin-Kao Hao

International Journal of Mathematics in Operational Research, 2009, vol. 1, issue 1/2, 228-245

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.

Keywords: ILS; iterated local search; list colouring; multiple depot vehicle scheduling; tabu search; public transport; vehicle assignment. (search for similar items in EconPapers)
Date: 2009
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.inderscience.com/link.php?id=22883 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:1:y:2009:i:1/2:p:228-245

Access Statistics for this article

More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().