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

The Vehicle Routing Problem with Stochastic Two-Dimensional Items

Author

Listed:
  • Jean-François Côté

    (Département d'opérations et systèmes de décision and Centre interuniversitaire de recherche sur les réseaux d’entreprise, la logistique et le transport, Université Laval, Québec G1V 0A6, Canada)

  • Michel Gendreau

    (Département de mathématiques et de génie industriel, École Polytechnique de Montréal, Montréal H3C 3A7, Canada; Centre interuniversitaire de recherche sur les réseaux d’entreprise, la logistique et le transport, Montréal H3C 3J7, Canada)

  • Jean-Yves Potvin

    (Centre interuniversitaire de recherche sur les réseaux d’entreprise, la logistique et le transport, Montréal H3C 3J7, Canada; Département d’informatique et de recherche opérationnelle, Université de Montréal, Montréal H3T 1J4, Canada)

Abstract

We consider a stochastic vehicle routing problem where a discrete probability distribution characterizes the two-dimensional size (height and width) as well as the weight of a subset of items to be delivered to customers. Although some item sizes and weights are not known with certainty when the routes are planned, they become known when it is time to load the vehicles, just before their departure. If it happens that not all items can be loaded in a vehicle, the items of one or more customers are put aside at a penalty or recourse cost. The objective is to minimize the sum of the routing and expected recourse costs. The problem is modeled as a two-stage stochastic program and solved with the integer L-shaped method. Some new inequalities and lower bounds are proposed. Computational results are reported on test instances specifically generated for this problem, as well as on classical instances for the deterministic case.

Suggested Citation

  • Jean-François Côté & Michel Gendreau & Jean-Yves Potvin, 2020. "The Vehicle Routing Problem with Stochastic Two-Dimensional Items," Transportation Science, INFORMS, vol. 54(2), pages 453-469, March.
  • Handle: RePEc:inm:ortrsc:v:54:y:2020:i:2:p:453-469
    DOI: 10.1287/trsc.2019.0904
    as

    Download full text from publisher

    File URL: https://doi.org/10.1287/trsc.2019.0904
    Download Restriction: no

    File URL: https://libkey.io/10.1287/trsc.2019.0904?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. Zachariadis, Emmanouil E. & Tarantilis, Christos D. & Kiranoudis, Christos T., 2009. "A Guided Tabu Search for the Vehicle Routing Problem with two-dimensional loading constraints," European Journal of Operational Research, Elsevier, vol. 195(3), pages 729-743, June.
    2. Manuel Iori & Silvano Martello, 2010. "Routing problems with loading constraints," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 18(1), pages 4-27, 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. Patrick Mills & Edward Tsang & John Ford, 2003. "Applying an Extended Guided Local Search to the Quadratic Assignment Problem," Annals of Operations Research, Springer, vol. 118(1), pages 121-135, February.
    5. Jean-François Côté & Michel Gendreau & Jean-Yves Potvin, 2014. "An Exact Algorithm for the Two-Dimensional Orthogonal Packing Problem with Unloading Constraints," Operations Research, INFORMS, vol. 62(5), pages 1126-1141, October.
    6. François Clautiaux & Cláudio Alves & José Valério de Carvalho, 2010. "A survey of dual-feasible and superadditive functions," Annals of Operations Research, Springer, vol. 179(1), pages 317-342, September.
    7. Leung, Stephen C.H. & Zhang, Zhenzhen & Zhang, Defu & Hua, Xian & Lim, Ming K., 2013. "A meta-heuristic algorithm for heterogeneous fleet vehicle routing problems with two-dimensional loading constraints," European Journal of Operational Research, Elsevier, vol. 225(2), pages 199-210.
    8. Clautiaux, Francois & Carlier, Jacques & Moukrim, Aziz, 2007. "A new exact method for the two-dimensional orthogonal packing problem," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1196-1211, December.
    9. Manuel Iori & Silvano Martello, 2010. "Rejoinder on: Routing problems with loading constraints," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 18(1), pages 41-42, July.
    10. Leung, Stephen C.H. & Zhang, Defu & Sim, Kwang Mong, 2011. "A two-stage intelligent search algorithm for the two-dimensional strip packing problem," European Journal of Operational Research, Elsevier, vol. 215(1), pages 57-69, November.
    11. Marco Antonio Boschetti & Lorenza Montaletti, 2010. "An Exact Algorithm for the Two-Dimensional Strip-Packing Problem," Operations Research, INFORMS, vol. 58(6), pages 1774-1791, December.
    12. C. Hjorring & J. Holt, 1999. "New optimality cuts for a single‐vehicle stochastic routing problem," Annals of Operations Research, Springer, vol. 86(0), pages 569-584, January.
    13. Jean-François Côté & Mauro Dell'Amico & Manuel Iori, 2014. "Combinatorial Benders' Cuts for the Strip Packing Problem," Operations Research, INFORMS, vol. 62(3), pages 643-661, June.
    14. R Alvarez-Valdes & F Parreño & J M Tamarit, 2005. "A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(4), pages 414-425, April.
    15. Sándor P. Fekete & Jörg Schepers & Jan C. van der Veen, 2007. "An Exact Algorithm for Higher-Dimensional Orthogonal Packing," Operations Research, INFORMS, vol. 55(3), pages 569-587, June.
    16. Dimitris J. Bertsimas & Patrick Jaillet & Amedeo R. Odoni, 1990. "A Priori Optimization," Operations Research, INFORMS, vol. 38(6), pages 1019-1033, December.
    17. Oscar Dominguez & Angel Juan & Barry Barrios & Javier Faulin & Alba Agustin, 2016. "Using biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleet," Annals of Operations Research, Springer, vol. 236(2), pages 383-404, January.
    18. Manuel Iori & Juan-José Salazar-González & Daniele Vigo, 2007. "An Exact Approach for the Vehicle Routing Problem with Two-Dimensional Loading Constraints," Transportation Science, INFORMS, vol. 41(2), pages 253-264, May.
    19. Gilbert Laporte & FranÇois V. Louveaux & Luc van Hamme, 2002. "An Integer L -Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands," Operations Research, INFORMS, vol. 50(3), pages 415-423, June.
    20. Oscar Dominguez & Angel A. Juan & Barry Barrios & Javier Faulin & Alba Agustin, 2016. "Using biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleet," Annals of Operations Research, Springer, vol. 236(2), pages 383-404, January.
    21. Silvano Martello & Michele Monaci & Daniele Vigo, 2003. "An Exact Approach to the Strip-Packing Problem," INFORMS Journal on Computing, INFORMS, vol. 15(3), pages 310-319, 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. Zhang, Xiangyi & Chen, Lu & Gendreau, Michel & Langevin, André, 2022. "A branch-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints," European Journal of Operational Research, Elsevier, vol. 302(1), pages 259-269.
    2. 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.
    3. Ji, Bin & Zhang, Zheng & Yu, Samson S. & Zhou, Saiqi & Wu, Guohua, 2023. "Modelling and heuristically solving many-to-many heterogeneous vehicle routing problem with cross-docking and two-dimensional loading constraints," European Journal of Operational Research, Elsevier, vol. 306(3), pages 1219-1235.
    4. Zheng Zhang & Bin Ji & Samson S. Yu, 2023. "An Adaptive Tabu Search Algorithm for Solving the Two-Dimensional Loading Constrained Vehicle Routing Problem with Stochastic Customers," Sustainability, MDPI, vol. 15(2), pages 1-23, January.
    5. Abbas Tarhini & Kassem Danach & Antoine Harfouche, 2022. "Swarm intelligence-based hyper-heuristic for the vehicle routing problem with prioritized customers," Annals of Operations Research, Springer, vol. 308(1), pages 549-570, January.

    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. Côté, J.F. & Guastaroba, G. & Speranza, M.G., 2017. "The value of integrating loading and routing," European Journal of Operational Research, Elsevier, vol. 257(1), pages 89-105.
    2. Jean-François Côté & Michel Gendreau & Jean-Yves Potvin, 2014. "An Exact Algorithm for the Two-Dimensional Orthogonal Packing Problem with Unloading Constraints," Operations Research, INFORMS, vol. 62(5), pages 1126-1141, October.
    3. Iori, Manuel & de Lima, Vinícius L. & Martello, Silvano & Miyazawa, Flávio K. & Monaci, Michele, 2021. "Exact solution techniques for two-dimensional cutting and packing," European Journal of Operational Research, Elsevier, vol. 289(2), pages 399-415.
    4. Zhang, Xiangyi & Chen, Lu & Gendreau, Michel & Langevin, André, 2022. "A branch-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints," European Journal of Operational Research, Elsevier, vol. 302(1), pages 259-269.
    5. Wei, Lijun & Zhang, Zhenzhen & Zhang, Defu & Leung, Stephen C.H., 2018. "A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints," European Journal of Operational Research, Elsevier, vol. 265(3), pages 843-859.
    6. Xiang Song & Dylan Jones & Nasrin Asgari & Tim Pigden, 2020. "Multi-objective vehicle routing and loading with time window constraints: a real-life application," Annals of Operations Research, Springer, vol. 291(1), pages 799-825, August.
    7. Alonso, M.T. & Martinez-Sykora, A. & Alvarez-Valdes, R. & Parreño, F., 2022. "The pallet-loading vehicle routing problem with stability constraints," European Journal of Operational Research, Elsevier, vol. 302(3), pages 860-873.
    8. Carlos A. Vega-Mejía & Jairo R. Montoya-Torres & Sardar M. N. Islam, 2019. "Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review," Annals of Operations Research, Springer, vol. 273(1), pages 311-375, February.
    9. Mahdi Alinaghian & Komail Zamanlou & Mohammad S. Sabbagh, 2017. "A bi-objective mathematical model for two-dimensional loading time-dependent vehicle routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(11), pages 1422-1441, November.
    10. Jean-François Côté & Mohamed Haouari & Manuel Iori, 2021. "Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem," INFORMS Journal on Computing, INFORMS, vol. 33(3), pages 963-978, July.
    11. Zhang, Zhenzhen & Wei, Lijun & Lim, Andrew, 2015. "An evolutionary local search for the capacitated vehicle routing problem minimizing fuel consumption under three-dimensional loading constraints," Transportation Research Part B: Methodological, Elsevier, vol. 82(C), pages 20-35.
    12. Ji, Bin & Zhang, Zheng & Yu, Samson S. & Zhou, Saiqi & Wu, Guohua, 2023. "Modelling and heuristically solving many-to-many heterogeneous vehicle routing problem with cross-docking and two-dimensional loading constraints," European Journal of Operational Research, Elsevier, vol. 306(3), pages 1219-1235.
    13. Manuel Ostermeier & Sara Martins & Pedro Amorim & Alexander Hübner, 2018. "Loading constraints for a multi-compartment vehicle routing problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(4), pages 997-1027, October.
    14. Bonet Filella, Guillem & Trivella, Alessio & Corman, Francesco, 2023. "Modeling soft unloading constraints in the multi-drop container loading problem," European Journal of Operational Research, Elsevier, vol. 308(1), pages 336-352.
    15. Schmid, Verena & Doerner, Karl F. & Laporte, Gilbert, 2013. "Rich routing problems arising in supply chain management," European Journal of Operational Research, Elsevier, vol. 224(3), pages 435-448.
    16. Oscar Dominguez & Angel A. Juan & Barry Barrios & Javier Faulin & Alba Agustin, 2016. "Using biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleet," Annals of Operations Research, Springer, vol. 236(2), pages 383-404, January.
    17. Stéphane Grandcolas & Cyril Pain-Barre, 2022. "A hybrid metaheuristic for the two-dimensional strip packing problem," Annals of Operations Research, Springer, vol. 309(1), pages 79-102, February.
    18. Emmanouil E. Zachariadis & Christos D. Tarantilis & Chris T. Kiranoudis, 2017. "Vehicle routing strategies for pick-up and delivery service under two dimensional loading constraints," Operational Research, Springer, vol. 17(1), pages 115-143, April.
    19. Selma Khebbache-Hadji & Christian Prins & Alice Yalaoui & Mohamed Reghioui, 2013. "Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows," 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 307-336, March.
    20. Oscar Dominguez & Angel Juan & Barry Barrios & Javier Faulin & Alba Agustin, 2016. "Using biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleet," Annals of Operations Research, Springer, vol. 236(2), pages 383-404, 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:inm:ortrsc:v:54:y:2020:i:2:p:453-469. 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.