IDEAS home Printed from https://ideas.repec.org/r/eee/ejores/v35y1988i2p242-254.html
   My bibliography  Save this item

A reoptimization algorithm for the shortest path problem with time windows

Citations

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


Cited by:

  1. Ahmadi-Javid, Amir & Amiri, Elahe & Meskar, Mahla, 2018. "A Profit-Maximization Location-Routing-Pricing Problem: A Branch-and-Price Algorithm," European Journal of Operational Research, Elsevier, vol. 271(3), pages 866-881.
  2. Elisabeth Lübbecke & Marco E. Lübbecke & Rolf H. Möhring, 2019. "Ship Traffic Optimization for the Kiel Canal," Operations Research, INFORMS, vol. 67(3), pages 791-812, May.
  3. Iman Dayarian & Guy Desaulniers, 2019. "A Branch-Price-and-Cut Algorithm for a Production-Routing Problem with Short-Life-Span Products," Transportation Science, INFORMS, vol. 53(3), pages 829-849, May.
  4. Yang, Baiyu & Miller-Hooks, Elise, 2004. "Adaptive routing considering delays due to signal operations," Transportation Research Part B: Methodological, Elsevier, vol. 38(5), pages 385-413, June.
  5. 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.
  6. Le-Anh, T. & de Koster, M.B.M., 2004. "Real-Time Scheduling Approaches for Vehicle-Based Internal Transport Systems," ERIM Report Series Research in Management ERS-2004-056-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.
  7. Ponboon, Sattrawut & Qureshi, Ali Gul & Taniguchi, Eiichi, 2016. "Branch-and-price algorithm for the location-routing problem with time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 86(C), pages 1-19.
  8. Ishwar Murthy & Sumit Sarkar, 1998. "Stochastic Shortest Path Problems with Piecewise-Linear Concave Utility Functions," Management Science, INFORMS, vol. 44(11-Part-2), pages 125-136, November.
  9. Belanger, Nicolas & Desaulniers, Guy & Soumis, Francois & Desrosiers, Jacques, 2006. "Periodic airline fleet assignment with time windows, spacing constraints, and time dependent revenues," European Journal of Operational Research, Elsevier, vol. 175(3), pages 1754-1766, December.
  10. L. Di Puglia Pugliese & D. Ferone & P. Festa & F. Guerriero, 2022. "A generalized shortest path tour problem with time windows," Computational Optimization and Applications, Springer, vol. 83(2), pages 593-614, November.
  11. Paul A. Chircop & Timothy J. Surendonk & Menkes H. L. van den Briel & Toby Walsh, 2022. "On routing and scheduling a fleet of resource-constrained vessels to provide ongoing continuous patrol coverage," Annals of Operations Research, Springer, vol. 312(2), pages 723-760, May.
  12. Mikkel Sigurd & David Pisinger & Michael Sig, 2004. "Scheduling Transportation of Live Animals to Avoid the Spread of Diseases," Transportation Science, INFORMS, vol. 38(2), pages 197-209, May.
  13. 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.
  14. Michelle Dunbar & Gary Froyland & Cheng-Lung Wu, 2012. "Robust Airline Schedule Planning: Minimizing Propagated Delay in an Integrated Routing and Crewing Framework," Transportation Science, INFORMS, vol. 46(2), pages 204-216, May.
  15. 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.
  16. 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.
  17. Babacar Thiongane & Anass Nagih & Gérard Plateau, 2005. "An Adapted Step Size Algorithm for a 0-1 Biknapsack Lagrangean Dual," Annals of Operations Research, Springer, vol. 139(1), pages 353-373, October.
  18. Zeighami, Vahid & Saddoune, Mohammed & Soumis, François, 2020. "Alternating Lagrangian decomposition for integrated airline crew scheduling problem," European Journal of Operational Research, Elsevier, vol. 287(1), pages 211-224.
  19. Ioachim, Irina & Desrosiers, Jacques & Soumis, Francois & Belanger, Nicolas, 1999. "Fleet assignment and routing with schedule synchronization constraints," European Journal of Operational Research, Elsevier, vol. 119(1), pages 75-90, November.
  20. Alexandra Makri & Diego Klabjan, 2004. "A New Pricing Scheme for Airline Crew Scheduling," INFORMS Journal on Computing, INFORMS, vol. 16(1), pages 56-67, February.
  21. Formaneck, Steven D. & Cozzarin, Brian P., 2013. "Technology adoption and training practices as a constrained shortest path problem," Omega, Elsevier, vol. 41(2), pages 459-472.
  22. Ravindra K. Ahuja & James B. Orlin & Stefano Pallottino & Maria Grazia Scutellà, 2002. "Minimum Time and Minimum Cost-Path Problems in Street Networks with Periodic Traffic Lights," Transportation Science, INFORMS, vol. 36(3), pages 326-336, August.
  23. Cynthia Barnhart & Peter Belobaba & Amedeo R. Odoni, 2003. "Applications of Operations Research in the Air Transport Industry," Transportation Science, INFORMS, vol. 37(4), pages 368-391, November.
  24. 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.
  25. 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.
  26. Silke Jütte & Marc Albers & Ulrich W. Thonemann & Knut Haase, 2011. "Optimizing Railway Crew Scheduling at DB Schenker," Interfaces, INFORMS, vol. 41(2), pages 109-122, April.
  27. 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.
  28. Bouarab, Hocine & El Hallaoui, Issmail & Metrane, Abdelmoutalib & Soumis, François, 2017. "Dynamic constraint and variable aggregation in column generation," European Journal of Operational Research, Elsevier, vol. 262(3), pages 835-850.
  29. 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.
  30. Sami Gabteni & Mattias Grönkvist, 2009. "Combining column generation and constraint programming to solve the tail assignment problem," Annals of Operations Research, Springer, vol. 171(1), pages 61-76, October.
  31. Di Puglia Pugliese, Luigi & Guerriero, Francesca, 2013. "Shortest path problem with forbidden paths: The elementary version," European Journal of Operational Research, Elsevier, vol. 227(2), pages 254-267.
  32. Michael Zabarankin & Stan Uryasev & Robert Murphey, 2006. "Aircraft routing under the risk of detection," Naval Research Logistics (NRL), John Wiley & Sons, vol. 53(8), pages 728-747, December.
  33. 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.
  34. Chen, Yen-Liang & Yang, Hsu-Hao, 2003. "Minimization of travel time and weighted number of stops in a traffic-light network," European Journal of Operational Research, Elsevier, vol. 144(3), pages 565-580, February.
  35. Akyüz, M. Hakan & Lee, Chung-Yee, 2016. "Service type assignment and container routing with transit time constraints and empty container repositioning for liner shipping service networks," Transportation Research Part B: Methodological, Elsevier, vol. 88(C), pages 46-71.
  36. Ram Gopalan, 2015. "Computational complexity of convoy movement planning problems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 82(1), pages 31-60, August.
  37. 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.
  38. Y-L Chen & L-J Hsiao & K Tang, 2003. "Time analysis for planning a path in a time-window network," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(8), pages 860-870, August.
  39. Cynthia Barnhart & Amy Cohn, 2004. "Airline Schedule Planning: Accomplishments and Opportunities," Manufacturing & Service Operations Management, INFORMS, vol. 6(1), pages 3-22, November.
  40. Villeneuve, Daniel & Desaulniers, Guy, 2005. "The shortest path problem with forbidden paths," European Journal of Operational Research, Elsevier, vol. 165(1), pages 97-107, August.
  41. 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.
  42. Ziarati, Koorush & Soumis, Francois & Desrosiers, Jacques & Gelinas, Sylvie & Saintonge, Andre, 1997. "Locomotive assignment with heterogeneous consists at CN North America," European Journal of Operational Research, Elsevier, vol. 97(2), pages 281-292, March.
  43. 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.
  44. Xie, Chi & Travis Waller, S., 2012. "Parametric search and problem decomposition for approximating Pareto-optimal paths," Transportation Research Part B: Methodological, Elsevier, vol. 46(8), pages 1043-1067.
  45. Yan, Shangyao & Chang, Jei-Chi, 2002. "Airline cockpit crew scheduling," European Journal of Operational Research, Elsevier, vol. 136(3), pages 501-511, February.
  46. Axel Parmentier, 2019. "Algorithms for non-linear and stochastic resource constrained shortest path," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 89(2), pages 281-317, April.
  47. Luigi Di Puglia Pugliese & Francesca Guerriero, 2013. "A Reference Point Approach for the Resource Constrained Shortest Path Problems," Transportation Science, INFORMS, vol. 47(2), pages 247-265, May.
  48. Charlotte Vilhelmsen & Richard M. Lusby & Jesper Larsen, 2017. "Tramp ship routing and scheduling with voyage separation requirements," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(4), pages 913-943, October.
  49. Nagih, Anass & Soumis, Francois, 2006. "Nodal aggregation of resource constraints in a shortest path problem," European Journal of Operational Research, Elsevier, vol. 172(2), pages 500-514, July.
  50. Rajaei, Maryam & Moslehi, Ghasem & Reisi-Nafchi, Mohammad, 2022. "The split heterogeneous vehicle routing problem with three-dimensional loading constraints on a large scale," European Journal of Operational Research, Elsevier, vol. 299(2), pages 706-721.
  51. Alberto Ceselli & Giovanni Righini & Matteo Salani, 2009. "A Column Generation Algorithm for a Rich Vehicle-Routing Problem," Transportation Science, INFORMS, vol. 43(1), pages 56-69, February.
  52. Ashish K. Nemani & Suat Bog & Ravindra K. Ahuja, 2010. "Solving the Curfew Planning Problem," Transportation Science, INFORMS, vol. 44(4), pages 506-523, November.
  53. Heykel Achour & Michel Gamache & François Soumis & Guy Desaulniers, 2007. "An Exact Solution Approach for the Preferential Bidding System Problem in the Airline Industry," Transportation Science, INFORMS, vol. 41(3), pages 354-365, August.
  54. Desaulniers, Guy & Lavigne, June & Soumis, Francois, 1998. "Multi-depot vehicle scheduling problems with time windows and waiting costs," European Journal of Operational Research, Elsevier, vol. 111(3), pages 479-494, December.
  55. 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.
  56. Christian Rählmann & Ulrich W. Thonemann, 2020. "Railway crew scheduling with semi-flexible timetables," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 42(4), pages 835-862, December.
  57. 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.
  58. 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.
  59. Di Puglia Pugliese, Luigi & Ferone, Daniele & Festa, Paola & Guerriero, Francesca, 2020. "Shortest path tour problem with time windows," European Journal of Operational Research, Elsevier, vol. 282(1), pages 334-344.
  60. Jütte, Silke & Thonemann, Ulrich W., 2012. "Divide-and-price: A decomposition algorithm for solving large railway crew scheduling problems," European Journal of Operational Research, Elsevier, vol. 219(2), pages 214-223.
  61. 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.
  62. Lingaya, Norbert & Cordeau, Jean-Françcois & Desaulniers, Guy & Desrosiers, Jacques & Soumis, Françcois, 2002. "Operational car assignment at VIA Rail Canada," Transportation Research Part B: Methodological, Elsevier, vol. 36(9), pages 755-778, November.
  63. Tang, Jiafu & Yu, Yang & Li, Jia, 2015. "An exact algorithm for the multi-trip vehicle routing and scheduling problem of pickup and delivery of customers to the airport," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 73(C), pages 114-132.
  64. 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.
  65. Moshe Mann & Boaz Zion & Dror Rubinstein & Rafi Linker & Itzhak Shmulevich, 2016. "The Orienteering Problem with Time Windows Applied to Robotic Melon Harvesting," Journal of Optimization Theory and Applications, Springer, vol. 168(1), pages 246-267, January.
  66. Himmich, Ilyas & El Hallaoui, Issmail & Soumis, François, 2024. "A multiphase dynamic programming algorithm for the shortest path problem with resource constraints," European Journal of Operational Research, Elsevier, vol. 315(2), pages 470-483.
  67. Dohn, Anders & Mason, Andrew, 2013. "Branch-and-price for staff rostering: An efficient implementation using generic programming and nested column generation," European Journal of Operational Research, Elsevier, vol. 230(1), pages 157-169.
  68. S. Ardizzoni & L. Consolini & M. Laurini & M. Locatelli, 2022. "Shortest path with acceleration constraints: complexity and approximation algorithms," Computational Optimization and Applications, Springer, vol. 83(2), pages 555-592, November.
  69. Kaj Holmberg & Di Yuan, 2003. "A Multicommodity Network-Flow Problem with Side Constraints on Paths Solved by Column Generation," INFORMS Journal on Computing, INFORMS, vol. 15(1), pages 42-57, February.
  70. Sundararajan Arunapuram & Kamlesh Mathur & Daniel Solow, 2003. "Vehicle Routing and Scheduling with Full Truckloads," Transportation Science, INFORMS, vol. 37(2), pages 170-182, May.
  71. Hatem Ben Amor & Jacques Desrosiers & José Manuel Valério de Carvalho, 2006. "Dual-Optimal Inequalities for Stabilized Column Generation," Operations Research, INFORMS, vol. 54(3), pages 454-463, June.
  72. Frédéric Quesnel & Guy Desaulniers & Frédéric Quesnel, 2020. "Improving Air Crew Rostering by Considering Crew Preferences in the Crew Pairing Problem," Transportation Science, INFORMS, vol. 54(1), pages 97-114, January.
  73. Mohamed Haouari & Farah Zeghal Mansour & Hanif D. Sherali, 2019. "A New Compact Formulation for the Daily Crew Pairing Problem," Transportation Science, INFORMS, vol. 53(3), pages 811-828, May.
  74. 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.
  75. Garaix, Thierry & Artigues, Christian & Feillet, Dominique & Josselin, Didier, 2010. "Vehicle routing problems with alternative paths: An application to on-demand transportation," European Journal of Operational Research, Elsevier, vol. 204(1), pages 62-75, July.
  76. 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.
  77. Marco E. Lübbecke & Uwe T. Zimmermann, 2003. "Engine Routing and Scheduling at Industrial In-Plant Railroads," Transportation Science, INFORMS, vol. 37(2), pages 183-197, May.
  78. Guy Desaulniers & Daniel Villeneuve, 2000. "The Shortest Path Problem with Time Windows and Linear Waiting Costs," Transportation Science, INFORMS, vol. 34(3), pages 312-319, August.
  79. Murthy, Ishwar & Sarkar, Sumit, 1997. "Exact algorithms for the stochastic shortest path problem with a decreasing deadline utility function," European Journal of Operational Research, Elsevier, vol. 103(1), pages 209-229, November.
  80. Le-Anh, T. & de Koster, M.B.M. & Yu, Y., 2006. "Performance Evaluation of Real-time Scheduling Approaches in Vehicle-based Internal Transport Systems," ERIM Report Series Research in Management ERS-2006-063-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.
  81. 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.
  82. Compare, Michele & Bellani, Luca & Zio, Enrico, 2019. "Optimal allocation of prognostics and health management capabilities to improve the reliability of a power transmission network," Reliability Engineering and System Safety, Elsevier, vol. 184(C), pages 164-180.
  83. Ulrich Derigs & Stefan Friederichs & Simon Schäfer, 2009. "A New Approach for Air Cargo Network Planning," Transportation Science, INFORMS, vol. 43(3), pages 370-380, August.
  84. Faramroze G. Engineer & George L. Nemhauser & Martin W. P. Savelsbergh, 2011. "Dynamic Programming-Based Column Generation on Time-Expanded Networks: Application to the Dial-a-Flight Problem," INFORMS Journal on Computing, INFORMS, vol. 23(1), pages 105-119, February.
  85. Paola Cappanera & Maria Grazia Scutellà, 2011. "Color-Coding Algorithms to the Balanced Path Problem: Computational Issues," INFORMS Journal on Computing, INFORMS, vol. 23(3), pages 446-459, August.
  86. Akyüz, M. Hakan & Dekker, Rommert & Sharif Azadeh, Shadi, 2023. "Partial and complete replanning of an intermodal logistic system under disruptions," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 169(C).
  87. 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.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.