IDEAS home Printed from https://ideas.repec.org/p/hal/journl/hal-02117608.html
   My bibliography  Save this paper

A branch-and-price algorithm for a vehicle routing with demand allocation problem

Author

Listed:
  • Mohammad Reihaneh

    (LEM - Lille économie management - UMR 9221 - UA - Université d'Artois - UCL - Université catholique de Lille - Université de Lille - CNRS - Centre National de la Recherche Scientifique)

  • Ahmed Ghoniem

Abstract

We investigate the vehicle routing with demand allocation problem where the decision-maker jointly optimizes the location of delivery sites, the assignment of customers to (preferably convenient) delivery sites, and the routing of vehicles operated from a central depot to serve customers at their designated sites. We propose an effective branch-and-price (B&P) algorithm that is demonstrated to greatly outperform the use of commercial branch-and-bound/cut solvers such as CPLEX. Central to the efficacy of the proposed B&P algorithm is the development of a specialized dynamic programming procedure that extends works on elementary shortest path problems with resource constraints in order to solve the more complex column generation pricing subproblem. Our computational study demonstrates the efficacy of the proposed approach using a set of 60 problem instances. Moreover, the proposed methodology has the merit of providing optimal solutions in run times that are significantly shorter than those reported for decomposition-based heuristics in the literature.

Suggested Citation

  • Mohammad Reihaneh & Ahmed Ghoniem, 2019. "A branch-and-price algorithm for a vehicle routing with demand allocation problem," Post-Print hal-02117608, HAL.
    • Handle: RePEc:hal:journl:hal-02117608
    DOI: 10.1016/j.ejor.2018.06.049
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

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


    Cited by:

    1. Mostafaei, Hossein & Castro, Pedro M. & Oliveira, Fabricio & Harjunkoski, Iiro, 2021. "Efficient formulation for transportation scheduling of single refinery multiproduct pipelines," European Journal of Operational Research, Elsevier, vol. 293(2), pages 731-747.
    2. Reihaneh, Mohammad & Abouei Ardakan, Mostafa & Eskandarpour, Majid, 2022. "An exact algorithm for the redundancy allocation problem with heterogeneous components under the mixed redundancy strategy," European Journal of Operational Research, Elsevier, vol. 297(3), pages 1112-1125.
    3. Reihaneh, Mohammad & Ansari, Sina & Farhadi, Farbod, 2023. "Patient appointment scheduling at hemodialysis centers: An exact branch and price approach," European Journal of Operational Research, Elsevier, vol. 309(1), pages 35-52.
    4. Guido Marseglia & Carlo Maria Medaglia & Francisco A. Ortega & Juan A. Mesa, 2019. "Optimal Alignments for Designing Urban Transport Systems: Application to Seville," Sustainability, MDPI, vol. 11(18), pages 1-14, September.
    5. Carrese, Stefano & Cuneo, Valerio & Nigro, Marialisa & Pizzuti, Raffaele & Ardito, Cosimo Federico & Marseglia, Guido, 2022. "Optimization of downstream fuel logistics based on road infrastructure conditions and exposure to accident events," Transport Policy, Elsevier, vol. 124(C), pages 96-105.
    6. Christian Tilk & Katharina Olkis & Stefan Irnich, 2021. "The last-mile vehicle routing problem with delivery options," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(4), pages 877-904, December.
    7. Li, Jiliu & Qin, Hu & Baldacci, Roberto & Zhu, Wenbin, 2020. "Branch-and-price-and-cut for the synchronized vehicle routing problem with split delivery, proportional service time and multiple time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 140(C).

    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:hal:journl:hal-02117608. 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.