IDEAS home Printed from https://ideas.repec.org/a/inm/orinte/v52y2022i2p173-188.html
   My bibliography  Save this article

C.H. Robinson Uses Heuristics to Solve Rich Vehicle Routing Problems

Author

Listed:
  • Ehsan Khodabandeh

    (Coupa Software, Chicago, Illinois 60654)

  • Lawrence V. Snyder

    (Industrial and Systems Engineering, Lehigh University, Bethlehem, Pennsylvania 18015)

  • John Dennis

    (C.H. Robinson, Eden Prairie, Minnesota 55347)

  • Joshua Hammond

    (C.H. Robinson, Eden Prairie, Minnesota 55347)

  • Cody Wanless

    (C.H. Robinson, Eden Prairie, Minnesota 55347)

Abstract

We consider a broad family of vehicle routing problem variants with many complex and practical constraints, known as rich vehicle routing problems, which are faced on a daily basis by C.H. Robinson (CHR). Because CHR has many customers, each with distinct requirements, various routing problems with different objectives and constraints must be solved. We propose a novel framework for solving rich vehicle routing problems, which we demonstrate is effective in solving a variety of different problems. This framework, along with a simple user interface, has been wrapped into a new module and integrated into the company’s transportation planning and execution technology platform. Since its implementation, this new module has outperformed the previously used third-party technologies at CHR, significantly reduced setup times, and improved users’ productivity as well as customer outcomes.

