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

A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem

Citations

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


Cited by:

  1. Christian Pfeiffer & Arne Schulz, 2022. "An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(1), pages 87-119, March.
  2. Bouman, P.C. & Agatz, N.A.H. & Schmidt, M.E., 2017. "Dynamic Programming Approaches for the Traveling Salesman Problem with Drone," ERIM Report Series Research in Management ERS-2017-011-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.
  3. Andres Figliozzi, Miguel, 2012. "The time dependent vehicle routing problem with time windows: Benchmark problems, an efficient solution algorithm, and solution characteristics," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(3), pages 616-636.
  4. Rifki, Omar & Chiabaut, Nicolas & Solnon, Christine, 2020. "On the impact of spatio-temporal granularity of traffic conditions on the quality of pickup and delivery optimal tours," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 142(C).
  5. Van Woensel, T. & Kerbache, L. & Peremans, H. & Vandaele, N., 2008. "Vehicle routing with dynamic travel times: A queueing approach," European Journal of Operational Research, Elsevier, vol. 186(3), pages 990-1007, May.
  6. 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.
  7. Huang, Yixiao & Zhao, Lei & Van Woensel, Tom & Gross, Jean-Philippe, 2017. "Time-dependent vehicle routing problem with path flexibility," Transportation Research Part B: Methodological, Elsevier, vol. 95(C), pages 169-195.
  8. KERBACHE, Laoucine & VAN WOENSEL, Tom, 2004. "Planning and Scheduling Transportation Vehicle Fleet in a Congested Traffic Environment," HEC Research Papers Series 803, HEC Paris.
  9. Maskooki, Alaleh & Kallio, Markku, 2023. "A bi-criteria moving-target travelling salesman problem under uncertainty," European Journal of Operational Research, Elsevier, vol. 309(1), pages 271-285.
  10. A. L. Kok & C. M. Meyer & H. Kopfer & J. M. J. Schutten, 2010. "A Dynamic Programming Heuristic for the Vehicle Routing Problem with Time Windows and European Community Social Legislation," Transportation Science, INFORMS, vol. 44(4), pages 442-454, November.
  11. Furini, Fabio & Persiani, Carlo Alfredo & Toth, Paolo, 2016. "The Time Dependent Traveling Salesman Planning Problem in Controlled Airspace," Transportation Research Part B: Methodological, Elsevier, vol. 90(C), pages 38-55.
  12. Hoorn, J.J. van, 2010. "A note on the worst case complexity for the capacitated vehicle routing problem," Serie Research Memoranda 0005, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.
  13. Tao Zhang & W. Art Chaovalitwongse & Yuejie Zhang, 2014. "Integrated Ant Colony and Tabu Search approach for time dependent vehicle routing problems with simultaneous pickup and delivery," Journal of Combinatorial Optimization, Springer, vol. 28(1), pages 288-309, July.
  14. Tikani, Hamid & Setak, Mostafa & Demir, Emrah, 2021. "A risk-constrained time-dependent cash-in-transit routing problem in multigraph under uncertainty," European Journal of Operational Research, Elsevier, vol. 293(2), pages 703-730.
  15. LIAN, Ying & LUCAS, Flavien & SÖRENSEN, Kenneth, 2022. "The on-demand bus routing problem with real-time traffic information," Working Papers 2022003, University of Antwerp, Faculty of Business and Economics.
  16. Ulrike Ritzinger & Jakob Puchinger & Richard F. Hartl, 2016. "Dynamic programming based metaheuristics for the dial-a-ride problem," Annals of Operations Research, Springer, vol. 236(2), pages 341-358, January.
  17. Güner, Ali R. & Murat, Alper & Chinnam, Ratna Babu, 2017. "Dynamic routing for milk-run tours with time windows in stochastic time-dependent networks," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 97(C), pages 251-267.
  18. 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.
  19. Ulrike Ritzinger & Jakob Puchinger & Richard Hartl, 2016. "Dynamic programming based metaheuristics for the dial-a-ride problem," Annals of Operations Research, Springer, vol. 236(2), pages 341-358, January.
  20. Ichoua, Soumia & Gendreau, Michel & Potvin, Jean-Yves, 2003. "Vehicle dispatching with time-dependent travel times," European Journal of Operational Research, Elsevier, vol. 144(2), pages 379-396, January.
  21. Liu, Yiming & Roberto, Baldacci & Zhou, Jianwen & Yu, Yang & Zhang, Yu & Sun, Wei, 2023. "Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 310(1), pages 133-155.
  22. Jean-François Cordeau & Gianpaolo Ghiani & Emanuela Guerriero, 2014. "Analysis and Branch-and-Cut Algorithm for the Time-Dependent Travelling Salesman Problem," Transportation Science, INFORMS, vol. 48(1), pages 46-58, February.
  23. Fontaine, Romain & Dibangoye, Jilles & Solnon, Christine, 2023. "Exact and anytime approach for solving the time dependent traveling salesman problem with time windows," European Journal of Operational Research, Elsevier, vol. 311(3), pages 833-844.
  24. Daqing Wu & Chenxiang Wu, 2022. "Research on the Time-Dependent Split Delivery Green Vehicle Routing Problem for Fresh Agricultural Products with Multiple Time Windows," Agriculture, MDPI, vol. 12(6), pages 1-28, May.
  25. Ampol Karoonsoontawong & Puntipa Punyim & Wanvara Nueangnitnaraporn & Vatanavongs Ratanavaraha, 2020. "Multi-Trip Time-Dependent Vehicle Routing Problem with Soft Time Windows and Overtime Constraints," Networks and Spatial Economics, Springer, vol. 20(2), pages 549-598, June.
  26. Salii, Yaroslav, 2019. "Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization," European Journal of Operational Research, Elsevier, vol. 272(1), pages 32-42.
  27. Albiach, José & Sanchis, José Marí­a & Soler, David, 2008. "An asymmetric TSP with time windows and with time-dependent travel times and costs: An exact solution through a graph transformation," European Journal of Operational Research, Elsevier, vol. 189(3), pages 789-802, September.
  28. Xiao, Yiyong & Konak, Abdullah, 2016. "The heterogeneous green vehicle routing and scheduling problem with time-varying traffic congestion," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 88(C), pages 146-166.
  29. 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.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.