Joint vehicle and crew routing and scheduling

Edward Lam*, Pascal Van Hentenryck, Philip Kilby

*Corresponding author for this work

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    10 Citations (Scopus)


    Traditional vehicle routing problems implicitly assume only one crew operates a vehicle for the entirety of its journey. However, this assumption is violated in many applications arising in humanitarian and military logistics. This paper considers a Joint Vehicle and Crew Routing and Scheduling Problem, in which crews are able to interchange vehicles, resulting in space and time interdependencies between vehicle routes and crew routes. It proposes a constraint programming model that overlays crew routing constraints over a standard vehicle routing problem. The constraint programming model uses a novel optimization constraint that detects infeasibility and bounds crew objectives. Experimental results demonstrate significant benefits of using constraint programming over mixed integer programming and a vehicle-then-crew sequential approach.

    Original languageEnglish
    Title of host publicationPrinciples and Practice of Constraint Programming - 21st International Conference, CP 2015, Proceedings
    EditorsGilles Pesant
    PublisherSpringer Verlag
    Number of pages17
    ISBN (Print)9783319232188
    Publication statusPublished - 2015
    Event21st International Conference on the Principles and Practice of Constraint Programming, CP 2015 - Cork, Ireland
    Duration: 31 Aug 20154 Sept 2015

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349


    Conference21st International Conference on the Principles and Practice of Constraint Programming, CP 2015


    Dive into the research topics of 'Joint vehicle and crew routing and scheduling'. Together they form a unique fingerprint.

    Cite this