IDEAS home Printed from https://ideas.repec.org/a/ids/ijmore/v1y2009i1-2p228-245.html
   My bibliography  Save this article

List-graph colouring for multiple depot vehicle scheduling

Author

Listed:
  • Benoit Laurent
  • Jin-Kao Hao

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.

Suggested Citation

  • Benoit Laurent & Jin-Kao Hao, 2009. "List-graph colouring for multiple depot vehicle scheduling," International Journal of Mathematics in Operational Research, Inderscience Enterprises Ltd, vol. 1(1/2), pages 228-245.
    • Handle: RePEc:ids:ijmore:v:1:y:2009:i:1/2:p:228-245
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=22883
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Severino F. Galán, 2017. "Simple decentralized graph coloring," Computational Optimization and Applications, Springer, vol. 66(1), pages 163-185, January.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijmore:v:1:y:2009:i:1/2:p:228-245. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=320 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.