IDEAS home Printed from https://ideas.repec.org/r/eee/transb/v100y2017icp115-137.html
   My bibliography  Save this item

A branch-and-price algorithm for the vehicle routing problem with roaming delivery locations

Citations

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


Cited by:

  1. 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.
  2. Claudio Gambella & Joe Naoum-Sawaya & Bissan Ghaddar, 2018. "The Vehicle Routing Problem with Floating Targets: Formulation and Solution Approaches," INFORMS Journal on Computing, INFORMS, vol. 30(3), pages 554-569, August.
  3. Meisam Nasrollahi & Jafar Razmi, 2021. "A mathematical model for designing an integrated pharmaceutical supply chain with maximum expected coverage under uncertainty," Operational Research, Springer, vol. 21(1), pages 525-552, March.
  4. Lukas Janinhoff & Robert Klein & Daniel Scholz, 2024. "Multitrip vehicle routing with delivery options: a data-driven application to the parcel industry," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 46(2), pages 241-294, June.
  5. Özarık, Sami Serkan & Veelenturf, Lucas P. & Woensel, Tom Van & Laporte, Gilbert, 2021. "Optimizing e-commerce last-mile vehicle routing and scheduling under uncertain customer presence," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 148(C).
  6. Wang, Yu & Chen, Feng & Chen, Zhi-Long, 2018. "Pickup and delivery of automobiles from warehouses to dealers," Transportation Research Part B: Methodological, Elsevier, vol. 117(PA), pages 412-430.
  7. Bonomi, Valentina & Manerba, Daniele & Mansini, Renata & Zanotti, Roberto, 2025. "Optimizing Attended Home Delivery: Multiple recovery options and customer availability profiles to face synchronization failures," International Journal of Production Economics, Elsevier, vol. 279(C).
  8. Neda Tanoumand & Tonguç Ünlüyurt, 2021. "An exact algorithm for the resource constrained home health care vehicle routing problem," Annals of Operations Research, Springer, vol. 304(1), pages 397-425, September.
  9. Ozbaygin, Gizem & Savelsbergh, Martin, 2019. "An iterative re-optimization framework for the dynamic vehicle routing problem with roaming delivery locations," Transportation Research Part B: Methodological, Elsevier, vol. 128(C), pages 207-235.
  10. Nils Boysen & Stefan Fedtke & Stefan Schwerdfeger, 2021. "Last-mile delivery concepts: a survey from an operational research perspective," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(1), pages 1-58, March.
  11. Dumez, Dorian & Lehuédé, Fabien & Péton, Olivier, 2021. "A large neighborhood search approach to the vehicle routing problem with delivery options," Transportation Research Part B: Methodological, Elsevier, vol. 144(C), pages 103-132.
  12. Yang, Ying & Hao, Xiaodeng & Wang, Shuaian, 2025. "The drone scheduling problem in shore-to-ship delivery: A time discretization-based model with an exact solving approach," Transportation Research Part B: Methodological, Elsevier, vol. 191(C).
  13. Tang, Christopher S. & Veelenturf, Lucas P., 2019. "The strategic role of logistics in the industry 4.0 era," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 129(C), pages 1-11.
  14. Yuan Yuan & Diego Cattaruzza & Maxime Ogier & Cyriaque Rousselot & Frédéric Semet, 2021. "Mixed integer programming formulations for the generalized traveling salesman problem with time windows," 4OR, Springer, vol. 19(4), pages 571-592, December.
  15. 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.
  16. Arslan, Okan & Kumcu, Gül Çulhan & Kara, Bahar Yetiş & Laporte, Gilbert, 2021. "The location and location-routing problem for the refugee camp network design," Transportation Research Part B: Methodological, Elsevier, vol. 143(C), pages 201-220.
  17. Nima Pourmohammadreza & Mohammad Reza Akbari Jokar, 2023. "A Novel Two-Phase Approach for Optimization of the Last-Mile Delivery Problem with Service Options," Sustainability, MDPI, vol. 15(10), pages 1-25, May.
  18. Yuan, Yuan & Cattaruzza, Diego & Ogier, Maxime & Semet, Frédéric & Vigo, Daniele, 2021. "A column generation based heuristic for the generalized vehicle routing problem with time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 152(C).
  19. Zu-Jun Ma & Fei Yang & Ying Dai & Zuo-Jun Max Shen, 2021. "The Migratory Beekeeping Routing Problem: Model and an Exact Algorithm," INFORMS Journal on Computing, INFORMS, vol. 33(1), pages 319-335, January.
  20. 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.
  21. Belma Turan & Vera Hemmelmayr & Allan Larsen & Jakob Puchinger, 2024. "Transition towards sustainable mobility: the role of transport optimization," 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. 32(2), pages 435-456, June.
  22. Seung Yoon Ko & Ratna Permata Sari & Muzaffar Makhmudov & Chang Seong Ko, 2020. "Collaboration Model for Service Clustering in Last-Mile Delivery," Sustainability, MDPI, vol. 12(14), pages 1-18, July.
  23. Florio, Alexandre M. & Feillet, Dominique & Hartl, Richard F., 2018. "The delivery problem: Optimizing hit rates in e-commerce deliveries," Transportation Research Part B: Methodological, Elsevier, vol. 117(PA), pages 455-472.
  24. Iman Dayarian & Martin Savelsbergh & John-Paul Clarke, 2020. "Same-Day Delivery with Drone Resupply," Transportation Science, INFORMS, vol. 54(1), pages 229-249, January.
  25. Zhang, Guowei & Jia, Ning & Zhu, Ning & Adulyasak, Yossiri & Ma, Shoufeng, 2023. "Robust drone selective routing in humanitarian transportation network assessment," European Journal of Operational Research, Elsevier, vol. 305(1), pages 400-428.
  26. Alexander Jungwirth & Guy Desaulniers & Markus Frey & Rainer Kolisch, 2022. "Exact Branch-Price-and-Cut for a Hospital Therapist Scheduling Problem with Flexible Service Locations and Time-Dependent Location Capacity," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 1157-1175, March.
  27. Yuan, Yuan & Cattaruzza, Diego & Ogier, Maxime & Semet, Frédéric, 2020. "A branch-and-cut algorithm for the generalized traveling salesman problem with time windows," European Journal of Operational Research, Elsevier, vol. 286(3), pages 849-866.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.