IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v136y2020ics136655451930081x.html
   My bibliography  Save this article

A robust optimization approach for the vehicle routing problem with selective backhauls

Author

Listed:
  • Santos, Maria João
  • Curcio, Eduardo
  • Mulati, Mauro Henrique
  • Amorim, Pedro
  • Miyazawa, Flávio Keidi

Abstract

The Vehicle Routing Problem with Selective Backhauls (VRPSB) aims to minimize the total routing costs minus the total revenue collected at backhaul customers. We explore a VRPSB under uncertain revenues. A deterministic VRPSB is formulated as a mixed-integer programming problem and two robust counterparts are derived. A novel method to estimate the probabilistic bounds of constraint violation is designed. A robust metaheuristic is developed, requiring little time to obtain feasible solutions with average gap of 1.40%. The robust approach studied demonstrates high potential to tackle the problem, requiring similar computing effort and maintaining the same tractability as the deterministic modeling.

Suggested Citation

  • Santos, Maria João & Curcio, Eduardo & Mulati, Mauro Henrique & Amorim, Pedro & Miyazawa, Flávio Keidi, 2020. "A robust optimization approach for the vehicle routing problem with selective backhauls," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 136(C).
  • Handle: RePEc:eee:transe:v:136:y:2020:i:c:s136655451930081x
    DOI: 10.1016/j.tre.2020.101888
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S136655451930081X
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.tre.2020.101888?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. David Pisinger & Stefan Ropke, 2010. "Large Neighborhood Search," International Series in Operations Research & Management Science, in: Michel Gendreau & Jean-Yves Potvin (ed.), Handbook of Metaheuristics, chapter 0, pages 399-419, Springer.
    2. R Baldacci & E Bartolini & G Laporte, 2010. "Some applications of the generalized vehicle routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(7), pages 1072-1077, July.
    3. Stefan Ropke & David Pisinger, 2006. "An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows," Transportation Science, INFORMS, vol. 40(4), pages 455-472, November.
    4. Candace Arai Yano & Thomas J. Chan & Lori Kaplan Richter & Theodore Cutler & Katta G. Murty & David McGettigan, 1987. "Vehicle Routing at Quality Stores," Interfaces, INFORMS, vol. 17(2), pages 52-63, April.
    5. Dimitris Bertsimas & Melvyn Sim, 2004. "The Price of Robustness," Operations Research, INFORMS, vol. 52(1), pages 35-53, February.
    6. Goetschalckx, Marc & Jacobs-Blecha, Charlotte, 1989. "The vehicle routing problem with backhauls," European Journal of Operational Research, Elsevier, vol. 42(1), pages 39-51, September.
    7. Chrysanthos E. Gounaris & Wolfram Wiesemann & Christodoulos A. Floudas, 2013. "The Robust Capacitated Vehicle Routing Problem Under Demand Uncertainty," Operations Research, INFORMS, vol. 61(3), pages 677-693, June.
    8. Kazemi Zanjani, Masoumeh & Ait-Kadi, Daoud & Nourelfath, Mustapha, 2010. "Robust production planning in a manufacturing environment with random yield: A case in sawmill production planning," European Journal of Operational Research, Elsevier, vol. 201(3), pages 882-891, March.
    9. J Privé & J Renaud & F Boctor & G Laporte, 2006. "Solving a vehicle-routing problem arising in soft-drink distribution," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(9), pages 1045-1052, September.
    10. Pamela Alvarez & Jorge Vera, 2014. "Application of Robust Optimization to the Sawmill Planning Problem," Annals of Operations Research, Springer, vol. 219(1), pages 457-475, August.
    11. Gabrel, Virginie & Murat, Cécile & Thiele, Aurélie, 2014. "Recent advances in robust optimization: An overview," European Journal of Operational Research, Elsevier, vol. 235(3), pages 471-483.
    12. G.Y. Tütüncü & B.M. Carreto Baker, 2009. "A visual interactive approach to the classical and mixed vehicle routing problems with backhauls," Post-Print hal-00581628, HAL.
    13. Paolo Toth & Daniele Vigo, 1997. "An Exact Algorithm for the Vehicle Routing Problem with Backhauls," Transportation Science, INFORMS, vol. 31(4), pages 372-385, November.
    14. Marius M. Solomon, 1987. "Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints," Operations Research, INFORMS, vol. 35(2), pages 254-265, April.
    15. Chardy, Matthieu & Klopfenstein, Olivier, 2012. "Handling uncertainties in vehicle routing problems through data preprocessing," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(3), pages 667-683.
    16. Dominguez, Oscar & Guimarans, Daniel & Juan, Angel A. & de la Nuez, Ignacio, 2016. "A Biased-Randomised Large Neighbourhood Search for the two-dimensional Vehicle Routing Problem with Backhauls," European Journal of Operational Research, Elsevier, vol. 255(2), pages 442-462.
    17. Allahviranloo, Mahdieh & Chow, Joseph Y.J. & Recker, Will W., 2014. "Selective vehicle routing problems under uncertainty without recourse," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 62(C), pages 68-88.
    18. James E. Marengo & David L. Farnsworth & Lucas Stefanic, 2017. "A Geometric Derivation of the Irwin-Hall Distribution," International Journal of Mathematics and Mathematical Sciences, Hindawi, vol. 2017, pages 1-6, September.
    19. Li, Yuan & Chen, Haoxun & Prins, Christian, 2016. "Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests," European Journal of Operational Research, Elsevier, vol. 252(1), pages 27-38.
    20. Dayarian, Iman & Crainic, Teodor Gabriel & Gendreau, Michel & Rei, Walter, 2016. "An adaptive large-neighborhood search heuristic for a multi-period vehicle routing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 95(C), pages 95-123.
    21. Seong-Cheol Kang & Theodora Brisimi & Ioannis Paschalidis, 2015. "Distribution-dependent robust linear optimization with applications to inventory control," Annals of Operations Research, Springer, vol. 231(1), pages 229-263, August.
    22. G. Gutiérrez-Jarpa & V. Marianov & C. Obreque, 2009. "A single vehicle routing problem with fixed delivery and optional collections," IISE Transactions, Taylor & Francis Journals, vol. 41(12), pages 1067-1079.
    23. Gorissen, Bram L. & Yanıkoğlu, İhsan & den Hertog, Dick, 2015. "A practical guide to robust optimization," Omega, Elsevier, vol. 53(C), pages 124-137.
    24. Patrick Hirsch, 2011. "Minimizing Empty Truck Loads in Round Timber Transport with Tabu Search Strategies," International Journal of Information Systems and Supply Chain Management (IJISSCM), IGI Global, vol. 4(2), pages 15-41, April.
    25. John M. Mulvey & Robert J. Vanderbei & Stavros A. Zenios, 1995. "Robust Optimization of Large-Scale Systems," Operations Research, INFORMS, vol. 43(2), pages 264-281, April.
    26. YazgI Tütüncü, G. & Carreto, Carlos A.C. & Baker, Barrie M., 2009. "A visual interactive approach to classical and mixed vehicle routing problems with backhauls," Omega, Elsevier, vol. 37(1), pages 138-154, February.
    27. Renaud Masson & Fabien Lehuédé & Olivier Péton, 2013. "An Adaptive Large Neighborhood Search for the Pickup and Delivery Problem with Transfers," Transportation Science, INFORMS, vol. 47(3), pages 344-355, August.
    28. Fliedner, Thomas & Liesiö, Juuso, 2016. "Adjustable robustness for multi-attribute project portfolio selection," European Journal of Operational Research, Elsevier, vol. 252(3), pages 931-946.
    29. Baldacci, Roberto & Mingozzi, Aristide & Roberti, Roberto, 2012. "Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints," European Journal of Operational Research, Elsevier, vol. 218(1), pages 1-6.
    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. Guo, Jiaqi & Long, Jiancheng & Xu, Xiaoming & Yu, Miao & Yuan, Kai, 2022. "The vehicle routing problem of intercity ride-sharing between two cities," Transportation Research Part B: Methodological, Elsevier, vol. 158(C), pages 113-139.
    2. Yu, Vincent F. & Anh, Pham Tuan & Baldacci, Roberto, 2023. "A robust optimization approach for the vehicle routing problem with cross-docking under demand uncertainty," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 173(C).
    3. Li, Ming & Shao, Saijun & Li, Yang & Zhang, Hua & Zhang, Nianwu & He, Yandong, 2022. "A Physical Internet (PI) based inland container transportation problem with selective non-containerized shipping requests," International Journal of Production Economics, Elsevier, vol. 245(C).
    4. Santos, Maria João & Curcio, Eduardo & Amorim, Pedro & Carvalho, Margarida & Marques, Alexandra, 2021. "A bilevel approach for the collaborative transportation planning problem," International Journal of Production Economics, Elsevier, vol. 233(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. Maria João Santos & Pedro Amorim & Alexandra Marques & Ana Carvalho & Ana Póvoa, 2020. "The vehicle routing problem with backhauls towards a sustainability perspective: a review," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 28(2), pages 358-401, July.
    2. Marques, Alexandra & Soares, Ricardo & Santos, Maria João & Amorim, Pedro, 2020. "Integrated planning of inbound and outbound logistics with a Rich Vehicle Routing Problem with backhauls," Omega, Elsevier, vol. 92(C).
    3. Frey, Christian M.M. & Jungwirth, Alexander & Frey, Markus & Kolisch, Rainer, 2023. "The vehicle routing problem with time windows and flexible delivery locations," European Journal of Operational Research, Elsevier, vol. 308(3), pages 1142-1159.
    4. Yu, Vincent F. & Anh, Pham Tuan & Baldacci, Roberto, 2023. "A robust optimization approach for the vehicle routing problem with cross-docking under demand uncertainty," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 173(C).
    5. 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.
    6. 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.
    7. Turkeš, Renata & Sörensen, Kenneth & Hvattum, Lars Magnus, 2021. "Meta-analysis of metaheuristics: Quantifying the effect of adaptiveness in adaptive large neighborhood search," European Journal of Operational Research, Elsevier, vol. 292(2), pages 423-442.
    8. Gutiérrez-Jarpa, Gabriel & Desaulniers, Guy & Laporte, Gilbert & Marianov, Vladimir, 2010. "A branch-and-price algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows," European Journal of Operational Research, Elsevier, vol. 206(2), pages 341-349, October.
    9. Antonio G. Martín & Manuel Díaz-Madroñero & Josefa Mula, 2020. "Master production schedule using robust optimization approaches in an automobile second-tier supplier," 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. 28(1), pages 143-166, March.
    10. Hatzenbühler, Jonas & Jenelius, Erik & Gidófalvi, Gyözö & Cats, Oded, 2023. "Modular vehicle routing for combined passenger and freight transport," Transportation Research Part A: Policy and Practice, Elsevier, vol. 173(C).
    11. Michael Drexl, 2018. "On the One-to-One Pickup-and-Delivery Problem with Time Windows and Trailers," Working Papers 1816, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    12. TURKEŠ, Renata & SÖRENSEN, Kenneth & HVATTUM, Lars Magnus & BARRENA, Eva & CHENTLI, Hayet & COELHO, Leandro & DAYARIAN, Iman & GRIMAULT, Axel & GULLHAVE, Anders & IRIS, Çagatay & KESKIN, Merve & KIEFE, 2019. "Meta-analysis of metaheuristics: Quantifying the effect of adaptiveness in adaptive large neighborhood search," Working Papers 2019002, University of Antwerp, Faculty of Business and Economics.
    13. Henriette Koch & Andreas Bortfeldt & Gerhard Wäscher, 2018. "A hybrid algorithm for the vehicle routing problem with backhauls, time windows and three-dimensional loading constraints," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(4), pages 1029-1075, October.
    14. Carvalho, Andréa Nunes & Oliveira, Fabricio & Scavarda, Luiz Felipe, 2016. "Tactical capacity planning in a real-world ETO industry case: A robust optimization approach," International Journal of Production Economics, Elsevier, vol. 180(C), pages 158-171.
    15. Mengshi Lu & Zuo‐Jun Max Shen, 2021. "A Review of Robust Operations Management under Model Uncertainty," Production and Operations Management, Production and Operations Management Society, vol. 30(6), pages 1927-1943, June.
    16. Yin, Jiateng & D’Ariano, Andrea & Wang, Yihui & Yang, Lixing & Tang, Tao, 2021. "Timetable coordination in a rail transit network with time-dependent passenger demand," European Journal of Operational Research, Elsevier, vol. 295(1), pages 183-202.
    17. Masmoudi, Mohamed Amine & Hosny, Manar & Braekers, Kris & Dammak, Abdelaziz, 2016. "Three effective metaheuristics to solve the multi-depot multi-trip heterogeneous dial-a-ride problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 96(C), pages 60-80.
    18. Randall, M. & Montgomery, J. & Lewis, A., 2022. "Robust temporal optimisation for a crop planning problem under climate change uncertainty," Operations Research Perspectives, Elsevier, vol. 9(C).
    19. Sarhadi, Hassan & Naoum-Sawaya, Joe & Verma, Manish, 2020. "A robust optimization approach to locating and stockpiling marine oil-spill response facilities," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 141(C).
    20. Shunichi Ohmori, 2021. "A Predictive Prescription Using Minimum Volume k -Nearest Neighbor Enclosing Ellipsoid and Robust Optimization," Mathematics, MDPI, vol. 9(2), pages 1-16, January.

    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:eee:transe:v:136:y:2020:i:c:s136655451930081x. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description .

    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.