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

A New Optimization Algorithm for the 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. Valerio de Carvalho, J. M., 2002. "LP models for bin packing and cutting stock problems," European Journal of Operational Research, Elsevier, vol. 141(2), pages 253-273, September.
  2. Wang, Xiubin & Regan, Amelia C., 2002. "Local truckload pickup and delivery with hard time window constraints," Transportation Research Part B: Methodological, Elsevier, vol. 36(2), pages 97-112, February.
  3. Anthony Pajunas & Edward J. Matto & Michael Trick & Luis F. Zuluaga, 2007. "Optimizing Highway Transportation at the United States Postal Service," Interfaces, INFORMS, vol. 37(6), pages 515-525, December.
  4. Schneider, Kellie & Nurre, Sarah G., 2019. "A multi-criteria vehicle routing approach to improve the compliance audit schedule for food banks," Omega, Elsevier, vol. 84(C), pages 127-140.
  5. Said Dabia & Emrah Demir & Tom Van Woensel, 2017. "An Exact Approach for a Variant of the Pollution-Routing Problem," Transportation Science, INFORMS, vol. 51(2), pages 607-628, May.
  6. Russell, Robert A. & Chiang, Wen-Chyuan, 2006. "Scatter search for the vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 169(2), pages 606-622, March.
  7. Guy Desaulniers & François Lessard & Ahmed Hadjar, 2008. "Tabu Search, Partial Elementarity, and Generalized k -Path Inequalities for the Vehicle Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 42(3), pages 387-404, August.
  8. İbrahim Muter & Ş. İlker Birbil & Güvenç Şahin, 2010. "Combination of Metaheuristic and Exact Algorithms for Solving Set Covering-Type Optimization Problems," INFORMS Journal on Computing, INFORMS, vol. 22(4), pages 603-619, November.
  9. Lin, Na & Akkerman, Renzo & Kanellopoulos, Argyris & Hu, Xiangpei & Wang, Xuping & Ruan, Junhu, 2023. "Vehicle routing with heterogeneous service types: Optimizing post-harvest preprocessing operations for fruits and vegetables in short food supply chains," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 172(C).
  10. Liu, Fuh-Hwa Franklin & Shen, Sheng-Yuan, 1999. "A route-neighborhood-based metaheuristic for vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 118(3), pages 485-504, November.
  11. Fabien Tricoire & Nathalie Bostel & Pierre Dejax & Pierre Guez, 2013. "Exact and hybrid methods for the multiperiod field service routing 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. 21(2), pages 359-377, March.
  12. Park, Jongyoon & Han, Jinil & Lee, Kyungsik, 2022. "Integer Optimization Model and Algorithm for the Stem Cell Culturing Problem," Omega, Elsevier, vol. 108(C).
  13. 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.
  14. 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.
  15. Xiangyi Zhang & Lu Chen & Michel Gendreau & André Langevin, 2022. "Learning-Based Branch-and-Price Algorithms for the Vehicle Routing Problem with Time Windows and Two-Dimensional Loading Constraints," INFORMS Journal on Computing, INFORMS, vol. 34(3), pages 1419-1436, May.
  16. Filippo Focacci & Andrea Lodi & Michela Milano, 2002. "A Hybrid Exact Algorithm for the TSPTW," INFORMS Journal on Computing, INFORMS, vol. 14(4), pages 403-417, November.
  17. Line Blander Reinhardt & Mads Kehlet Jepsen & David Pisinger, 2016. "The Edge Set Cost of the Vehicle Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 50(2), pages 694-707, May.
  18. Mathijs van Zon & Remy Spliet & Wilco van den Heuvel, 2021. "The Joint Network Vehicle Routing Game," Transportation Science, INFORMS, vol. 55(1), pages 179-195, 1-2.
  19. Don Weigel & Buyang Cao, 1999. "Applying GIS and OR Techniques to Solve Sears Technician-Dispatching and Home Delivery Problems," Interfaces, INFORMS, vol. 29(1), pages 112-130, February.
  20. 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.
  21. Zhen, Lu & Ma, Chengle & Wang, Kai & Xiao, Liyang & Zhang, Wei, 2020. "Multi-depot multi-trip vehicle routing problem with time windows and release dates," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 135(C).
  22. Dominique Feillet & Pierre Dejax & Michel Gendreau, 2005. "The Profitable Arc Tour Problem: Solution with a Branch-and-Price Algorithm," Transportation Science, INFORMS, vol. 39(4), pages 539-552, November.
  23. Chung-Yee Lee & Sila Çetinkaya & Albert P. M. Wagelmans, 2001. "A Dynamic Lot-Sizing Model with Demand Time Windows," Management Science, INFORMS, vol. 47(10), pages 1384-1395, October.
  24. Zhi‐Long Chen & Warren B. Powell, 2003. "Exact algorithms for scheduling multiple families of jobs on parallel machines," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(7), pages 823-840, October.
  25. Sana Jawarneh & Salwani Abdullah, 2015. "Sequential Insertion Heuristic with Adaptive Bee Colony Optimisation Algorithm for Vehicle Routing Problem with Time Windows," PLOS ONE, Public Library of Science, vol. 10(7), pages 1-23, July.
  26. Nikolaos Charalambopoulos & Andreas C. Nearchou, 2021. "Ship Routing Using Genetic Algorithms," SN Operations Research Forum, Springer, vol. 2(3), pages 1-26, September.
  27. Bhusiri, Narath & Qureshi, Ali Gul & Taniguchi, Eiichi, 2014. "The trade-off between fixed vehicle costs and time-dependent arrival penalties in a routing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 62(C), pages 1-22.
  28. S. F. Ghannadpour & S. Noori & R. Tavakkoli-Moghaddam, 2014. "A multi-objective vehicle routing and scheduling problem with uncertainty in customers’ request and priority," Journal of Combinatorial Optimization, Springer, vol. 28(2), pages 414-446, August.
  29. 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.
  30. Keng Hoo Chuah & Jon C. Yingling, 2005. "Routing for a Just-in-Time Supply Pickup and Delivery System," Transportation Science, INFORMS, vol. 39(3), pages 328-339, August.
  31. Yaoting Huang & Boyu Chen & Wenlian Lu & Zhong-Xiao Jin & Ren Zheng, 2022. "Asynchronous optimization of part logistics routing problem," Journal of Global Optimization, Springer, vol. 82(4), pages 803-834, April.
  32. Yiming Liu & Yang Yu & Yu Zhang & Roberto Baldacci & Jiafu Tang & Xinggang Luo & Wei Sun, 2023. "Branch-Cut-and-Price for the Time-Dependent Green Vehicle Routing Problem with Time Windows," INFORMS Journal on Computing, INFORMS, vol. 35(1), pages 14-30, January.
  33. Russell Bent & Pascal Van Hentenryck, 2004. "A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 38(4), pages 515-530, November.
  34. Matsatsinis, Nikolaos F., 2004. "Towards a decision support system for the ready concrete distribution system: A case of a Greek company," European Journal of Operational Research, Elsevier, vol. 152(2), pages 487-499, January.
  35. 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.
  36. Ricardo Fukasawa & Qie He & Fernando Santos & Yongjia Song, 2018. "A Joint Vehicle Routing and Speed Optimization Problem," INFORMS Journal on Computing, INFORMS, vol. 30(4), pages 694-709, November.
  37. Hong, Sung-Chul & Park, Yang-Byung, 1999. "A heuristic for bi-objective vehicle routing with time window constraints," International Journal of Production Economics, Elsevier, vol. 62(3), pages 249-258, September.
  38. Edirisinghe, N.C.P. & James, R.J.W., 2014. "Fleet routing position-based model for inventory pickup under production shutdown," European Journal of Operational Research, Elsevier, vol. 236(2), pages 736-747.
  39. Marielle Christiansen, 1999. "Decomposition of a Combined Inventory and Time Constrained Ship Routing Problem," Transportation Science, INFORMS, vol. 33(1), pages 3-16, February.
  40. Chung-Yee Lee & Sila Çetinkaya & Albert P.M. Wagelmans, 1999. "A Dynamic Lot-Sizing Model with Demand Time Windows," Tinbergen Institute Discussion Papers 99-095/4, Tinbergen Institute.
  41. Zhu, Xiaoyan & Wilhelm, Wilbert E., 2007. "Three-stage approaches for optimizing some variations of the resource constrained shortest-path sub-problem in a column generation context," European Journal of Operational Research, Elsevier, vol. 183(2), pages 564-577, December.
  42. Jonathan F. Bard & Liu Huang & Patrick Jaillet & Moshe Dror, 1998. "A Decomposition Approach to the Inventory Routing Problem with Satellite Facilities," Transportation Science, INFORMS, vol. 32(2), pages 189-203, May.
  43. Jonathan F. Bard & Siwate Rojanasoonthon, 2006. "A branch‐and‐price algorithm for parallel machine scheduling with time windows and job priorities," Naval Research Logistics (NRL), John Wiley & Sons, vol. 53(1), pages 24-44, February.
  44. Karabuk, Suleyman, 2009. "A nested decomposition approach for solving the paratransit vehicle scheduling problem," Transportation Research Part B: Methodological, Elsevier, vol. 43(4), pages 448-465, May.
  45. S. Irnich, 2008. "A Unified Modeling and Solution Framework for Vehicle Routing and Local Search-Based Metaheuristics," INFORMS Journal on Computing, INFORMS, vol. 20(2), pages 270-287, May.
  46. Hang Xu & Zhi-Long Chen & Srinivas Rajagopal & Sundar Arunapuram, 2003. "Solving a Practical Pickup and Delivery Problem," Transportation Science, INFORMS, vol. 37(3), pages 347-364, August.
  47. 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).
  48. 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).
  49. You, Jintao & Wang, Yuan & Xue, Zhaojie, 2023. "An exact algorithm for the multi-trip container drayage problem with truck platooning," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 175(C).
  50. Lee, Chungmok, 2022. "A robust optimization approach with probe-able uncertainty," European Journal of Operational Research, Elsevier, vol. 296(1), pages 218-239.
  51. Ghoniem, Ahmed & Farhadi, Farbod & Reihaneh, Mohammad, 2015. "An accelerated branch-and-price algorithm for multiple-runway aircraft sequencing problems," European Journal of Operational Research, Elsevier, vol. 246(1), pages 34-43.
  52. Li, Jing-Quan & Mirchandani, Pitu B. & Borenstein, Denis, 2009. "Real-time vehicle rerouting problems with time windows," European Journal of Operational Research, Elsevier, vol. 194(3), pages 711-727, May.
  53. Siyang Xie & Xi Chen & Zhaodong Wang & Yanfeng Ouyang & Kamalesh Somani & Jing Huang, 2016. "Integrated Planning for Multiple Types of Locomotive Work Facilities Under Location, Routing, and Inventory Considerations," Interfaces, INFORMS, vol. 46(5), pages 391-408, October.
  54. Laura Bitomsky & Olga Bürger & Björn Häckel & Jannick Töppel, 2020. "Value of data meets IT security – assessing IT security risks in data-driven value chains," Electronic Markets, Springer;IIM University of St. Gallen, vol. 30(3), pages 589-605, September.
  55. Müller, Juliane, 2010. "Approximative solutions to the bicriterion Vehicle Routing Problem with Time Windows," European Journal of Operational Research, Elsevier, vol. 202(1), pages 223-231, April.
  56. Dollevoet, T.A.B. & Pecin, D. & Spliet, R., 2020. "The path programming problem and a partial path relaxation," Econometric Institute Research Papers EI-2020-04, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
  57. Weijun Xie & Yanfeng Ouyang & Sze Chun Wong, 2016. "Reliable Location-Routing Design Under Probabilistic Facility Disruptions," Transportation Science, INFORMS, vol. 50(3), pages 1128-1138, August.
  58. Song, Jiongjiong & Regan, Amelia, 2005. "Approximation algorithms for the bid construction problem in combinatorial auctions for the procurement of freight transportation contracts," Transportation Research Part B: Methodological, Elsevier, vol. 39(10), pages 914-933, December.
  59. de Lima, Vinícius L. & Alves, Cláudio & Clautiaux, François & Iori, Manuel & Valério de Carvalho, José M., 2022. "Arc flow formulations based on dynamic programming: Theoretical foundations and applications," European Journal of Operational Research, Elsevier, vol. 296(1), pages 3-21.
  60. Issmail Elhallaoui & Daniel Villeneuve & François Soumis & Guy Desaulniers, 2005. "Dynamic Aggregation of Set-Partitioning Constraints in Column Generation," Operations Research, INFORMS, vol. 53(4), pages 632-645, August.
  61. G Ioannou & M N Kritikos, 2004. "A synthesis of assignment and heuristic solutions for vehicle routing with time windows," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(1), pages 2-11, January.
  62. Remy Spliet & Adriana F. Gabor, 2015. "The Time Window Assignment Vehicle Routing Problem," Transportation Science, INFORMS, vol. 49(4), pages 721-731, November.
  63. Dayarian, Iman & Crainic, Teodor Gabriel & Gendreau, Michel & Rei, Walter, 2015. "A column generation approach for a multi-attribute vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 241(3), pages 888-906.
  64. Stefan Irnich & Daniel Villeneuve, 2006. "The Shortest-Path Problem with Resource Constraints and k -Cycle Elimination for k (ge) 3," INFORMS Journal on Computing, INFORMS, vol. 18(3), pages 391-406, August.
  65. Tan, K.C. & Chew, Y.H. & Lee, L.H., 2006. "A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 172(3), pages 855-885, August.
  66. 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.
  67. Omid Shahvari & Rasaratnam Logendran & Madjid Tavana, 2022. "An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems," Journal of Scheduling, Springer, vol. 25(5), pages 589-621, October.
  68. Marco E. Lübbecke & Jacques Desrosiers, 2005. "Selected Topics in Column Generation," Operations Research, INFORMS, vol. 53(6), pages 1007-1023, December.
  69. Vicky Mak & Andreas Ernst, 2007. "New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 66(1), pages 69-98, August.
  70. Yuri N. Levchuk & Krishna R. Pattipati & David L. Kleinman, 1999. "Analytic model driven organizational design and experimentation in adaptive command and control," Systems Engineering, John Wiley & Sons, vol. 2(2), pages 78-107.
  71. Gondzio, Jacek & González-Brevis, Pablo & Munari, Pedro, 2013. "New developments in the primal–dual column generation technique," European Journal of Operational Research, Elsevier, vol. 224(1), pages 41-51.
  72. Chang, Tsung-Sheng & Wan, Yat-wah & OOI, Wei Tsang, 2009. "A stochastic dynamic traveling salesman problem with hard time windows," European Journal of Operational Research, Elsevier, vol. 198(3), pages 748-759, November.
  73. 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.
  74. 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.
  75. 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.
  76. Gamermann, Ronaldo W. & Ferreira, Luciano & Borenstein, Denis, 2023. "Long-term audit staff scheduling and planning: A case study of Brazilian civil aviation authority," Journal of Air Transport Management, Elsevier, vol. 106(C).
  77. Zongfeng Zou & Shuangping Kang, 2024. "Route Optimization for Hazardous Chemicals Transportation under Time-Varying Conditions," Sustainability, MDPI, vol. 16(2), pages 1-24, January.
  78. Xiaoqing Sun & Manish Garg & Zahir Balaporia & Kendall Bailey & Ted Gifford, 2014. "Optimizing Transportation by Inventory Routing and Workload Balancing: Optimizing Daily Dray Operations Across an Intermodal Freight Network," Interfaces, INFORMS, vol. 44(6), pages 579-590, December.
  79. Wanpracha Chaovalitwongse & Dukwon Kim & Panos M. Pardalos, 2003. "GRASP with a New Local Search Scheme for Vehicle Routing Problems with Time Windows," Journal of Combinatorial Optimization, Springer, vol. 7(2), pages 179-207, June.
  80. 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.
  81. Yin, Yunqiang & Yang, Yongjian & Yu, Yugang & Wang, Dujuan & Cheng, T.C.E., 2023. "Robust vehicle routing with drones under uncertain demands and truck travel times in humanitarian logistics," Transportation Research Part B: Methodological, Elsevier, vol. 174(C).
  82. Rosemary T. Berger & Collette R. Coullard & Mark S. Daskin, 2007. "Location-Routing Problems with Distance Constraints," Transportation Science, INFORMS, vol. 41(1), pages 29-43, February.
  83. Chung‐Yee Lee & Zhi‐Long Chen, 2000. "Scheduling jobs and maintenance activities on parallel machines," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(2), pages 145-165, March.
  84. 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.
  85. Dillmann, Roland & Becker, Burkhard & Beckefeld, Volker, 1996. "Practical aspects of route planning for magazine and newspaper wholesalers," European Journal of Operational Research, Elsevier, vol. 90(1), pages 1-12, April.
  86. Jinxin Yi, 2003. "Vehicle Routing with Time Windows and Time-Dependent Rewards: A Problem from the American Red Cross," Manufacturing & Service Operations Management, INFORMS, vol. 5(1), pages 74-77.
  87. Martin Wölck & Stephan Meisel, 2022. "Branch-and-Price Approaches for Real-Time Vehicle Routing with Picking, Loading, and Soft Time Windows," INFORMS Journal on Computing, INFORMS, vol. 34(4), pages 2192-2211, July.
  88. Guy Desaulniers & Diego Pecin & Claudio Contardo, 2019. "Selective pricing in branch-price-and-cut algorithms for vehicle routing," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(2), pages 147-168, June.
  89. Nanry, William P. & Wesley Barnes, J., 2000. "Solving the pickup and delivery problem with time windows using reactive tabu search," Transportation Research Part B: Methodological, Elsevier, vol. 34(2), pages 107-121, February.
  90. Djamal Habet & Michel Vasquez & Yannick Vimont, 2010. "Bounding the optimum for the problem of scheduling the photographs of an Agile Earth Observing Satellite," Computational Optimization and Applications, Springer, vol. 47(2), pages 307-333, October.
  91. Range, Troels Martin & Lusby, Richard Martin & Larsen, Jesper, 2013. "Solving the selective multi-category parallel-servicing problem," Discussion Papers on Economics 5/2013, University of Southern Denmark, Department of Economics.
  92. Range, Troels Martin & Kozlowski, Dawid & Petersen, Niels Chr., 2017. "A shortest-path-based approach for the stochastic knapsack problem with non-decreasing expected overfilling costs," Discussion Papers on Economics 9/2017, University of Southern Denmark, Department of Economics.
  93. Stephan Westphal & Sven Krumke, 2008. "Pruning in column generation for service vehicle dispatching," Annals of Operations Research, Springer, vol. 159(1), pages 355-371, March.
  94. Claudio Contardo & Jean-François Cordeau & Bernard Gendron, 2014. "An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem," INFORMS Journal on Computing, INFORMS, vol. 26(1), pages 88-102, February.
  95. Felix Prause & Gunnar Prause & Robert Philipp, 2022. "Inventory Routing for Ammonia Supply in German Ports," Energies, MDPI, vol. 15(17), pages 1-22, September.
  96. Lau, Hoong Chuin & Sim, Melvyn & Teo, Kwong Meng, 2003. "Vehicle routing problem with time windows and a limited number of vehicles," European Journal of Operational Research, Elsevier, vol. 148(3), pages 559-569, August.
  97. Xiaofei Kou & Yanqi Zhang & Die Long & Xuanyu Liu & Liangliang Qie, 2022. "An Investigation of Multimodal Transport for Last Mile Delivery in Rural Areas," Sustainability, MDPI, vol. 14(3), pages 1-15, January.
  98. Li, Haibing & Lim, Andrew, 2003. "Local search with annealing-like restarts to solve the VRPTW," European Journal of Operational Research, Elsevier, vol. 150(1), pages 115-127, October.
  99. Lu, Wei & Quadrifoglio, Luca, 2019. "Fair cost allocation for ridesharing services – modeling, mathematical programming and an algorithm to find the nucleolus," Transportation Research Part B: Methodological, Elsevier, vol. 121(C), pages 41-55.
  100. Hernandez, Florent & Feillet, Dominique & Giroudeau, Rodolphe & Naud, Olivier, 2016. "Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 249(2), pages 551-559.
  101. Spliet, R. & Gabor, A.F., 2012. "The Time Window Assignment Vehicle Routing Problem," Econometric Institute Research Papers EI 2012-07, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
  102. Degraeve, Z. & Jans, R.F., 2003. "A New Dantzig-Wolfe Reformulation And Branch-And-Price Algorithm For The Capacitated Lot Sizing Problem With Set Up Times," ERIM Report Series Research in Management ERS-2003-010-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.
  103. Zhang, Zhe & Gong, Xue & Song, Xiaoling & Yin, Yong & Lev, Benjamin & Chen, Jie, 2022. "A column generation-based exact solution method for seru scheduling problems," Omega, Elsevier, vol. 108(C).
  104. Noah Gans & Garrett van Ryzin, 1999. "Dynamic Vehicle Dispatching: Optimal Heavy Traffic Performance and Practical Insights," Operations Research, INFORMS, vol. 47(5), pages 675-692, October.
  105. Emilio Zamorano & Annika Becker & Raik Stolletz, 2018. "Task assignment with start time-dependent processing times for personnel at check-in counters," Journal of Scheduling, Springer, vol. 21(1), pages 93-109, February.
  106. Niu, Huimin & Zhou, Xuesong & Tian, Xiaopeng, 2018. "Coordinating assignment and routing decisions in transit vehicle schedules: A variable-splitting Lagrangian decomposition approach for solution symmetry breaking," Transportation Research Part B: Methodological, Elsevier, vol. 107(C), pages 70-101.
  107. Said Dabia & Stefan Ropke & Tom van Woensel, 2019. "Cover Inequalities for a Vehicle Routing Problem with Time Windows and Shifts," Transportation Science, INFORMS, vol. 53(5), pages 1354-1371, September.
  108. Ozbaygin, Gizem & Ekin Karasan, Oya & Savelsbergh, Martin & Yaman, Hande, 2017. "A branch-and-price algorithm for the vehicle routing problem with roaming delivery locations," Transportation Research Part B: Methodological, Elsevier, vol. 100(C), pages 115-137.
  109. Lysgaard, Jens, 2006. "Reachability cuts for the vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 175(1), pages 210-223, November.
  110. 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.
  111. Nan Kong & Andrew J. Schaefer & Brady Hunsaker & Mark S. Roberts, 2010. "Maximizing the Efficiency of the U.S. Liver Allocation System Through Region Design," Management Science, INFORMS, vol. 56(12), pages 2111-2122, December.
  112. A Ghanmi, 2011. "Canadian forces global reach support hubs: facility location and aircraft routing models," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(4), pages 638-650, April.
  113. 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.
  114. Said Dabia & Stefan Ropke & Tom van Woensel & Ton De Kok, 2013. "Branch and Price for the Time-Dependent Vehicle Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 47(3), pages 380-396, August.
  115. Qiuping Ni & Yuanxiang Tang, 2023. "A Bibliometric Visualized Analysis and Classification of Vehicle Routing Problem Research," Sustainability, MDPI, vol. 15(9), pages 1-37, April.
  116. Koorush Ziarati & François Soumis & Jacques Desrosiers & Marius M. Solomon, 1999. "A Branch-First, Cut-Second Approach for Locomotive Assignment," Management Science, INFORMS, vol. 45(8), pages 1156-1168, August.
  117. Farshad Majzoubi & Lihui Bai & Sunderesh S. Heragu, 2021. "The EMS vehicle patient transportation problem during a demand surge," Journal of Global Optimization, Springer, vol. 79(4), pages 989-1006, April.
  118. Cortés, Cristián E. & Gendreau, Michel & Rousseau, Louis Martin & Souyris, Sebastián & Weintraub, Andrés, 2014. "Branch-and-price and constraint programming for solving a real-life technician dispatching problem," European Journal of Operational Research, Elsevier, vol. 238(1), pages 300-312.
  119. Sarac, Abdulkadir & Batta, Rajan & Rump, Christopher M., 2006. "A branch-and-price approach for operational aircraft maintenance routing," European Journal of Operational Research, Elsevier, vol. 175(3), pages 1850-1869, December.
  120. 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.
  121. Tilk, Christian & Rothenbächer, Ann-Kathrin & Gschwind, Timo & Irnich, Stefan, 2017. "Asymmetry matters: Dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster," European Journal of Operational Research, Elsevier, vol. 261(2), pages 530-539.
  122. Christian Tilk & Ann-Kathrin Rothenbächer & Timo Gschwind & Stefan Irnich, 2016. "Asymmetry Helps: Dynamic Half-Way Points for Solving Shortest Path Problems with Resource Constraints Faster," Working Papers 1615, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
  123. Sundararajan Arunapuram & Kamlesh Mathur & Daniel Solow, 2003. "Vehicle Routing and Scheduling with Full Truckloads," Transportation Science, INFORMS, vol. 37(2), pages 170-182, May.
  124. Michel Gamache & François Soumis & Gérald Marquis & Jacques Desrosiers, 1999. "A Column Generation Approach for Large-Scale Aircrew Rostering Problems," Operations Research, INFORMS, vol. 47(2), pages 247-263, April.
  125. Heungjo An & Young-Ji Byon & Chung-Suk Cho, 2018. "Economic and Environmental Evaluation of a Brick Delivery System Based on Multi-Trip Vehicle Loader Routing Problem for Small Construction Sites," Sustainability, MDPI, vol. 10(5), pages 1-14, May.
  126. Lixing Wang & Zhenning Wu & Changyong Cao, 2021. "Integrated Optimization of Routing and Energy Management for Electric Vehicles in Delivery Scheduling," Energies, MDPI, vol. 14(6), pages 1-17, March.
  127. C S Sung & W Yang, 2008. "An exact algorithm for a cross-docking supply chain network design problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(1), pages 119-136, January.
  128. Marjan van den Akker & Han Hoogeveen & Steef van de Velde, 2002. "Combining Column Generation and Lagrangean Relaxation to Solve a Single-Machine Common Due Date Problem," INFORMS Journal on Computing, INFORMS, vol. 14(1), pages 37-51, February.
  129. Dessouky, Maged & Mahtab, Zuhayer, 2022. "The Ridesharing Routing Problem with Flexible Pickup and Drop-off Points," Institute of Transportation Studies, Working Paper Series qt3107w642, Institute of Transportation Studies, UC Davis.
  130. Lysgaard, Jens, 2004. "Reachability cuts for the vehicle routing problem with time windows," CORAL Working Papers L-2004-01, University of Aarhus, Aarhus School of Business, Department of Business Studies.
  131. Mauro Dell’Amico & Giovanni Righini & Matteo Salani, 2006. "A Branch-and-Price Approach to the Vehicle Routing Problem with Simultaneous Distribution and Collection," Transportation Science, INFORMS, vol. 40(2), pages 235-247, May.
  132. Boland, N. L. & Clarke, L. W. & Nemhauser, G. L., 2000. "The asymmetric traveling salesman problem with replenishment arcs," European Journal of Operational Research, Elsevier, vol. 123(2), pages 408-427, June.
  133. G W Kinney & R R Hill & J T Moore, 2005. "Devising a quick-running heuristic for an unmanned aerial vehicle (UAV) routing system," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(7), pages 776-786, July.
  134. Jonathan F. Bard & George Kontoravdis & Gang Yu, 2002. "A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 36(2), pages 250-269, May.
  135. 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.
  136. Stefan Irnich & Guy Desaulniers & Jacques Desrosiers & Ahmed Hadjar, 2010. "Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling," INFORMS Journal on Computing, INFORMS, vol. 22(2), pages 297-313, May.
  137. Mads Jepsen & Bjørn Petersen & Simon Spoorendonk & David Pisinger, 2008. "Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows," Operations Research, INFORMS, vol. 56(2), pages 497-511, April.
  138. Range, Troels Martin, 2013. "Exploiting Set-Based Structures to Accelerate Dynamic Programming Algorithms for the Elementary Shortest Path Problem with Resource Constraints," Discussion Papers on Economics 17/2013, University of Southern Denmark, Department of Economics.
  139. Asvin Goel & Stefan Irnich, 2017. "An Exact Method for Vehicle Routing and Truck Driver Scheduling Problems," Transportation Science, INFORMS, vol. 51(2), pages 737-754, May.
  140. Šedivý Josef & Čejka Jiří & Guchenko Mykola, 2020. "Possible Application of Solver Optimization Module for Solving Single-circuit Transport Problems," LOGI – Scientific Journal on Transport and Logistics, Sciendo, vol. 11(1), pages 78-87, May.
  141. Pereira Lopes, Manuel J. & de Carvalho, J.M. Valerio, 2007. "A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1508-1527, February.
  142. J. Arturo Castillo-Salazar & Dario Landa-Silva & Rong Qu, 2016. "Workforce scheduling and routing problems: literature survey and computational study," Annals of Operations Research, Springer, vol. 239(1), pages 39-67, April.
  143. Dondo, Rodolfo & Cerda, Jaime, 2007. "A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1478-1507, February.
  144. Spliet, Remy & Desaulniers, Guy, 2015. "The discrete time window assignment vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 244(2), pages 379-391.
  145. Boschetti, Marco Antonio & Maniezzo, Vittorio & Strappaveccia, Francesco, 2017. "Route relaxations on GPU for vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 258(2), pages 456-466.
  146. Jeffrey W. Ohlmann & Michael J. Fry & Barrett W. Thomas, 2008. "Route Design for Lean Production Systems," Transportation Science, INFORMS, vol. 42(3), pages 352-370, August.
  147. Theodore Athanasopoulos & Ioannis Minis, 2013. "Efficient techniques for the multi-period vehicle routing problem with time windows within a branch and price framework," Annals of Operations Research, Springer, vol. 206(1), pages 1-22, July.
  148. Said Dabia & David Lai & Daniele Vigo, 2019. "An Exact Algorithm for a Rich Vehicle Routing Problem with Private Fleet and Common Carrier," Transportation Science, INFORMS, vol. 53(4), pages 986-1000, July.
  149. 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.
  150. Zografos, Konstantinos G. & Androutsopoulos, Konstantinos N., 2004. "A heuristic algorithm for solving hazardous materials distribution problems," European Journal of Operational Research, Elsevier, vol. 152(2), pages 507-519, January.
  151. Malmborg, Charles J., 1996. "A genetic algorithm for service level based vehicle scheduling," European Journal of Operational Research, Elsevier, vol. 93(1), pages 121-134, August.
  152. Jans, Raf, 2010. "Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems," European Journal of Operational Research, Elsevier, vol. 204(2), pages 251-254, July.
  153. Yen‐Liang Chen & Kwei Tang, 2005. "Finding the Kth shortest path in a time‐schedule network," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(1), pages 93-102, February.
  154. 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.
  155. Hoogendoorn, Y.N. & Dalmeijer, K., 2021. "Resource-robust valid inequalities for set covering and set partitioning models," Econometric Institute Research Papers EI 2020-08, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
  156. Michel Gendreau & Alain Hertz & Gilbert Laporte & Mihnea Stan, 1998. "A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows," Operations Research, INFORMS, vol. 46(3), pages 330-335, June.
  157. Liu, Shixin & Qin, Shujin & Zhang, Ruiyou, 2018. "A branch-and-price algorithm for the multi-trip multi-repairman problem with time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 116(C), pages 25-41.
  158. Nico Dellaert & Fardin Dashty Saridarq & Tom Van Woensel & Teodor Gabriel Crainic, 2019. "Branch-and-Price–Based Algorithms for the Two-Echelon Vehicle Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 53(2), pages 463-479, March.
  159. Anantaram Balakrishnan & François Vanderbeck, 1999. "A Tactical Planning Model for Mixed-Model Electronics Assembly Operations," Operations Research, INFORMS, vol. 47(3), pages 395-409, June.
  160. Francis, Peter & Zhang, Guangming & Smilowitz, Karen, 2007. "Improved modeling and solution methods for the multi-resource routing problem," European Journal of Operational Research, Elsevier, vol. 180(3), pages 1045-1059, August.
  161. Leonardo Lozano & Daniel Duque & Andrés L. Medaglia, 2016. "An Exact Algorithm for the Elementary Shortest Path Problem with Resource Constraints," Transportation Science, INFORMS, vol. 50(1), pages 348-357, February.
  162. 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.
  163. 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.
  164. Taş, D. & Gendreau, M. & Dellaert, N. & van Woensel, T. & de Kok, A.G., 2014. "Vehicle routing with soft time windows and stochastic travel times: A column generation and branch-and-price solution approach," European Journal of Operational Research, Elsevier, vol. 236(3), pages 789-799.
  165. 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.
  166. Diego Pecin & Claudio Contardo & Guy Desaulniers & Eduardo Uchoa, 2017. "New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows," INFORMS Journal on Computing, INFORMS, vol. 29(3), pages 489-502, August.
  167. Shyam S. G. Perumal & Jesper Larsen & Richard M. Lusby & Morten Riis & Tue R. L. Christensen, 2022. "A column generation approach for the driver scheduling problem with staff cars," Public Transport, Springer, vol. 14(3), pages 705-738, October.
  168. 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.
  169. Luigi Di Puglia Pugliese & Francesca Guerriero, 2016. "On the shortest path problem with negative cost cycles," Computational Optimization and Applications, Springer, vol. 63(2), pages 559-583, March.
  170. 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.
  171. Chen, Zhi-Long & Powell, Warren B., 1999. "A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem," European Journal of Operational Research, Elsevier, vol. 116(1), pages 220-232, July.
  172. Zamorano, Emilio & Stolletz, Raik, 2017. "Branch-and-price approaches for the Multiperiod Technician Routing and Scheduling Problem," European Journal of Operational Research, Elsevier, vol. 257(1), pages 55-68.
  173. 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.
  174. Jee Eun Kang & Will Recker, 2015. "Strategic Hydrogen Refueling Station Locations with Scheduling and Routing Considerations of Individual Vehicles," Transportation Science, INFORMS, vol. 49(4), pages 767-783, November.
  175. Lee, C.Y. & Cetinkaya, S. & Wagelmans, A.P.M., 1999. "A dynamic lot-sizing model with demand time windows," Econometric Institute Research Papers EI 9948-/A, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
  176. Xuhong Cai & Li Jiang & Songhu Guo & Hejiao Huang & Hongwei Du, 2022. "TLHSA and SACA: two heuristic algorithms for two variant VRP models," Journal of Combinatorial Optimization, Springer, vol. 44(4), pages 2996-3022, November.
  177. Chris Groër & Bruce Golden & Edward Wasil, 2011. "A Parallel Algorithm for the Vehicle Routing Problem," INFORMS Journal on Computing, INFORMS, vol. 23(2), pages 315-330, May.
  178. 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.
  179. Lu, Da & Gzara, Fatma, 2019. "The robust vehicle routing problem with time windows: Solution by branch and price and cut," European Journal of Operational Research, Elsevier, vol. 275(3), pages 925-938.
  180. Andrew Allman & Qi Zhang, 2021. "Branch-and-price for a class of nonconvex mixed-integer nonlinear programs," Journal of Global Optimization, Springer, vol. 81(4), pages 861-880, December.
  181. Calvete, Herminia I. & Gale, Carmen & Oliveros, Maria-Jose & Sanchez-Valverde, Belen, 2007. "A goal programming approach to vehicle routing problems with soft time windows," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1720-1733, March.
  182. Roberto Baldacci & Aristide Mingozzi & Roberto Roberti, 2011. "New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem," Operations Research, INFORMS, vol. 59(5), pages 1269-1283, October.
  183. Baozhen Yao & Qianqian Yan & Mengjie Zhang & Yunong Yang, 2017. "Improved artificial bee colony algorithm for vehicle routing problem with time windows," PLOS ONE, Public Library of Science, vol. 12(9), pages 1-18, September.
  184. Song, Jiongjiong & Regan, A C, 2003. "Approximation Algorithms for the Bid Construction Problem in Combinatorial Auctions for the Procurement of Freight Transportation Contracts," University of California Transportation Center, Working Papers qt3j7034z2, University of California Transportation Center.
  185. 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.
  186. Stefan Ropke & Jean-François Cordeau, 2009. "Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows," Transportation Science, INFORMS, vol. 43(3), pages 267-286, August.
  187. 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).
  188. Mirela Stojković & François Soumis & Jacques Desrosiers, 1998. "The Operational Airline Crew Scheduling Problem," Transportation Science, INFORMS, vol. 32(3), pages 232-245, August.
  189. P. Kabcome & T. Mouktonglang, 2015. "Vehicle Routing Problem for Multiple Product Types, Compartments, and Trips with Soft Time Windows," International Journal of Mathematics and Mathematical Sciences, Hindawi, vol. 2015, pages 1-9, July.
  190. Zhi-Long Chen & Hang Xu, 2006. "Dynamic Column Generation for Dynamic Vehicle Routing with Time Windows," Transportation Science, INFORMS, vol. 40(1), pages 74-88, February.
  191. Vis, Iris F.A., 2006. "Survey of research in the design and control of automated guided vehicle systems," European Journal of Operational Research, Elsevier, vol. 170(3), pages 677-709, May.
  192. 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.
  193. Niklas Kohl & Jacques Desrosiers & Oli B. G. Madsen & Marius M. Solomon & François Soumis, 1999. "2-Path Cuts for the Vehicle Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 33(1), pages 101-116, February.
  194. Davis, Lauren B. & Sengul, Irem & Ivy, Julie S. & Brock, Luther G. & Miles, Lastella, 2014. "Scheduling food bank collections and deliveries to ensure food safety and improve access," Socio-Economic Planning Sciences, Elsevier, vol. 48(3), pages 175-188.
  195. Yao, Yu & Zhu, Xiaoning & Dong, Hongyu & Wu, Shengnan & Wu, Hailong & Carol Tong, Lu & Zhou, Xuesong, 2019. "ADMM-based problem decomposition scheme for vehicle routing problem with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 129(C), pages 156-174.
  196. Leggieri, Valeria & Haouari, Mohamed, 2017. "Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 263(3), pages 755-767.
  197. Luigi Di Puglia Pugliese & Francesca Guerriero, 2012. "A computational study of solution approaches for the resource constrained elementary shortest path problem," Annals of Operations Research, Springer, vol. 201(1), pages 131-157, December.
  198. Qinxiao Yu & Chun Cheng & Ning Zhu, 2022. "Robust Team Orienteering Problem with Decreasing Profits," INFORMS Journal on Computing, INFORMS, vol. 34(6), pages 3215-3233, November.
  199. Abdelouahab Zaghrouti & Issmail El Hallaoui & François Soumis, 2020. "Improving set partitioning problem solutions by zooming around an improving direction," Annals of Operations Research, Springer, vol. 284(2), pages 645-671, January.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.