An improved formulation for the multi-depot open vehicle routing problem

Eduardo Lalla-Ruiz, Christopher Expósito-Izquierdo, Shervin Taheripour, Stefan Voß*

*Corresponding author for this work

    Research output: Contribution to journalArticleAcademicpeer-review

    40 Citations (Scopus)
    9 Downloads (Pure)

    Abstract

    The multi-depot open vehicle routing problem (MDOVRP) is a recent hard combinatorial optimization problem that belongs to the vehicle routing problem family. In the MDOVRP, the vehicles depart from several depots and once they have delivered the goods to the last customers in their routes they are not required to return to the depots. In this work, we propose a new mixed integer programming formulation for the MDOVRP by improving some constraints from the literature and proposing new ones. The computational experience carried out over problem instances from the literature indicates that our proposed model outperforms the existing one.

    Original languageEnglish
    Pages (from-to)175-187
    Number of pages13
    JournalOR Spectrum
    Volume38
    Issue number1
    DOIs
    Publication statusPublished - 1 Jan 2016

    Keywords

    • Delivery of goods
    • Mathematical model
    • Multi-depot open vehicle routing problem

    Fingerprint

    Dive into the research topics of 'An improved formulation for the multi-depot open vehicle routing problem'. Together they form a unique fingerprint.

    Cite this