IDEAS home Printed from https://ideas.repec.org/a/spr/cejnor/v26y2018i2d10.1007_s10100-017-0503-x.html
   My bibliography  Save this article

Exact solutions for the collaborative pickup and delivery problem

Author

Listed:
  • Margaretha Gansterer

    (University of Vienna)

  • Richard F. Hartl

    (University of Vienna)

  • Philipp E. H. Salzmann

    (University of Vienna)

Abstract

In this study we investigate the decision problem of a central authority in pickup and delivery carrier collaborations. Customer requests are to be redistributed among participants, such that the total cost is minimized. We formulate the problem as multi-depot traveling salesman problem with pickups and deliveries. We apply three well-established exact solution approaches and compare their performance in terms of computational time. To avoid unrealistic solutions with unevenly distributed workload, we extend the problem by introducing minimum workload constraints. Our computational results show that, while for the original problem Benders decomposition is the method of choice, for the newly formulated problem this method is clearly dominated by the proposed column generation approach. The obtained results can be used as benchmarks for decentralized mechanisms in collaborative pickup and delivery problems.

Suggested Citation

  • Margaretha Gansterer & Richard F. Hartl & Philipp E. H. Salzmann, 2018. "Exact solutions for the collaborative pickup and delivery problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 26(2), pages 357-371, June.
    • Handle: RePEc:spr:cejnor:v:26:y:2018:i:2:d:10.1007_s10100-017-0503-x
    DOI: 10.1007/s10100-017-0503-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10100-017-0503-x
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10100-017-0503-x?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Dumas, Yvan & Desrosiers, Jacques & Soumis, Francois, 1991. "The pickup and delivery problem with time windows," European Journal of Operational Research, Elsevier, vol. 54(1), pages 7-22, September.
    2. Cruijssen, F. & Braysy, O. & Dullaert, W. & Fleuren, H.A. & Salomon, M., 2006. "Joint Route Planning under Varying Market Conditions," Discussion Paper 2006-49, Tilburg University, Center for Economic Research.
    3. Paul Buijs & Jose Alejandro Lopez Alvarez & Marjolein Veenstra & Kees Jan Roodbergen, 2016. "Improved Collaborative Transport Planning at Dutch Logistics Service Provider Fritom," Interfaces, INFORMS, vol. 46(2), pages 119-132, April.
    4. Lotte Verdonck & AN Caris & Katrien Ramaekers & Gerrit K. Janssens, 2013. "Collaborative Logistics from the Perspective of Road Transportation Companies," Transport Reviews, Taylor & Francis Journals, vol. 33(6), pages 700-719, November.
    5. Kalantari, Bahman & Hill, Arthur V. & Arora, Sant R., 1985. "An algorithm for the traveling salesman problem with pickup and delivery customers," European Journal of Operational Research, Elsevier, vol. 22(3), pages 377-386, December.
    6. Jeroen Beliën & Robert Boute & Stefan Creemers & Philippe de Bruecker & Joren Gijsbrechts & Silvia Valeria Padilla Tinoco & Wouter Verheyen, 2017. "Collaborative Shipping : Logistics in the Sharing Economy," Post-Print hal-01797315, HAL.
    7. Cherkesly, Marilène & Desaulniers, Guy & Irnich, Stefan & Laporte, Gilbert, 2016. "Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks," European Journal of Operational Research, Elsevier, vol. 250(3), pages 782-793.
    8. Stefan Ropke & Jean-François Cordeau, 2009. "Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows," Transportation Science, INFORMS, vol. 43(3), pages 267-286, August.
    9. Berbeglia, Gerardo & Cordeau, Jean-François & Laporte, Gilbert, 2010. "Dynamic pickup and delivery problems," European Journal of Operational Research, Elsevier, vol. 202(1), pages 8-15, April.
    10. Masson, Renaud & Ropke, Stefan & Lehuédé, Fabien & Péton, Olivier, 2014. "A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes," European Journal of Operational Research, Elsevier, vol. 236(3), pages 849-862.
    11. Gerardo Berbeglia & Jean-François Cordeau & Irina Gribkovskaia & Gilbert Laporte, 2007. "Rejoinder on: Static pickup and delivery problems: a classification scheme and survey," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 15(1), pages 45-47, July.
    12. R H Currie & S Salhi, 2003. "Exact and heuristic methods for a full-load, multi-terminal, vehicle scheduling problem with backhauling and time windows," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(4), pages 390-400, April.
    13. Wang, Xin & Kopfer, Herbert & Gendreau, Michel, 2014. "Operational transportation planning of freight forwarding companies in horizontal coalitions," European Journal of Operational Research, Elsevier, vol. 237(3), pages 1133-1141.
    14. Manuel Sanchez & Lorena Pradenas & Jean-Christophe Deschamps & Victor Parada, 2016. "Reducing the carbon footprint in a vehicle routing problem by pooling resources from different companies," Netnomics, Springer, vol. 17(1), pages 29-45, July.
    15. Quan Lu & Maged Dessouky, 2004. "An Exact Algorithm for the Multiple Vehicle Pickup and Delivery Problem," Transportation Science, INFORMS, vol. 38(4), pages 503-514, November.
    16. Sridhar, Varadharajan & Park, June S., 2000. "Benders-and-cut algorithm for fixed-charge capacitated network design problem," European Journal of Operational Research, Elsevier, vol. 125(3), pages 622-632, September.
    17. Roberto Baldacci & Enrico Bartolini & Aristide Mingozzi, 2011. "An Exact Algorithm for the Pickup and Delivery Problem with Time Windows," Operations Research, INFORMS, vol. 59(2), pages 414-426, April.
    18. Dondo, Rodolfo & Cerda, Jaime, 2007. "A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1478-1507, February.
    19. Irnich, Stefan, 2000. "A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles," European Journal of Operational Research, Elsevier, vol. 122(2), pages 310-328, April.
    20. Detti, Paolo & Papalini, Francesco & Lara, Garazi Zabalo Manrique de, 2017. "A multi-depot dial-a-ride problem with heterogeneous vehicles and compatibility constraints in healthcare," Omega, Elsevier, vol. 70(C), pages 1-14.
    21. Margaretha Gansterer & Richard F. Hartl, 2016. "Request evaluation strategies for carriers in auction-based collaborations," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 38(1), pages 3-23, January.
    22. Gerardo Berbeglia & Jean-François Cordeau & Irina Gribkovskaia & Gilbert Laporte, 2007. "Static pickup and delivery problems: a classification scheme and survey," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 15(1), pages 1-31, July.
    23. S Salhi & G Nagy, 1999. "A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 50(10), pages 1034-1042, October.
    24. Berger, Susanne & Bierwirth, Christian, 2010. "Solutions to the request reassignment problem in collaborative carrier networks," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 46(5), pages 627-638, September.
    25. Nagy, Gabor & Salhi, Said, 2005. "Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries," European Journal of Operational Research, Elsevier, vol. 162(1), pages 126-141, April.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Nuraiman, Dian & Ozlen, Melih & Hearne, John, 2020. "A spatial decomposition based math-heuristic approach to the asset protection problem," Operations Research Perspectives, Elsevier, vol. 7(C).
    2. Zahra Sadat Hasanpour Jesri & Kourosh Eshghi & Majid Rafiee & Tom Van Woensel, 2022. "The Multi-Depot Traveling Purchaser Problem with Shared Resources," Sustainability, MDPI, vol. 14(16), pages 1-26, August.
    3. Shejun Deng & Yingying Yuan & Yong Wang & Haizhong Wang & Charles Koll, 2020. "Collaborative multicenter logistics delivery network optimization with resource sharing," PLOS ONE, Public Library of Science, vol. 15(11), pages 1-31, November.
    4. Soriano, Adria & Gansterer, Margaretha & Hartl, Richard F., 2023. "The multi-depot vehicle routing problem with profit fairness," International Journal of Production Economics, Elsevier, vol. 255(C).
    5. Mancini, Simona & Gansterer, Margaretha & Hartl, Richard F., 2021. "The collaborative consistent vehicle routing problem with workload balance," European Journal of Operational Research, Elsevier, vol. 293(3), pages 955-965.
    6. Soriano, Adria & Gansterer, Margaretha & Hartl, Richard F., 2022. "Reprint of: The multi-depot vehicle routing problem with profit fairness," International Journal of Production Economics, Elsevier, vol. 250(C).
    7. Immanuel Bomze & Karl F. Dörner & Richard F. Hartl & Ulrike Leopold-Wildburger & Georg Pflug & Marion Rauner & Christian Stummer & Gernot Tragler & Tina Wakolbinger, 2018. "Emerging and innovative OR applications: a special issue in honor of Walter J. Gutjahr," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 26(2), pages 259-263, June.
    8. Margaretha Gansterer & Richard F. Hartl & Sarah Wieser, 2021. "Assignment constraints in shared transportation services," Annals of Operations Research, Springer, vol. 305(1), pages 513-539, October.
    9. Parvez Farazi, Nahid & Zou, Bo & Tulabandhula, Theja, 2022. "Dynamic On-Demand Crowdshipping Using Constrained and Heuristics-Embedded Double Dueling Deep Q-Network," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 166(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Gansterer, Margaretha & Hartl, Richard F. & Savelsbergh, Martin, 2020. "The value of information in auction-based carrier collaborations," International Journal of Production Economics, Elsevier, vol. 221(C).
    2. Gansterer, Margaretha & Hartl, Richard F. & Sörensen, Kenneth, 2020. "Pushing frontiers in auction-based transport collaborations," Omega, Elsevier, vol. 94(C).
    3. Capelle, Thomas & Cortés, Cristián E. & Gendreau, Michel & Rey, Pablo A. & Rousseau, Louis-Martin, 2019. "A column generation approach for location-routing problems with pickup and delivery," European Journal of Operational Research, Elsevier, vol. 272(1), pages 121-131.
    4. Luciano Costa & Claudio Contardo & Guy Desaulniers, 2019. "Exact Branch-Price-and-Cut Algorithms for Vehicle Routing," Transportation Science, INFORMS, vol. 53(4), pages 946-985, July.
    5. Margaretha Gansterer & Richard F. Hartl & Sarah Wieser, 2021. "Assignment constraints in shared transportation services," Annals of Operations Research, Springer, vol. 305(1), pages 513-539, October.
    6. Gansterer, Margaretha & Hartl, Richard F., 2018. "Collaborative vehicle routing: A survey," European Journal of Operational Research, Elsevier, vol. 268(1), pages 1-12.
    7. Ali Mehsin Alyasiry & Michael Forbes & Michael Bulmer, 2019. "An Exact Algorithm for the Pickup and Delivery Problem with Time Windows and Last-in-First-out Loading," Transportation Science, INFORMS, vol. 53(6), pages 1695-1705, November.
    8. Cherkesly, Marilène & Gschwind, Timo, 2022. "The pickup and delivery problem with time windows, multiple stacks, and handling operations," European Journal of Operational Research, Elsevier, vol. 301(2), pages 647-666.
    9. Albert H. Schrotenboer & Evrim Ursavas & Iris F. A. Vis, 2019. "A Branch-and-Price-and-Cut Algorithm for Resource-Constrained Pickup and Delivery Problems," Transportation Science, INFORMS, vol. 53(4), pages 1001-1022, July.
    10. Paul Buijs & Jose Alejandro Lopez Alvarez & Marjolein Veenstra & Kees Jan Roodbergen, 2016. "Improved Collaborative Transport Planning at Dutch Logistics Service Provider Fritom," Interfaces, INFORMS, vol. 46(2), pages 119-132, April.
    11. Regnier-Coudert, Olivier & McCall, John & Ayodele, Mayowa & Anderson, Steven, 2016. "Truck and trailer scheduling in a real world, dynamic and heterogeneous context," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 93(C), pages 389-408.
    12. Sophie N. Parragh & Jorge Pinho de Sousa & Bernardo Almada-Lobo, 2015. "The Dial-a-Ride Problem with Split Requests and Profits," Transportation Science, INFORMS, vol. 49(2), pages 311-334, May.
    13. Hammami, Farouk & Rekik, Monia & Coelho, Leandro C., 2019. "Exact and heuristic solution approaches for the bid construction problem in transportation procurement auctions with a heterogeneous fleet," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 127(C), pages 150-177.
    14. Fatih Kocatürk & G. Yazgı Tütüncü & Said Salhi, 2021. "The multi-depot heterogeneous VRP with backhauls: formulation and a hybrid VNS with GRAMPS meta-heuristic approach," Annals of Operations Research, Springer, vol. 307(1), pages 277-302, December.
    15. Phuong Khanh Nguyen & Teodor Gabriel Crainic & Michel Toulouse, 2017. "Multi-trip pickup and delivery problem with time windows and synchronization," Annals of Operations Research, Springer, vol. 253(2), pages 899-934, June.
    16. Qiu, Xiaoqiu & Feuerriegel, Stefan & Neumann, Dirk, 2017. "Making the most of fleets: A profit-maximizing multi-vehicle pickup and delivery selection problem," European Journal of Operational Research, Elsevier, vol. 259(1), pages 155-168.
    17. Tzur, Michal & Drezner, Ehud, 2011. "A lookahead partitioning heuristic for a new assignment and scheduling problem in a distribution system," European Journal of Operational Research, Elsevier, vol. 215(2), pages 325-336, December.
    18. Liu, Ran & Xie, Xiaolan & Augusto, Vincent & Rodriguez, Carlos, 2013. "Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care," European Journal of Operational Research, Elsevier, vol. 230(3), pages 475-486.
    19. Iassinovskaia, Galina & Limbourg, Sabine & Riane, Fouad, 2017. "The inventory-routing problem of returnable transport items with time windows and simultaneous pickup and delivery in closed-loop supply chains," International Journal of Production Economics, Elsevier, vol. 183(PB), pages 570-582.
    20. Yuan Qu & Jonathan F. Bard, 2015. "A Branch-and-Price-and-Cut Algorithm for Heterogeneous Pickup and Delivery Problems with Configurable Vehicle Capacity," Transportation Science, INFORMS, vol. 49(2), pages 254-270, May.

    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:spr:cejnor:v:26:y:2018:i:2:d:10.1007_s10100-017-0503-x. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.