The dynamic multi-period vehicle routing problem

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

    Research output: Contribution to journalJournal articleResearchpeer-review

    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 the proposed approach can yield high quality solutions within reasonable running times.
    Original languageEnglish
    JournalComputers & Operations Research
    Volume37
    Issue number9
    Pages (from-to)1615-1623
    ISSN0305-0548
    DOIs
    Publication statusPublished - 2010

    Keywords

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

    Cite this

    Wen, Min ; Cordeau, Jean-Francois ; Laporte, Gilbert ; Larsen, Jesper. / The dynamic multi-period vehicle routing problem. In: Computers & Operations Research. 2010 ; Vol. 37, No. 9. pp. 1615-1623.
    @article{c47882417b0c4a69979cb557ed3f48a1,
    title = "The dynamic multi-period vehicle routing problem",
    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 the proposed approach can yield high quality solutions within reasonable running times.",
    keywords = "dynamic, multi-objective, vehicle routing, multi-period, variable neighborhood search",
    author = "Min Wen and Jean-Francois Cordeau and Gilbert Laporte and Jesper Larsen",
    year = "2010",
    doi = "10.1016/j.cor.2009.12.002",
    language = "English",
    volume = "37",
    pages = "1615--1623",
    journal = "Computers & Operations Research",
    issn = "0305-0548",
    publisher = "Pergamon Press",
    number = "9",

    }

    The dynamic multi-period vehicle routing problem. / Wen, Min; Cordeau, Jean-Francois; Laporte, Gilbert; Larsen, Jesper.

    In: Computers & Operations Research, Vol. 37, No. 9, 2010, p. 1615-1623.

    Research output: Contribution to journalJournal articleResearchpeer-review

    TY - JOUR

    T1 - The dynamic multi-period vehicle routing problem

    AU - Wen, Min

    AU - Cordeau, Jean-Francois

    AU - Laporte, Gilbert

    AU - Larsen, Jesper

    PY - 2010

    Y1 - 2010

    N2 - 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 the proposed approach can yield high quality solutions within reasonable running times.

    AB - 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 the proposed approach can yield high quality solutions within reasonable running times.

    KW - dynamic

    KW - multi-objective

    KW - vehicle routing

    KW - multi-period

    KW - variable neighborhood search

    U2 - 10.1016/j.cor.2009.12.002

    DO - 10.1016/j.cor.2009.12.002

    M3 - Journal article

    VL - 37

    SP - 1615

    EP - 1623

    JO - Computers & Operations Research

    JF - Computers & Operations Research

    SN - 0305-0548

    IS - 9

    ER -