The Dynamic Multi-Period Vehicle Routing Problem

Min Wen, Jean-Francois Cordeau, Gilbert Laporte, Jesper Larsen

    Research output: Book/ReportReport

    922 Downloads (Pure)

    Abstract

    This paper considers the Dynamic Multi-Period Vehicle Routing Problem which deals with the distribution of orders from a depot to a set of customers over a multi-period time horizon. Customer orders and their feasible service periods are dynamically revealed over time. The objectives are to minimize total travel costs and customer waiting, and to balance the daily workload over the planning horizon. This problem originates from a large distributor operating in Sweden. It is modeled as a mixed integer linear program, and solved by means of a three-phase heuristic that works over a rolling planning horizon. The multi-objective aspect of the problem is handled through a scalar technique approach. Computational results show that our solutions improve upon those of the Swedish distributor.
    Original languageEnglish
    Place of PublicationKgs. Lyngby
    PublisherDTU Management
    Number of pages22
    ISBN (Print)978-87-90855-44-4
    Publication statusPublished - 2009

    Keywords

    • dynamic
    • multi-objective
    • vehicle routing
    • multi-period
    • variable neighborhood search

    Fingerprint Dive into the research topics of 'The Dynamic Multi-Period Vehicle Routing Problem'. Together they form a unique fingerprint.

    Cite this