IDEAS home Printed from https://ideas.repec.org/r/inm/oropre/v58y2010i1p179-192.html
   My bibliography  Save this item

Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows

Citations

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


Cited by:

  1. David Wolfinger & Fabien Tricoire & Karl F. Doerner, 2019. "A matheuristic for a multimodal long haul routing problem," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(4), pages 397-433, December.
  2. Guy Desaulniers & Jørgen G. Rakke & Leandro C. Coelho, 2016. "A Branch-Price-and-Cut Algorithm for the Inventory-Routing Problem," Transportation Science, INFORMS, vol. 50(3), pages 1060-1076, August.
  3. C. Archetti & M. Bouchard & G. Desaulniers, 2011. "Enhanced Branch and Price and Cut for Vehicle Routing with Split Deliveries and Time Windows," Transportation Science, INFORMS, vol. 45(3), pages 285-298, August.
  4. Yang, Weibo & Ke, Liangjun & Wang, David Z.W. & Lam, Jasmine Siu Lee, 2021. "A branch-price-and-cut algorithm for the vehicle routing problem with release and due dates," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 145(C).
  5. 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.
  6. Frank Hennig & Bjørn Nygreen & Marco E. Lübbecke, 2012. "Nested column generation applied to the crude oil tanker routing and scheduling problem with split pickup and split delivery," Naval Research Logistics (NRL), John Wiley & Sons, vol. 59(3‐4), pages 298-310, April.
  7. Baris Yildiz & Martin Savelsbergh, 2019. "Provably High-Quality Solutions for the Meal Delivery Routing Problem," Transportation Science, INFORMS, vol. 53(5), pages 1372-1388, September.
  8. Ciancio, Claudio & Laganá, Demetrio & Vocaturo, Francesca, 2018. "Branch-price-and-cut for the Mixed Capacitated General Routing Problem with Time Windows," European Journal of Operational Research, Elsevier, vol. 267(1), pages 187-199.
  9. Mingyu Xiao & Jianan Zhang & Weibo Lin, 0. "Parameterized algorithms and complexity for the traveling purchaser problem and its variants," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-17.
  10. Li, Jiliu & Qin, Hu & Baldacci, Roberto & Zhu, Wenbin, 2020. "Branch-and-price-and-cut for the synchronized vehicle routing problem with split delivery, proportional service time and multiple time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 140(C).
  11. Wei, Xiaoyang & Jia, Shuai & Meng, Qiang & Tan, Kok Choon, 2020. "Tugboat scheduling for container ports," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 142(C).
  12. Faramroze G. Engineer & George L. Nemhauser & Martin W. P. Savelsbergh & Jin-Hwa Song, 2012. "The Fixed-Charge Shortest-Path Problem," INFORMS Journal on Computing, INFORMS, vol. 24(4), pages 578-596, November.
  13. Xue, Li & Luo, Zhixing & Lim, Andrew, 2016. "Exact approaches for the pickup and delivery problem with loading cost," Omega, Elsevier, vol. 59(PB), pages 131-145.
  14. Hennig, F. & Nygreen, B. & Furman, K.C. & Song, J., 2015. "Alternative approaches to the crude oil tanker routing and scheduling problem with split pickup and split delivery," European Journal of Operational Research, Elsevier, vol. 243(1), pages 41-51.
  15. Enrico Bartolini & Mauro Dell’Amico & Manuel Iori, 2017. "Scheduling cleaning activities on trains by minimizing idle times," Journal of Scheduling, Springer, vol. 20(5), pages 493-506, October.
  16. 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.
  17. Nicola Bianchessi & Michael Drexl & Stefan Irnich, 2017. "The Split Delivery Vehicle Routing Problem with Time Windows and Customer Inconvenience Constraints," Working Papers 1706, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
  18. Xiaofan Lai & Liang Xu & Zhou Xu & Yang Du, 2023. "An Approximation Algorithm for k -Depot Split Delivery Vehicle Routing Problem," INFORMS Journal on Computing, INFORMS, vol. 35(5), pages 1179-1194, September.
  19. Guy Desaulniers & Fausto Errico & Stefan Irnich & Michael Schneider, 2016. "Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows," Operations Research, INFORMS, vol. 64(6), pages 1388-1405, December.
  20. Yu, Bin & Shan, Wenxuan & Sheu, Jiuh-Biing & Diabat, Ali, 2022. "Branch-and-price for a combined order selection and distribution problem in online community group-buying of perishable products," Transportation Research Part B: Methodological, Elsevier, vol. 158(C), pages 341-373.
  21. Lixin Tang & Gongshu Wang & Zhi-Long Chen, 2014. "Integrated Charge Batching and Casting Width Selection at Baosteel," Operations Research, INFORMS, vol. 62(4), pages 772-787, August.
  22. Nabil Absi & Diego Cattaruzza & Dominique Feillet & Maxime Ogier & Frédéric Semet, 2020. "A Heuristic Branch-Cut-and-Price Algorithm for the ROADEF/EURO Challenge on Inventory Routing," Transportation Science, INFORMS, vol. 54(2), pages 313-329, March.
  23. Stefan Faldum & Timo Gschwind & Stefan Irnich, 2023. "Subset-Row Inequalities and Unreachability in Path-based Formulations for Routing and Scheduling Problems," Working Papers 2310, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
  24. Barış Yıldız & Oya Ekin Karaşan, 2017. "Regenerator Location Problem in Flexible Optical Networks," Operations Research, INFORMS, vol. 65(3), pages 595-620, June.
  25. 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.
  26. Mads Jepsen & Simon Spoorendonk & Stefan Ropke, 2013. "A Branch-and-Cut Algorithm for the Symmetric Two-Echelon Capacitated Vehicle Routing Problem," Transportation Science, INFORMS, vol. 47(1), pages 23-37, February.
  27. 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.
  28. Zhixing Luo & Hu Qin & T. C. E. Cheng & Qinghua Wu & Andrew Lim, 2021. "A Branch-and-Price-and-Cut Algorithm for the Cable-Routing Problem in Solar Power Plants," INFORMS Journal on Computing, INFORMS, vol. 33(2), pages 452-476, May.
  29. Lee, Jongsung & Kim, Byung-In & Johnson, Andrew L. & Lee, Kiho, 2014. "The nuclear medicine production and delivery problem," European Journal of Operational Research, Elsevier, vol. 236(2), pages 461-472.
  30. Zhenzhen Zhang & Zhixing Luo & Hu Qin & Andrew Lim, 2019. "Exact Algorithms for the Vehicle Routing Problem with Time Windows and Combinatorial Auction," Transportation Science, INFORMS, vol. 53(2), pages 427-441, March.
  31. Daqing Wu & Chenxiang Wu, 2022. "Research on the Time-Dependent Split Delivery Green Vehicle Routing Problem for Fresh Agricultural Products with Multiple Time Windows," Agriculture, MDPI, vol. 12(6), pages 1-28, May.
  32. Jiliu Li & Zhixing Luo & Roberto Baldacci & Hu Qin & Zhou Xu, 2023. "A New Exact Algorithm for Single-Commodity Vehicle Routing with Split Pickups and Deliveries," INFORMS Journal on Computing, INFORMS, vol. 35(1), pages 31-49, January.
  33. Christian Tilk & Michael Drexl & Stefan Irnich, 2018. "Nested Branch-and-Price-and-Cut for Vehicle Routing Problems with Multiple Resource Interdependencies," Working Papers 1801, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
  34. Gendreau, Michel & Manerba, Daniele & Mansini, Renata, 2016. "The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: A branch-and-price approach," European Journal of Operational Research, Elsevier, vol. 248(1), pages 59-71.
  35. Annelieke C. Baller & Said Dabia & Guy Desaulniers & Wout E. H. Dullaert, 2021. "The Inventory Routing Problem with Demand Moves," SN Operations Research Forum, Springer, vol. 2(1), pages 1-61, March.
  36. Nicola Bianchessi & Michael Drexl & Stefan Irnich, 2019. "The Split Delivery Vehicle Routing Problem with Time Windows and Customer Inconvenience Constraints," Transportation Science, INFORMS, vol. 53(4), pages 1067-1084, March.
  37. 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.
  38. Tian, Xiaopeng & Niu, Huimin, 2020. "Optimization of demand-oriented train timetables under overtaking operations: A surrogate-dual-variable column generation for eliminating indivisibility," Transportation Research Part B: Methodological, Elsevier, vol. 142(C), pages 143-173.
  39. Chu, James C., 2018. "Mixed-integer programming model and branch-and-price-and-cut algorithm for urban bus network design and timetabling," Transportation Research Part B: Methodological, Elsevier, vol. 108(C), pages 188-216.
  40. Claudia Archetti & Guy Desaulniers & M. Grazia Speranza, 2017. "Minimizing the logistic ratio in the inventory routing problem," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 6(4), pages 289-306, December.
  41. Nicola Bianchessi & Stefan Irnich, 2019. "Branch-and-Cut for the Split Delivery Vehicle Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 53(2), pages 442-462, March.
  42. Fink, Martin & Desaulniers, Guy & Frey, Markus & Kiermaier, Ferdinand & Kolisch, Rainer & Soumis, François, 2019. "Column generation for vehicle routing problems with multiple synchronization constraints," European Journal of Operational Research, Elsevier, vol. 272(2), pages 699-711.
  43. 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.
  44. Mingyu Xiao & Jianan Zhang & Weibo Lin, 2022. "Parameterized algorithms and complexity for the traveling purchaser problem and its variants," Journal of Combinatorial Optimization, Springer, vol. 44(4), pages 2269-2285, November.
  45. Sophie N. Parragh & Jorge Pinho de Sousa & Bernardo Almada-Lobo, 2015. "The Dial-a-Ride Problem with Split Requests and Profits," Transportation Science, INFORMS, vol. 49(2), pages 311-334, May.
  46. Arpan Rijal & Marco Bijvank & Asvin Goel & René de Koster, 2021. "Workforce Scheduling with Order-Picking Assignments in Distribution Facilities," Transportation Science, INFORMS, vol. 55(3), pages 725-746, May.
  47. Jie, Wanchen & Yang, Jun & Zhang, Min & Huang, Yongxi, 2019. "The two-echelon capacitated electric vehicle routing problem with battery swapping stations: Formulation and efficient methodology," European Journal of Operational Research, Elsevier, vol. 272(3), pages 879-904.
  48. Sepehr Nemati & Oleg V. Shylo & Oleg A. Prokopyev & Andrew J. Schaefer, 2016. "The Surgical Patient Routing Problem: A Central Planner Approach," INFORMS Journal on Computing, INFORMS, vol. 28(4), pages 657-673, November.
  49. Michael Drexl, 2014. "A Generic Heuristic for Vehicle Routing Problems with Multiple Synchronization Constraints," Working Papers 1412, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz, revised 04 Nov 2014.
  50. Katrin Heßler & Stefan Irnich, 2023. "Partial Dominance in Branch-Price-and-Cut for the Basic Multicompartment Vehicle-Routing Problem," INFORMS Journal on Computing, INFORMS, vol. 35(1), pages 50-65, January.
  51. Luo, Zhixing & Qin, Hu & Lim, Andrew, 2014. "Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints," European Journal of Operational Research, Elsevier, vol. 234(1), pages 49-60.
  52. Wang, Wei & Wang, Shuaian & Zhen, Lu & Laporte, Gilbert, 2023. "The impact of autonomous ships in regional waterways," Transportation Research Part B: Methodological, Elsevier, vol. 178(C).
  53. Annelieke C. Baller & Said Dabia & Wout E. H. Dullaert & Daniele Vigo, 2020. "The Vehicle Routing Problem with Partial Outsourcing," Transportation Science, INFORMS, vol. 54(4), pages 1034-1052, July.
  54. Stefan Faldum & Sarah Machate & Timo Gschwind & Stefan Irnich, 2024. "Partial dominance in branch-price-and-cut algorithms for vehicle routing and scheduling problems with a single-segment tradeoff," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 46(4), pages 1063-1097, December.
  55. Huang, Nan & Qin, Hu & Du, Yuquan & Wang, Li, 2024. "An exact algorithm for the multi-trip vehicle routing problem with time windows and multi-skilled manpower," European Journal of Operational Research, Elsevier, vol. 319(1), pages 31-49.
  56. Wang, Ruiting & Keyantuo, Patrick & Zeng, Teng & Sandoval, Jairo & Vishwanath, Aashrith & Borhan, Hoseinali & Moura, Scott, 2024. "Robust routing for a mixed fleet of heavy-duty trucks with pickup and delivery under energy consumption uncertainty," Applied Energy, Elsevier, vol. 368(C).
  57. 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.
  58. Qiu, Yuzhuo & Qiao, Jun & Pardalos, Panos M., 2017. "A branch-and-price algorithm for production routing problems with carbon cap-and-trade," Omega, Elsevier, vol. 68(C), pages 49-61.
  59. Salani, Matteo & Vacca, Ilaria, 2011. "Branch and price for the vehicle routing problem with discrete split deliveries and time windows," European Journal of Operational Research, Elsevier, vol. 213(3), pages 470-477, September.
  60. Hertz, Alain & Uldry, Marc & Widmer, Marino, 2012. "Integer linear programming models for a cement delivery problem," European Journal of Operational Research, Elsevier, vol. 222(3), pages 623-631.
  61. Casazza, Marco & Ceselli, Alberto & Wolfler Calvo, Roberto, 2021. "A route decomposition approach for the single commodity Split Pickup and Split Delivery Vehicle Routing Problem," European Journal of Operational Research, Elsevier, vol. 289(3), pages 897-911.
  62. Kristian Thun & Henrik Andersson & Magnus Stålhane, 2020. "A Branch-and-Price Algorithm for the Liner Shipping Network Design Problem," SN Operations Research Forum, Springer, vol. 1(4), pages 1-21, December.
  63. Katrin Heßler & Stefan Irnich, 2021. "Partial Dominance in Branch-Price-and-Cut for the Basic Multi-Compartment Vehicle-Routing Problem," Working Papers 2115, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
  64. 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.
  65. Michael Drexl, 2012. "Synchronization in Vehicle Routing---A Survey of VRPs with Multiple Synchronization Constraints," Transportation Science, INFORMS, vol. 46(3), pages 297-316, August.
  66. Qin, Hu & Su, E. & Wang, Yilun & Li, Jiliu, 2022. "Branch-and-price-and-cut for the electric vehicle relocation problem in one-way carsharing systems," Omega, Elsevier, vol. 109(C).
  67. Ann-Kathrin Rothenbächer & Michael Drexl & Stefan Irnich, 2016. "Branch-and-Price-and-Cut for the Truck-andTrailer Routing Problem with Time Windows," Working Papers 1617, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
  68. 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.
  69. Tilk, Christian & Drexl, Michael & Irnich, Stefan, 2019. "Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies," European Journal of Operational Research, Elsevier, vol. 276(2), pages 549-565.
  70. Liu, Mengyang & Luo, Zhixing & Lim, Andrew, 2015. "A branch-and-cut algorithm for a realistic dial-a-ride problem," Transportation Research Part B: Methodological, Elsevier, vol. 81(P1), pages 267-288.
  71. Menezes, Gustavo Campos & Mateus, Geraldo Robson & Ravetti, Martín Gómez, 2017. "A branch and price algorithm to solve the integrated production planning and scheduling in bulk ports," European Journal of Operational Research, Elsevier, vol. 258(3), pages 926-937.
  72. Wolfinger, David & Salazar-González, Juan-José, 2021. "The Pickup and Delivery Problem with Split Loads and Transshipments: A Branch-and-Cut Solution Approach," European Journal of Operational Research, Elsevier, vol. 289(2), pages 470-484.
  73. Faramroze G. Engineer & Kevin C. Furman & George L. Nemhauser & Martin W. P. Savelsbergh & Jin-Hwa Song, 2012. "A Branch-Price-and-Cut Algorithm for Single-Product Maritime Inventory Routing," Operations Research, INFORMS, vol. 60(1), pages 106-122, February.
  74. Ann-Kathrin Rothenbächer & Michael Drexl & Stefan Irnich, 2018. "Branch-and-Price-and-Cut for the Truck-and-Trailer Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 52(5), pages 1174-1190, October.
  75. Zhixing Luo & Hu Qin & Wenbin Zhu & Andrew Lim, 2017. "Branch and Price and Cut for the Split-Delivery Vehicle Routing Problem with Time Windows and Linear Weight-Related Cost," Transportation Science, INFORMS, vol. 51(2), pages 668-687, May.
  76. Xue, Li & Luo, Zhixing & Lim, Andrew, 2015. "Two exact algorithms for the traveling umpire problem," European Journal of Operational Research, Elsevier, vol. 243(3), pages 932-943.
  77. Christiaens, Jan & Çalik, Hatice & Wauters, Tony & Chirayil Chandrasekharan, Reshma & Vanden Berghe, Greet, 2020. "The prisoner transportation problem," European Journal of Operational Research, Elsevier, vol. 284(3), pages 1058-1073.
  78. Huang, Nan & Li, Jiliu & Zhu, Wenbin & Qin, Hu, 2021. "The multi-trip vehicle routing problem with time windows and unloading queue at depot," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 152(C).
  79. Huang, Sen & Liu, Kanglin & Zhang, Zhi-Hai, 2023. "Column-and-constraint-generation-based approach to a robust reverse logistic network design for bike sharing," Transportation Research Part B: Methodological, Elsevier, vol. 173(C), pages 90-118.
  80. 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.
  81. Mumm, Harald, 2018. "Didaktischer Zugang zur Theorie und Praxis moderner Softwarebibliotheken (Frameworks) für die Unternehmensforschung (OR)," Wismar Discussion Papers 07/2018, Hochschule Wismar, Wismar Business School.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.