IDEAS home Printed from https://ideas.repec.org/r/inm/ortrsc/v43y2009i3p267-286.html
   My bibliography  Save this item

Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows

Citations

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


Cited by:

  1. Sun, Peng & Veelenturf, Lucas P. & Hewitt, Mike & Van Woensel, Tom, 2018. "The time-dependent pickup and delivery problem with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 116(C), pages 1-24.
  2. Pu, Song & Zhan, Shuguang, 2021. "Two-stage robust railway line-planning approach with passenger demand uncertainty," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 152(C).
  3. 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.
  4. Schaumann, Sarah K. & Bergmann, Felix M. & Wagner, Stephan M. & Winkenbach, Matthias, 2023. "Route efficiency implications of time windows and vehicle capacities in first- and last-mile logistics," European Journal of Operational Research, Elsevier, vol. 311(1), pages 88-111.
  5. Detti, Paolo & Papalini, Francesco & Lara, Garazi Zabalo Manrique de, 2017. "A multi-depot dial-a-ride problem with heterogeneous vehicles and compatibility constraints in healthcare," Omega, Elsevier, vol. 70(C), pages 1-14.
  6. Abdulkader, M.M.S. & Gajpal, Yuvraj & ElMekkawy, Tarek Y., 2018. "Vehicle routing problem in omni-channel retailing distribution systems," International Journal of Production Economics, Elsevier, vol. 196(C), pages 43-55.
  7. Veaceslav Ghilas & Jean-François Cordeau & Emrah Demir & Tom Van Woensel, 2018. "Branch-and-Price for the Pickup and Delivery Problem with Time Windows and Scheduled Lines," Transportation Science, INFORMS, vol. 52(5), pages 1191-1210, October.
  8. Chen, Peng Will & Nie, Yu Marco, 2017. "Analysis of an idealized system of demand adaptive paired-line hybrid transit," Transportation Research Part B: Methodological, Elsevier, vol. 102(C), pages 38-54.
  9. Timo Gschwind & Stefan Irnich & Ann-Kathrin Rothenbaecher & Christian Tilk, 2017. "Bidirectional Labeling in Column-Generation Algorithms for Pickup-and-Delivery Problems," Working Papers 1710, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
  10. Cortes, Juan David & Suzuki, Yoshinori, 2020. "Vehicle Routing with Shipment Consolidation," International Journal of Production Economics, Elsevier, vol. 227(C).
  11. Schulz, Arne & Pfeiffer, Christian, 2024. "Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems," European Journal of Operational Research, Elsevier, vol. 312(2), pages 456-472.
  12. 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.
  13. Fernando Afonso Santos & Geraldo Robson Mateus & Alexandre Salles da Cunha, 2015. "A Branch-and-Cut-and-Price Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem," Transportation Science, INFORMS, vol. 49(2), pages 355-368, May.
  14. Song, Yujian & Zhang, Jiantong & Liang, Zhe & Ye, Chunming, 2017. "An exact algorithm for the container drayage problem under a separation mode," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 106(C), pages 231-254.
  15. Roberto Baldacci & Enrico Bartolini & Aristide Mingozzi, 2011. "An Exact Algorithm for the Pickup and Delivery Problem with Time Windows," Operations Research, INFORMS, vol. 59(2), pages 414-426, April.
  16. Zhang, Li & Liu, Zhongshan & Yu, Bin & Long, Jiancheng, 2024. "A ridesharing routing problem for airport riders with electric vehicles," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 184(C).
  17. Z. Al Chami & H. Manier & M.-A. Manier, 2019. "A lexicographic approach for the bi-objective selective pickup and delivery problem with time windows and paired demands," Annals of Operations Research, Springer, vol. 273(1), pages 237-255, February.
  18. Negin Alisoltani & Mostafa Ameli & Mahdi Zargayouna & Ludovic Leclercq, 2022. "Space-time clustering-based method to optimize shareability in real-time ride-sharing," PLOS ONE, Public Library of Science, vol. 17(1), pages 1-25, January.
  19. Andrew Lim & Zhenzhen Zhang & Hu Qin, 2017. "Pickup and Delivery Service with Manpower Planning in Hong Kong Public Hospitals," Transportation Science, INFORMS, vol. 51(2), pages 688-705, May.
  20. Pereira, Armando Honorio & Mateus, Geraldo Robson & Urrutia, Sebastián Alberto, 2022. "Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks," European Journal of Operational Research, Elsevier, vol. 300(1), pages 207-220.
  21. 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.
  22. Sun, Wei & Yu, Yang & Wang, Junwei, 2019. "Heterogeneous vehicle pickup and delivery problems: Formulation and exact solution," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 125(C), pages 181-202.
  23. Eskandarzadeh, Saman & Fahimnia, Behnam, 2022. "Rest break policy comparison for heavy vehicle drivers in Australia," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 159(C).
  24. Hua, Shijia & Zeng, Wenjia & Liu, Xinglu & Qi, Mingyao, 2022. "Optimality-guaranteed algorithms on the dynamic shared-taxi problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).
  25. Sun, Yanshuo & Chen, Zhi-Long & Zhang, Lei, 2020. "Nonprofit peer-to-peer ridesharing optimization," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 142(C).
  26. Du, Jianhui & Zhang, Zhiqin & Wang, Xu & Lau, Hoong Chuin, 2023. "A hierarchical optimization approach for dynamic pickup and delivery problem with LIFO constraints," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 175(C).
  27. 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.
  28. Boshuai Zhao & Kai Wang & Wenchao Wei & Roel Leus, 2024. "The Dial-a-Ride Problem with Limited Pickups per Trip," Papers 2408.07602, arXiv.org, revised Aug 2024.
  29. Liu, Ran & Xie, Xiaolan & Garaix, Thierry, 2014. "Hybridization of tabu search with feasible and infeasible local searches for periodic home health care logistics," Omega, Elsevier, vol. 47(C), pages 17-32.
  30. Stålhane, Magnus & Halvorsen-Weare, Elin E. & Nonås, Lars Magne & Pantuso, Giovanni, 2019. "Optimizing vessel fleet size and mix to support maintenance operations at offshore wind farms," European Journal of Operational Research, Elsevier, vol. 276(2), pages 495-509.
  31. Amirmahdi Tafreshian & Neda Masoud & Yafeng Yin, 2020. "Frontiers in Service Science: Ride Matching for Peer-to-Peer Ride Sharing: A Review and Future Directions," Service Science, INFORMS, vol. 12(2-3), pages 44-60, June.
  32. 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.
  33. Timo Hintsch & Stefan Irnich, 2018. "Exact Solution of the Soft-Clustered Vehicle Routing Problem," Working Papers 1813, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
  34. van Schijndel, M.J.M. & Braat, J.J.M., 2012. "Vehicle Planning in Cross Chain Control Centers," Discussion Paper 2012-058, Tilburg University, Center for Economic Research.
  35. 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.
  36. Jie Xiong & Biao Chen & Xiangnan Li & Zhengbing He & Yanyan Chen, 2020. "Demand Responsive Service-based Optimization on Flexible Routes and Departure Time of Community Shuttles," Sustainability, MDPI, vol. 12(3), pages 1-20, January.
  37. Margaretha Gansterer & Murat Küçüktepe & Richard F. Hartl, 2017. "The multi-vehicle profitable pickup and delivery problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(1), pages 303-319, January.
  38. Burger, M. & Su, Z. & De Schutter, B., 2018. "A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem," European Journal of Operational Research, Elsevier, vol. 265(2), pages 463-477.
  39. Marilène Cherkesly & Guy Desaulniers & Gilbert Laporte, 2015. "Branch-Price-and-Cut Algorithms for the Pickup and Delivery Problem with Time Windows and Last-in-First-Out Loading," Transportation Science, INFORMS, vol. 49(4), pages 752-766, November.
  40. Mirko Ruokokoski & Harri Ehtamo & Panos M. Pardalos, 2015. "Elevator dispatching problem: a mixed integer linear programming formulation and polyhedral results," Journal of Combinatorial Optimization, Springer, vol. 29(4), pages 750-780, May.
  41. Gschwind, Timo & Irnich, Stefan & Rothenbächer, Ann-Kathrin & Tilk, Christian, 2018. "Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems," European Journal of Operational Research, Elsevier, vol. 266(2), pages 521-530.
  42. Wang, Mengtong & Zhang, Canrong & Bell, Michael G.H. & Miao, Lixin, 2022. "A branch-and-price algorithm for location-routing problems with pick-up stations in the last-mile distribution system," European Journal of Operational Research, Elsevier, vol. 303(3), pages 1258-1276.
  43. Pedro Munari & Reinaldo Morabito, 2018. "A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 26(3), pages 437-464, October.
  44. Wei Zhou & Jane Lin, 2019. "An On-Demand Same-Day Delivery Service Using Direct Peer-to-Peer Transshipment Strategies," Networks and Spatial Economics, Springer, vol. 19(2), pages 409-443, June.
  45. 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.
  46. Malaguti, Enrico & Martello, Silvano & Santini, Alberto, 2018. "The traveling salesman problem with pickups, deliveries, and draft limits," Omega, Elsevier, vol. 74(C), pages 50-58.
  47. Delgado, Felipe & Mora, Julio, 2021. "A matheuristic approach to the air-cargo recovery problem under demand disruption," Journal of Air Transport Management, Elsevier, vol. 90(C).
  48. Li, Chongshou & Gong, Lijun & Luo, Zhixing & Lim, Andrew, 2019. "A branch-and-price-and-cut algorithm for a pickup and delivery problem in retailing," Omega, Elsevier, vol. 89(C), pages 71-91.
  49. Timo Gschwind & Michael Drexl, 2016. "Adaptive Large Neighborhood Search with a Constant-Time Feasibility Test for the Dial-a-Ride Problem," Working Papers 1624, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
  50. 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.
  51. Ali Mehsin Alyasiry & Michael Forbes & Michael Bulmer, 2019. "An Exact Algorithm for the Pickup and Delivery Problem with Time Windows and Last-in-First-out Loading," Transportation Science, INFORMS, vol. 53(6), pages 1695-1705, November.
  52. Yuan Qu & Jonathan F. Bard, 2015. "A Branch-and-Price-and-Cut Algorithm for Heterogeneous Pickup and Delivery Problems with Configurable Vehicle Capacity," Transportation Science, INFORMS, vol. 49(2), pages 254-270, May.
  53. Goeke, Dominik, 2019. "Granular tabu search for the pickup and delivery problem with time windows and electric vehicles," European Journal of Operational Research, Elsevier, vol. 278(3), pages 821-836.
  54. Renaud Masson & Anna Trentini & Fabien Lehuédé & Nicolas Malhéné & Olivier Péton & Houda Tlahig, 2017. "Optimization of a city logistics transportation system with mixed passengers and goods," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 6(1), pages 81-109, March.
  55. Qiu, Xiaoqiu & Feuerriegel, Stefan & Neumann, Dirk, 2017. "Making the most of fleets: A profit-maximizing multi-vehicle pickup and delivery selection problem," European Journal of Operational Research, Elsevier, vol. 259(1), pages 155-168.
  56. Bongiovanni, Claudia & Kaspi, Mor & Geroliminis, Nikolas, 2019. "The electric autonomous dial-a-ride problem," Transportation Research Part B: Methodological, Elsevier, vol. 122(C), pages 436-456.
  57. Paul Czioska & Ronny Kutadinata & Aleksandar Trifunović & Stephan Winter & Monika Sester & Bernhard Friedrich, 2019. "Real-world meeting points for shared demand-responsive transportation systems," Public Transport, Springer, vol. 11(2), pages 341-377, August.
  58. 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.
  59. Masson, Renaud & Ropke, Stefan & Lehuédé, Fabien & Péton, Olivier, 2014. "A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes," European Journal of Operational Research, Elsevier, vol. 236(3), pages 849-862.
  60. Aziez, Imadeddine & Côté, Jean-François & Coelho, Leandro C., 2022. "Fleet sizing and routing of healthcare automated guided vehicles," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 161(C).
  61. You, Jintao & Miao, Lixin & Zhang, Canrong & Xue, Zhaojie, 2020. "A generic model for the local container drayage problem using the emerging truck platooning operation mode," Transportation Research Part B: Methodological, Elsevier, vol. 133(C), pages 181-209.
  62. Sun, Peng & Veelenturf, Lucas P. & Hewitt, Mike & Van Woensel, Tom, 2020. "Adaptive large neighborhood search for the time-dependent profitable pickup and delivery problem with time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 138(C).
  63. Aziez, Imadeddine & Côté, Jean-François & Coelho, Leandro C., 2020. "Exact algorithms for the multi-pickup and delivery problem with time windows," European Journal of Operational Research, Elsevier, vol. 284(3), pages 906-919.
  64. 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.
  65. Zheng, Jianfeng & Meng, Qiang & Sun, Zhuo, 2014. "Impact analysis of maritime cabotage legislations on liner hub-and-spoke shipping network design," European Journal of Operational Research, Elsevier, vol. 234(3), pages 874-884.
  66. Kohar, Amit & Jakhar, Suresh Kumar & Agarwal, Yogesh K., 2023. "Strong cutting planes for the capacitated multi-pickup and delivery problem with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 176(C).
  67. Hyun Seop Uhm & Young Hoon Lee, 2022. "Vehicle routing problem under safe separation distance for multiple unmanned aerial vehicle operation," Operational Research, Springer, vol. 22(5), pages 5107-5136, November.
  68. Phan Nguyen Ky Phuc & Nguyen Le Phuong Thao, 2021. "Ant Colony Optimization for Multiple Pickup and Multiple Delivery Vehicle Routing Problem with Time Window and Heterogeneous Fleets," Logistics, MDPI, vol. 5(2), pages 1-13, May.
  69. Feng, Tao & Lusby, Richard M. & Zhang, Yongxiang & Tao, Siyu & Zhang, Bojian & Peng, Qiyuan, 2024. "A branch-and-price algorithm for integrating urban rail crew scheduling and rostering problems," Transportation Research Part B: Methodological, Elsevier, vol. 183(C).
  70. Männel, Dirk & Bortfeldt, Andreas, 2016. "A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints," European Journal of Operational Research, Elsevier, vol. 254(3), pages 840-858.
  71. 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).
  72. Zhang, Li & Liu, Zhongshan & Yu, Lan & Fang, Ke & Yao, Baozhen & Yu, Bin, 2022. "Routing optimization of shared autonomous electric vehicles under uncertain travel time and uncertain service time," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 157(C).
  73. Hiermann, Gerhard & Puchinger, Jakob & Ropke, Stefan & Hartl, Richard F., 2016. "The Electric Fleet Size and Mix Vehicle Routing Problem with Time Windows and Recharging Stations," European Journal of Operational Research, Elsevier, vol. 252(3), pages 995-1018.
  74. Wang, Yong & Peng, Shouguo & Zhou, Xuesong & Mahmoudi, Monirehalsadat & Zhen, Lu, 2020. "Green logistics location-routing problem with eco-packages," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 143(C).
  75. Michael Drexl, 2021. "On the one-to-one pickup-and-delivery problem with time windows and trailers," 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. 29(3), pages 1115-1162, September.
  76. 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.
  77. Mahmoudi, Monirehalsadat & Zhou, Xuesong, 2016. "Finding optimal solutions for vehicle routing problem with pickup and delivery services with time windows: A dynamic programming approach based on state–space–time network representations," Transportation Research Part B: Methodological, Elsevier, vol. 89(C), pages 19-42.
  78. Regnier-Coudert, Olivier & McCall, John & Ayodele, Mayowa & Anderson, Steven, 2016. "Truck and trailer scheduling in a real world, dynamic and heterogeneous context," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 93(C), pages 389-408.
  79. 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.
  80. Jinming Liu & Guoting Zhang & Lining Xing & Weihua Qi & Yingwu Chen, 2022. "An Exact Algorithm for Multi-Task Large-Scale Inter-Satellite Routing Problem with Time Windows and Capacity Constraints," Mathematics, MDPI, vol. 10(21), pages 1-24, October.
  81. 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.
  82. Moghaddam, Mahboobeh & Pearce, Robin H. & Mokhtar, Hamid & Prato, Carlo G., 2020. "A generalised model for container drayage operations with heterogeneous fleet, multi-container sizes and two modes of operation," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 139(C).
  83. Lotte Verdonck & Katrien Ramaekers & Benoît Depaire & An Caris & Gerrit K. Janssens, 2019. "Analysing the Effect of Partner Characteristics on the Performance of Horizontal Carrier Collaborations," Networks and Spatial Economics, Springer, vol. 19(2), pages 583-609, June.
  84. 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.
  85. Schulz, Arne & Pfeiffer, Christian, 2024. "A Branch-and-Cut algorithm for the dial-a-ride problem with incompatible customer types," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 181(C).
  86. Margaretha Gansterer & Richard F. Hartl & Philipp E. H. Salzmann, 2018. "Exact solutions for the collaborative pickup and delivery problem," 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. 26(2), pages 357-371, June.
  87. Naccache, Salma & Côté, Jean-François & Coelho, Leandro C., 2018. "The multi-pickup and delivery problem with time windows," European Journal of Operational Research, Elsevier, vol. 269(1), pages 353-362.
  88. Daniel Y. Mo & H. Y. Lam & Weikun Xu & G. T. S. Ho, 2020. "Design of Flexible Vehicle Scheduling Systems for Sustainable Paratransit Services," Sustainability, MDPI, vol. 12(14), pages 1-18, July.
  89. Sergio Maria Patella & Gianluca Grazieschi & Valerio Gatta & Edoardo Marcucci & Stefano Carrese, 2020. "The Adoption of Green Vehicles in Last Mile Logistics: A Systematic Review," Sustainability, MDPI, vol. 13(1), pages 1-29, December.
  90. Timo Gschwind & Michael Drexl, 2019. "Adaptive Large Neighborhood Search with a Constant-Time Feasibility Test for the Dial-a-Ride Problem," Transportation Science, INFORMS, vol. 53(2), pages 480-491, March.
  91. Yves Molenbruch & Kris Braekers & An Caris, 2017. "Typology and literature review for dial-a-ride problems," Annals of Operations Research, Springer, vol. 259(1), pages 295-325, December.
  92. 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.
  93. Cherkesly, Marilène & Desaulniers, Guy & Irnich, Stefan & Laporte, Gilbert, 2016. "Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks," European Journal of Operational Research, Elsevier, vol. 250(3), pages 782-793.
  94. Dimitris Bertsimas & Allison Chang & Velibor V. Mišić & Nishanth Mundru, 2019. "The Airlift Planning Problem," Transportation Science, INFORMS, vol. 53(3), pages 773-773, May.
  95. Wang, Yuan & Lei, Linfei & Zhang, Dongxiang & Lee, Loo Hay, 2020. "Towards delivery-as-a-service: Effective neighborhood search strategies for integrated delivery optimization of E-commerce and static O2O parcels," Transportation Research Part B: Methodological, Elsevier, vol. 139(C), pages 38-63.
  96. Su, E. & Qin, Hu & Li, Jiliu & Pan, Kai, 2023. "An exact algorithm for the pickup and delivery problem with crowdsourced bids and transshipment," Transportation Research Part B: Methodological, Elsevier, vol. 177(C).
  97. 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.
  98. Wang, Naiyu & Meng, Qiang & Zhang, Canrong, 2023. "A branch-price-and-cut algorithm for the local container drayage problem with controllable vehicle interference," Transportation Research Part B: Methodological, Elsevier, vol. 178(C).
  99. Timo Gschwind & Stefan Irnich, 2012. "Effective Handling of Dynamic Time Windows and Synchronization with Precedences for Exact Vehicle Routing," Working Papers 1211, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
  100. Dikas, G. & Minis, I., 2014. "Scheduled paratransit transport systems," Transportation Research Part B: Methodological, Elsevier, vol. 67(C), pages 18-34.
  101. Roberto Baldacci & Enrico Bartolini & Aristide Mingozzi & Roberto Roberti, 2010. "An exact solution framework for a broad class of vehicle routing problems," Computational Management Science, Springer, vol. 7(3), pages 229-268, July.
  102. 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.
  103. Mahmoudi, Monirehalsadat & Chen, Junhua & Shi, Tie & Zhang, Yongxiang & Zhou, Xuesong, 2019. "A cumulative service state representation for the pickup and delivery problem with transfers," Transportation Research Part B: Methodological, Elsevier, vol. 129(C), pages 351-380.
  104. Gschwind, Timo, 2015. "A comparison of column-generation approaches to the Synchronized Pickup and Delivery Problem," European Journal of Operational Research, Elsevier, vol. 247(1), pages 60-71.
  105. 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.
  106. Kellner, Florian & Schneiderbauer, Miriam, 2019. "Further insights into the allocation of greenhouse gas emissions to shipments in road freight transportation: The pollution routing game," European Journal of Operational Research, Elsevier, vol. 278(1), pages 296-313.
  107. Ting, Chuan-Kang & Liao, Xin-Lan, 2013. "The selective pickup and delivery problem: Formulation and a memetic algorithm," International Journal of Production Economics, Elsevier, vol. 141(1), pages 199-211.
  108. Dirk Männel & Andreas Bortfeldt, 2015. "A Hybrid Algorithm for the Vehicle Routing Problem with Pickup and Delivery and 3D Loading Constraints," FEMM Working Papers 150015, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
  109. Arslan, A.M. & Agatz, N.A.H. & Srour, F.J., 2023. "Model Formulations for Pickup and Delivery Problems in Designated Driver Services," ERIM Report Series Research in Management ERS-2023-004-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
  110. G. Dikas & I. Minis, 2018. "Scheduled Paratransit Transport Enhanced by Accessible Taxis," Transportation Science, INFORMS, vol. 52(5), pages 1122-1140, October.
  111. Albert H. Schrotenboer & Evrim Ursavas & Iris F. A. Vis, 2019. "A Branch-and-Price-and-Cut Algorithm for Resource-Constrained Pickup and Delivery Problems," Transportation Science, INFORMS, vol. 53(4), pages 1001-1022, July.
  112. Timothy Curtois & Dario Landa-Silva & Yi Qu & Wasakorn Laesanklang, 2018. "Large neighbourhood search with adaptive guided ejection search for the pickup and delivery problem with time windows," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 7(2), pages 151-192, June.
  113. 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.
  114. van Schijndel, M.J.M. & Braat, J.J.M., 2012. "Vehicle Planning in Cross Chain Control Centers," Other publications TiSEM d65f4ead-f6b8-4110-ba18-6, Tilburg University, School of Economics and Management.
  115. Sun, Peng & Veelenturf, Lucas P. & Dabia, Said & Van Woensel, Tom, 2018. "The time-dependent capacitated profitable tour problem with time windows and precedence constraints," European Journal of Operational Research, Elsevier, vol. 264(3), pages 1058-1073.
  116. Capelle, Thomas & Cortés, Cristián E. & Gendreau, Michel & Rey, Pablo A. & Rousseau, Louis-Martin, 2019. "A column generation approach for location-routing problems with pickup and delivery," European Journal of Operational Research, Elsevier, vol. 272(1), pages 121-131.
  117. Asghari, Mohammad & Mirzapour Al-e-hashem, S. Mohammad J., 2020. "A green delivery-pickup problem for home hemodialysis machines; sharing economy in distributing scarce resources," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 134(C).
  118. Hou, Liwen & Li, Dong & Zhang, Dali, 2018. "Ride-matching and routing optimisation: Models and a large neighbourhood search heuristic," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 118(C), pages 143-162.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.