IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v50y2016i2p461-472.html
   My bibliography  Save this article

Multicommodity vs. Single-Commodity Routing

Author

Listed:
  • Claudia Archetti

    (Department of Economics and Management, University of Brescia, 25122 Brescia, Italy)

  • Ann Melissa Campbell

    (Department of Management Sciences, University of Iowa, Iowa City, Iowa 52242)

  • M. Grazia Speranza

    (Department of Economics and Management, University of Brescia, 25122 Brescia, Italy)

Abstract

In this paper we study a vehicle routing problem where customers request multiple commodities. We study the impact on transportation cost from using vehicles dedicated to a single commodity compared with using flexible vehicles capable of carrying any set of commodities. With vehicles that carry multiple commodities, we consider when the delivery to a customer can be made by more than one vehicle. If multiple vehicles can be used, we examine when deliveries of individual commodities may be split and when they may not be split. The latter problem has not previously been studied, and we present a mathematical programming model for it. We use worst case and computational analysis to compare these different models.

Suggested Citation

  • Claudia Archetti & Ann Melissa Campbell & M. Grazia Speranza, 2016. "Multicommodity vs. Single-Commodity Routing," Transportation Science, INFORMS, vol. 50(2), pages 461-472, May.
    • Handle: RePEc:inm:ortrsc:v:50:y:2016:i:2:p:461-472
    DOI: 10.1287/trsc.2014.0528
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.2014.0528
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.2014.0528?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
    ---><---

    References listed on IDEAS

    as
    1. Cruijssen, F. & Salomon, M., 2004. "Empirical Study : Order Sharing Between Transportation Companies may Result in Cost Reductions Between 5 to 15 Percent," Discussion Paper 2004-80, Tilburg University, Center for Economic Research.
    2. M A Krajewska & H Kopfer & G Laporte & S Ropke & G Zaccour, 2008. "Horizontal cooperation among freight carriers: request allocation and profit sharing," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(11), pages 1483-1491, November.
    3. Archetti, Claudia & Bianchessi, Nicola & Speranza, M. Grazia, 2014. "Branch-and-cut algorithms for the split delivery vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 238(3), pages 685-698.
    4. Cruijssen, F. & Salomon, M., 2004. "Empirical Study : Order Sharing Between Transportation Companies may Result in Cost Reductions Between 5 to 15 Percent," Other publications TiSEM 308c6567-826b-4471-9105-9, Tilburg University, School of Economics and Management.
    5. Cruijssen, Frans & Cools, Martine & Dullaert, Wout, 2007. "Horizontal cooperation in logistics: Opportunities and impediments," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 43(2), pages 129-142, March.
    6. Claudia Archetti & M. Grazia Speranza & Martin W. P. Savelsbergh, 2008. "An Optimization-Based Heuristic for the Split Delivery Vehicle Routing Problem," Transportation Science, INFORMS, vol. 42(1), pages 22-31, February.
    7. Claudia Archetti & Martin W. P. Savelsbergh & M. Grazia Speranza, 2006. "Worst-Case Analysis for Split Delivery Vehicle Routing Problems," Transportation Science, INFORMS, vol. 40(2), pages 226-234, May.
    8. Moshe Dror & Pierre Trudeau, 1989. "Savings by Split Delivery Routing," Transportation Science, INFORMS, vol. 23(2), pages 141-145, May.
    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. Timo Gschwind & Nicola Bianchessi & Stefan Irnich, 2018. "Stabilized Branch-Price-and-Cut for the Commodity-constrained Split Delivery Vehicle Routing Problem," Working Papers 1817, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    2. Christian Tilk & Katharina Olkis & Stefan Irnich, 2020. "The Last-mile Vehicle Routing Problem with Delivery Options," Working Papers 2017, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    3. Ostermeier, Manuel & Henke, Tino & Hübner, Alexander & Wäscher, Gerhard, 2021. "Multi-compartment vehicle routing problems: State-of-the-art, modeling framework and future directions," European Journal of Operational Research, Elsevier, vol. 292(3), pages 799-817.
    4. 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.
    5. Ostermeier, Manuel & Hübner, Alexander, 2018. "Vehicle selection for a multi-compartment vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 269(2), pages 682-694.
    6. Gschwind, Timo & Bianchessi, Nicola & Irnich, Stefan, 2019. "Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 278(1), pages 91-104.
    7. Heßler, Katrin, 2021. "Exact algorithms for the multi-compartment vehicle routing problem with flexible compartment sizes," European Journal of Operational Research, Elsevier, vol. 294(1), pages 188-205.
    8. Schönberger, Jörn, 2017. "Implicit time windows and multi-commodity mixed-fleet vehicle routing," Discussion Papers 1/2017, Technische Universität Dresden, "Friedrich List" Faculty of Transport and Traffic Sciences, Institute of Transport and Economics.
    9. Tino Henke & Grazia Speranza & Gerhard Wäscher, 2017. "A Branch-and-Cut Algorithm for the Multi Compartment vehicle Routing Problem with Flexbile Compartment Sizes," FEMM Working Papers 170004, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
    10. Katrin Heßler, 2020. "Exact Algorithms for the Multi-Compartment Vehicle Routing Problem with Flexible Compartment Sizes," Working Papers 2007, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.

    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. Dan Liu & Zhenghong Deng & Qipeng Sun & Yong Wang & Yinhai Wang, 2019. "Design and Freight Corridor-Fleet Size Choice in Collaborative Intermodal Transportation Network Considering Economies of Scale," Sustainability, MDPI, vol. 11(4), pages 1-19, February.
    2. Jeffrey W. Ohlmann & Michael J. Fry & Barrett W. Thomas, 2008. "Route Design for Lean Production Systems," Transportation Science, INFORMS, vol. 42(3), pages 352-370, August.
    3. Ankersmit, Steven & Rezaei, Jafar & Tavasszy, Lori, 2014. "The potential of horizontal collaboration in airport ground freight services," Journal of Air Transport Management, Elsevier, vol. 40(C), pages 169-181.
    4. Nicola Bianchessi & Stefan Irnich, 2016. "Branch-and-Cut for the Split Delivery Vehicle Routing Problem with Time Windows," Working Papers 1620, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    5. Jianli Shi & Jin Zhang & Kun Wang & Xin Fang, 2018. "Particle Swarm Optimization for Split Delivery Vehicle Routing Problem," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 35(02), pages 1-42, April.
    6. Lotte Verdonck & Katrien Ramaekers & Benoît Depaire & An Caris & Gerrit K. Janssens, 2019. "Analysing the Effect of Partner Characteristics on the Performance of Horizontal Carrier Collaborations," Networks and Spatial Economics, Springer, vol. 19(2), pages 583-609, June.
    7. DEFRYN, Christof & SÖRENSEN, Kenneth & CORNELISSENS, Trijntje, 2015. "The selective vehicle routing problem in a collaborative environment," Working Papers 2015006, University of Antwerp, Faculty of Business and Economics.
    8. Pedro Munari & Martin Savelsbergh, 2020. "A Column Generation-Based Heuristic for the Split Delivery Vehicle Routing Problem with Time Windows," SN Operations Research Forum, Springer, vol. 1(4), pages 1-24, December.
    9. Berbotto, Leonardo & García, Sergio & Nogales, Francisco J., 2011. "A vehicle routing model with split delivery and stop nodes," DES - Working Papers. Statistics and Econometrics. WS ws110906, Universidad Carlos III de Madrid. Departamento de Estadística.
    10. DEFRYN, Christof & VANOVERMEIRE, Christine & SÖRENSEN, Kenneth & VAN BREEDAM, Alex & VANNIEUWENHUYSE, Bart & VERSTREPEN, Sven, 2014. "Gain sharing in horizontal logistic collaboration. A case study in the fresh fruit and vegetables sector," Working Papers 2014004, University of Antwerp, Faculty of Business and Economics.
    11. Guy Desaulniers, 2010. "Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows," Operations Research, INFORMS, vol. 58(1), pages 179-192, February.
    12. Xiaozhou Xu & Shenle Pan & Eric Ballot, 2012. "Allocation of Transportation Cost & CO2 Emission in Pooled Supply Chains Using Cooperative Game Theory," Post-Print hal-00733491, HAL.
    13. Leonardo Berbotto & Sergio García & Francisco Nogales, 2014. "A Randomized Granular Tabu Search heuristic for the split delivery vehicle routing problem," Annals of Operations Research, Springer, vol. 222(1), pages 153-173, November.
    14. Rui Xu & Yumiao Huang & Wei Xiao, 2023. "A Two-Level Variable Neighborhood Descent for a Split Delivery Clustered Vehicle Routing Problem with Soft Cluster Conflicts and Customer-Related Costs," Sustainability, MDPI, vol. 15(9), pages 1-22, May.
    15. Han, Anthony Fu-Wha & Chu, Yu-Ching, 2016. "A multi-start heuristic approach for the split-delivery vehicle routing problem with minimum delivery amounts," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 88(C), pages 11-31.
    16. Thomas Hacardiaux & Jean-Sébastien Tancrez, 2022. "Assessing the benefits of horizontal cooperation for the various stages of the supply chain," Operational Research, Springer, vol. 22(4), pages 3901-3924, September.
    17. Defryn, Christof & Sörensen, Kenneth & Cornelissens, Trijntje, 2016. "The selective vehicle routing problem in a collaborative environment," European Journal of Operational Research, Elsevier, vol. 250(2), pages 400-411.
    18. Gizem Ozbaygin & Oya Karasan & Hande Yaman, 2018. "New exact solution approaches for the split delivery vehicle routing problem," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 6(1), pages 85-115, March.
    19. José-Manuel Belenguer & Enrique Benavent & Nacima Labadi & Christian Prins & Mohamed Reghioui, 2010. "Split-Delivery Capacitated Arc-Routing Problem: Lower Bound and Metaheuristic," Transportation Science, INFORMS, vol. 44(2), pages 206-220, May.
    20. Martijn Mes & Matthieu Heijden & Peter Schuur, 2013. "Interaction between intelligent agent strategies for real-time transportation planning," 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. 21(2), pages 337-358, March.

    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:inm:ortrsc:v:50:y:2016:i:2:p:461-472. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.