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

An Optimal Algorithm for the Traveling Salesman Problem with Time Windows

Citations

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


Cited by:

  1. Letchford, A.N. & Eglese, R.W., 1998. "The rural postman problem with deadline classes," European Journal of Operational Research, Elsevier, vol. 105(3), pages 390-400, March.
  2. 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.
  3. Christian Tilk & Stefan Irnich, 2014. "Dynamic Programming for the Minimum Tour Duration Problem," Working Papers 1408, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz, revised 04 Aug 2014.
  4. Przemysław Kowalik & Grzegorz Sobecki & Piotr Bawoł & Paweł Muzolf, 2023. "A Flow-Based Formulation of the Travelling Salesman Problem with Penalties on Nodes," Sustainability, MDPI, vol. 15(5), pages 1-28, February.
  5. Letchford, Adam N. & Nasiri, Saeideh D. & Theis, Dirk Oliver, 2013. "Compact formulations of the Steiner Traveling Salesman Problem and related problems," European Journal of Operational Research, Elsevier, vol. 228(1), pages 83-92.
  6. 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.
  7. Jozefczyk, Jerzy, 2001. "Scheduling tasks on moving executors to minimise the maximum lateness," European Journal of Operational Research, Elsevier, vol. 131(1), pages 171-187, May.
  8. Vu, Duc Minh & Hewitt, Mike & Vu, Duc D., 2022. "Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery," European Journal of Operational Research, Elsevier, vol. 302(3), pages 831-846.
  9. Kap Hwan Kim & Jong Wook Bae, 2004. "A Look-Ahead Dispatching Method for Automated Guided Vehicles in Automated Port Container Terminals," Transportation Science, INFORMS, vol. 38(2), pages 224-234, May.
  10. Jordan, Carsten & Drexl, Andreas, 1997. "Discrete lotsizing and scheduling by batch sequencing," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 438, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
  11. Kinable, Joris & Cire, Andre A. & van Hoeve, Willem-Jan, 2017. "Hybrid optimization methods for time-dependent sequencing problems," European Journal of Operational Research, Elsevier, vol. 259(3), pages 887-897.
  12. Roberto Baldacci & Aristide Mingozzi & Roberto Roberti, 2012. "New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows," INFORMS Journal on Computing, INFORMS, vol. 24(3), pages 356-371, August.
  13. 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.
  14. Gilles Pesant & Michel Gendreau & Jean-Yves Potvin & Jean-Marc Rousseau, 1998. "An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows," Transportation Science, INFORMS, vol. 32(1), pages 12-29, February.
  15. Dieter, Peter & Caron, Matthew & Schryen, Guido, 2023. "Integrating driver behavior into last-mile delivery routing: Combining machine learning and optimization in a hybrid decision support framework," European Journal of Operational Research, Elsevier, vol. 311(1), pages 283-300.
  16. Barrett W. Thomas, 2007. "Waiting Strategies for Anticipating Service Requests from Known Customer Locations," Transportation Science, INFORMS, vol. 41(3), pages 319-331, August.
  17. Karina Copil & Martin Wörbelauer & Herbert Meyr & Horst Tempelmeier, 2017. "Simultaneous lotsizing and scheduling problems: a classification and review of models," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(1), pages 1-64, January.
  18. Qin, Hu & Zhang, Zizhen & Lim, Andrew & Liang, Xiaocong, 2016. "An enhanced branch-and-bound algorithm for the talent scheduling problem," European Journal of Operational Research, Elsevier, vol. 250(2), pages 412-426.
  19. Hagelauer, Patrick & Mora-Camino, Felix, 1998. "A soft dynamic programming approach for on-line aircraft 4D-trajectory optimization," European Journal of Operational Research, Elsevier, vol. 107(1), pages 87-95, May.
  20. 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.
  21. 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.
  22. Ha-Bang Ban, 2021. "A metaheuristic for the delivery man problem with time windows," Journal of Combinatorial Optimization, Springer, vol. 41(4), pages 794-816, May.
  23. Zhang, Jian & Woensel, Tom Van, 2023. "Dynamic vehicle routing with random requests: A literature review," International Journal of Production Economics, Elsevier, vol. 256(C).
  24. 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.
  25. Defryn, Christof & Sörensen, Kenneth, 2018. "Multi-objective optimisation models for the travelling salesman problem with horizontal cooperation," European Journal of Operational Research, Elsevier, vol. 267(3), pages 891-903.
  26. Andre A. Cire & Willem-Jan van Hoeve, 2013. "Multivalued Decision Diagrams for Sequencing Problems," Operations Research, INFORMS, vol. 61(6), pages 1411-1428, December.
  27. Ann M. Campbell & Barrett W. Thomas, 2008. "Probabilistic Traveling Salesman Problem with Deadlines," Transportation Science, INFORMS, vol. 42(1), pages 1-21, February.
  28. Carsten Jordan & Andreas Drexl, 1998. "Discrete Lotsizing and Scheduling by Batch Sequencing," Management Science, INFORMS, vol. 44(5), pages 698-713, May.
  29. 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.
  30. Sanjeeb Dash & Oktay Günlük & Andrea Lodi & Andrea Tramontani, 2012. "A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows," INFORMS Journal on Computing, INFORMS, vol. 24(1), pages 132-147, February.
  31. Escudero-Santana, Alejandro & Muñuzuri, Jesús & Cortés, Pablo & Onieva, Luis, 2021. "The one container drayage problem with soft time windows," Research in Transportation Economics, Elsevier, vol. 90(C).
  32. Zang, Xiaoning & Jiang, Li & Liang, Changyong & Fang, Xiang, 2023. "Coordinated home and locker deliveries: An exact approach for the urban delivery problem with conflicting time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 177(C).
  33. Rui Chen & Xinglu Liu & Lixin Miao & Peng Yang, 2020. "Electric Vehicle Tour Planning Considering Range Anxiety," Sustainability, MDPI, vol. 12(9), pages 1-17, May.
  34. Anirudh Subramanyam & Chrysanthos E. Gounaris, 2018. "A Decomposition Algorithm for the Consistent Traveling Salesman Problem with Vehicle Idling," Transportation Science, INFORMS, vol. 52(2), pages 386-401, March.
  35. Jeffrey W. Ohlmann & Barrett W. Thomas, 2007. "A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows," INFORMS Journal on Computing, INFORMS, vol. 19(1), pages 80-90, February.
  36. 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.
  37. Majed G. Alharbi & Ahmed Stohy & Mohammed Elhenawy & Mahmoud Masoud & Hamiden Abd El-Wahed Khalifa, 2021. "Solving Traveling Salesman Problem with Time Windows Using Hybrid Pointer Networks with Time Features," Sustainability, MDPI, vol. 13(22), pages 1-12, November.
  38. Roberto Wolfler Calvo, 2000. "A New Heuristic for the Traveling Salesman Problem with Time Windows," Transportation Science, INFORMS, vol. 34(1), pages 113-124, February.
  39. Bravo Caro, José Manuel & Golpe, Antonio A. & Iglesias, Jesús & Vides, José Carlos, 2020. "A new way of measuring the WTI – Brent spread. Globalization, shock persistence and common trends," Energy Economics, Elsevier, vol. 85(C).
  40. Salomon, Marc & Solomon, Marius M. & Van Wassenhove, Luk N. & Dumas, Yvan & Dauzere-Peres, Stephane, 1997. "Solving the discrete lotsizing and scheduling problem with sequence dependent set-up costs and set-up times using the Travelling Salesman Problem with time windows," European Journal of Operational Research, Elsevier, vol. 100(3), pages 494-513, August.
  41. Mitrovic-Minic, Snezana & Krishnamurti, Ramesh & Laporte, Gilbert, 2004. "Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 38(8), pages 669-685, September.
  42. Gonzalo Lera-Romero & Juan José Miranda Bront & Francisco J. Soulignac, 2022. "Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows," INFORMS Journal on Computing, INFORMS, vol. 34(6), pages 3292-3308, November.
  43. 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.
  44. 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.
  45. 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.
  46. 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.
  47. Fagerholt, Kjetil, 2001. "Ship scheduling with soft time windows: An optimisation based approach," European Journal of Operational Research, Elsevier, vol. 131(3), pages 559-571, June.
  48. Zhang, Zizhen & Qin, Hu & Zhu, Wenbin & Lim, Andrew, 2012. "The single vehicle routing problem with toll-by-weight scheme: A branch-and-bound approach," European Journal of Operational Research, Elsevier, vol. 220(2), pages 295-304.
  49. Roberti, R. & Wen, M., 2016. "The Electric Traveling Salesman Problem with Time Windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 89(C), pages 32-52.
  50. Li, Xiang & Zhou, Jiandong & Zhao, Xiande, 2016. "Travel itinerary problem," Transportation Research Part B: Methodological, Elsevier, vol. 91(C), pages 332-343.
  51. Urrutia, Sebastián & de Werra, Dominique, 2018. "What are the worst cases in constrained Last-In-First-Out pick-up and delivery problems?," European Journal of Operational Research, Elsevier, vol. 270(2), pages 430-434.
  52. Egon Balas & Neil Simonetti, 2001. "Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study," INFORMS Journal on Computing, INFORMS, vol. 13(1), pages 56-75, February.
  53. Mitrovic-Minic, Snezana & Laporte, Gilbert, 2004. "Waiting strategies for the dynamic pickup and delivery problem with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 38(7), pages 635-655, August.
  54. Gianpaolo Ghiani & Emanuele Manni & Barrett W. Thomas, 2012. "A Comparison of Anticipatory Algorithms for the Dynamic and Stochastic Traveling Salesman Problem," Transportation Science, INFORMS, vol. 46(3), pages 374-387, August.
  55. Christian Tilk & Stefan Irnich, 2017. "Dynamic Programming for the Minimum Tour Duration Problem," Transportation Science, INFORMS, vol. 51(2), pages 549-565, May.
  56. 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.
  57. Marielle Christiansen & Kjetil Fagerholt, 2002. "Robust ship scheduling with multiple time windows," Naval Research Logistics (NRL), John Wiley & Sons, vol. 49(6), pages 611-625, September.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.