Suggested Citation

  • Ehsan Khodabandeh & Lawrence V. Snyder & John Dennis & Joshua Hammond & Cody Wanless, 2022. "C.H. Robinson Uses Heuristics to Solve Rich Vehicle Routing Problems," Interfaces, INFORMS, vol. 52(2), pages 173-188, March.
    • Handle: RePEc:inm:orinte:v:52:y:2022:i:2:p:173-188
    DOI: 10.1287/inte.2021.1090
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/inte.2021.1090
    Download Restriction: no
    File URL: https://libkey.io/10.1287/inte.2021.1090?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. Pedro Amorim & Sophie Parragh & Fabrício Sperandio & Bernardo Almada-Lobo, 2014. "A rich vehicle routing problem dealing with perishable food: a case study," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 22(2), pages 489-508, July.
    2. Vidal, Thibaut & Crainic, Teodor Gabriel & Gendreau, Michel & Prins, Christian, 2014. "A unified solution framework for multi-attribute vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 234(3), pages 658-673.
    3. Roberto Baldacci & Aristide Mingozzi & Roberto Roberti, 2011. "New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem," Operations Research, INFORMS, vol. 59(5), pages 1269-1283, October.
    4. Timothy A. Carnes & Shane G. Henderson & David B. Shmoys & Mahvareh Ahghari & Russell D. MacDonald, 2013. "Mathematical Programming Guides Air-Ambulance Routing at Ornge," Interfaces, INFORMS, vol. 43(3), pages 232-239, May-June.
    5. Ted Gifford & Tracy Opicka & Ashesh Sinha & Daniel Vanden Brink & Andy Gifford & Robert Randall, 2018. "Dispatch Optimization in Bulk Tanker Transport Operations," Interfaces, INFORMS, vol. 48(5), pages 403-421, October.
    6. M. L. Balinski & R. E. Quandt, 1964. "On an Integer Program for a Delivery Problem," Operations Research, INFORMS, vol. 12(2), pages 300-304, April.
    7. Yetkin Ileri & Mokhtar Bazaraa & Ted Gifford & George Nemhauser & Joel Sokol & Erick Wikum, 2006. "An optimization approach for planning daily drayage operations," 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. 14(2), pages 141-156, June.
    8. Vidal, Thibaut & Crainic, Teodor Gabriel & Gendreau, Michel & Prins, Christian, 2013. "Heuristics for multi-attribute vehicle routing problems: A survey and synthesis," European Journal of Operational Research, Elsevier, vol. 231(1), pages 1-21.
    9. 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.
    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. Yinhu Wang & Ye Chen & Ilya O. Ryzhov & Xiaoyue Cathy Liu & Nikola Marković, 2024. "Improving Snowplowing Operations in Utah Through Optimization and Visualization," Interfaces, INFORMS, vol. 54(6), pages 471-486, November.

    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. Ana Maria Anaya-Arenas & Thomas Chabot & Jacques Renaud & Angel Ruiz, 2016. "Biomedical sample transportation in the province of Quebec: a case study," International Journal of Production Research, Taylor & Francis Journals, vol. 54(2), pages 602-615, January.
    2. 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.
    3. Thibaut Vidal & Rafael Martinelli & Tuan Anh Pham & Minh Hoàng Hà, 2021. "Arc Routing with Time-Dependent Travel Times and Paths," Transportation Science, INFORMS, vol. 55(3), pages 706-724, May.
    4. Puca Huachi Vaz Penna & Anand Subramanian & Luiz Satoru Ochi & Thibaut Vidal & Christian Prins, 2019. "A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet," Annals of Operations Research, Springer, vol. 273(1), pages 5-74, February.
    5. Niklas Tuma & Manuel Ostermeier & Alexander Hübner, 2024. "Optimal Transportation Planning for a Do-It-Yourself Retailer with a Zone-Based Tariff," Interfaces, INFORMS, vol. 54(4), pages 312-328, July.
    6. Bulhões, Teobaldo & Hà, Minh Hoàng & Martinelli, Rafael & Vidal, Thibaut, 2018. "The vehicle routing problem with service level constraints," European Journal of Operational Research, Elsevier, vol. 265(2), pages 544-558.
    7. Homsi, Gabriel & Martinelli, Rafael & Vidal, Thibaut & Fagerholt, Kjetil, 2020. "Industrial and tramp ship routing problems: Closing the gap for real-scale instances," European Journal of Operational Research, Elsevier, vol. 283(3), pages 972-990.
    8. John E. Fontecha & Oscar O. Guaje & Daniel Duque & Raha Akhavan-Tabatabaei & Juan P. Rodríguez & Andrés L. Medaglia, 2020. "Combined maintenance and routing optimization for large-scale sewage cleaning," Annals of Operations Research, Springer, vol. 286(1), pages 441-474, March.
    9. Christian Tilk & Asvin Goel, 2019. "Bidirectional labeling for solving vehicle routing and truck driver scheduling problems," Working Papers 1914, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    10. Alan Lee & Martin Savelsbergh, 2017. "An extended demand responsive connector," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 6(1), pages 25-50, March.
    11. Timo Gschwind & Stefan Irnich, 2015. "Effective Handling of Dynamic Time Windows and Its Application to Solving the Dial-a-Ride Problem," Transportation Science, INFORMS, vol. 49(2), pages 335-354, May.
    12. Lahyani, Rahma & Khemakhem, Mahdi & Semet, Frédéric, 2015. "Rich vehicle routing problems: From a taxonomy to a definition," European Journal of Operational Research, Elsevier, vol. 241(1), pages 1-14.
    13. Vidal, Thibaut & Laporte, Gilbert & Matl, Piotr, 2020. "A concise guide to existing and emerging vehicle routing problem variants," European Journal of Operational Research, Elsevier, vol. 286(2), pages 401-416.
    14. Vidal, Thibaut & Crainic, Teodor Gabriel & Gendreau, Michel & Prins, Christian, 2014. "Implicit depot assignments and rotations in vehicle routing heuristics," European Journal of Operational Research, Elsevier, vol. 237(1), pages 15-28.
    15. Soriano, Adria & Vidal, Thibaut & Gansterer, Margaretha & Doerner, Karl, 2020. "The vehicle routing problem with arrival time diversification on a multigraph," European Journal of Operational Research, Elsevier, vol. 286(2), pages 564-575.
    16. Ho, Sin C. & Szeto, W.Y. & Kuo, Yong-Hong & Leung, Janny M.Y. & Petering, Matthew & Tou, Terence W.H., 2018. "A survey of dial-a-ride problems: Literature review and recent developments," Transportation Research Part B: Methodological, Elsevier, vol. 111(C), pages 395-421.
    17. Tilk, Christian & Goel, Asvin, 2020. "Bidirectional labeling for solving vehicle routing and truck driver scheduling problems," European Journal of Operational Research, Elsevier, vol. 283(1), pages 108-124.
    18. Coelho, V.N. & Grasas, A. & Ramalhinho, H. & Coelho, I.M. & Souza, M.J.F. & Cruz, R.C., 2016. "An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints," European Journal of Operational Research, Elsevier, vol. 250(2), pages 367-376.
    19. Kramer, Raphael & Cordeau, Jean-François & Iori, Manuel, 2019. "Rich vehicle routing with auxiliary depots and anticipated deliveries: An application to pharmaceutical distribution," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 129(C), pages 162-174.
    20. Artur Alves Pessoa & Michael Poss & Ruslan Sadykov & François Vanderbeck, 2021. "Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty," Operations Research, INFORMS, vol. 69(3), pages 739-754, May.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:orinte:v:52:y:2022:i:2:p:173-188. 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.