Advanced search
Publication Cover
IIE Transactions Volume 28, 1996 - Issue 8: Scheduling and Logistics
Submit an article Journal homepage
151
Views
48
CrossRef citations to date
0
Altmetric
Original Articles

Solving the Traveling-Salesman Problem with Time Windows Using Tabu Search

William B. CarltonGraduate Program in Operations Research and Industrial Engineering, Department of Mechanical Engineering, ETC 5.128, The University of Texas at Austin, Austin, Texas78712, USAView further author information
&
J. Wesley BarnesGraduate Program in Operations Research and Industrial Engineering, Department of Mechanical Engineering, ETC 5.128D, The University of Texas at Austin, Austin, Texas78712, USAView further author information
Pages 617-629 | Received 01 Apr 1995, Accepted 01 Oct 1995, Published online: 13 Sep 2016

Citations (48)

Keep up to date with the latest research on this topic with citation updates for this article.

Subscribe to citation updates

Read on this site (2)

Imdat Kara, Ozge Nimet Koc, Fulya Altıparmak & Berna Dengiz. (2013) New integer linear programming formulation for the traveling salesman problem with time windows: minimizing tour duration with waiting times. Optimization 62:10, pages 1309-1319.
Read now
Payman Jula & Arash Rafiey. (2012) Coordinated scheduling of a single machine with sequence-dependent setup times and time-window constraints. International Journal of Production Research 50:8, pages 2304-2320.
Read now

Articles from other publishers (46)

Peter Dieter, Matthew Caron & Guido Schryen. (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 311:1, pages 283-300.
Crossref
Huafeng Dai, Lei Li, Run Mao, Xingyue Liu & Kun Zhou. (2023) A Solution-Based Tabu Search Algorithm for the Resource-Constrained Project Scheduling Problem with Step Deterioration. Mathematical Problems in Engineering 2023, pages 1-11.
Crossref
Cédric Pralet. (2023) Iterated Maximum Large Neighborhood Search for the Traveling Salesman Problem with Time Windows and its Time-dependent Version. Computers & Operations Research 150, pages 106078.
Crossref
Xinming Zang, Yuanyuan Zhu, Yongguang Zhong & Tao Chu. (2022) CiteSpace-Based Bibliometric Review of Pickup and Delivery Problem from 1995 to 2021. Applied Sciences 12:9, pages 4607.
Crossref
Majed Alharbi, Ahmed Stohy, Mohammed Elhenawy, Mahmoud Masoud & Hamiden El-Wahed Khalifa. (2021) Solving Traveling Salesman Problem with Time Windows Using Hybrid Pointer Networks with Time Features. Sustainability 13:22, pages 12906.
Crossref
Murat ARIKAN. (2021) Type-2 Assembly Line Balancing Using Reactive Tabu Search. Gazi University Journal of Science 34:1, pages 162-178.
Crossref
Meina Zheng, Runxuan Zhou, Shanshan Liu, Feng Liu & Xiucheng Guo. (2020) Route Design Model of Multiple Feeder Bus Service Based on Existing Bus Lines. Journal of Advanced Transportation 2020, pages 1-12.
Crossref
Kyle K. Qin, Wei Shao, Yongli Ren, Jeffrey Chan & Flora D. Salim. (2019) Solving multiple travelling officers problem with population-based optimization algorithms. Neural Computing and Applications 32:16, pages 12033-12059.
Crossref
Chengkun Zhang, Junbin Gao & Steven Lu. (2020) Cluster Developing 1-Bit Matrix Completion. Cluster Developing 1-Bit Matrix Completion.
Xiangjing Lai, Jin-Kao Hao & Dong Yue. (2019) Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem. European Journal of Operational Research 274:1, pages 35-48.
Crossref
Xiangjing Lai, Jin-Kao Hao, Fred Glover & Dong Yue. (2019) Intensification-driven tabu search for the minimum differential dispersion problem. Knowledge-Based Systems 167, pages 68-86.
Crossref
Xiangjing Lai & Zhang-Hua Fu. (2019) A Tabu Search Approach With Dynamical Neighborhood Size for Solving the Maximum Min-Sum Dispersion Problem. IEEE Access 7, pages 181357-181368.
Crossref
László T. Kóczy, Péter Földesi & Boldizsár Tüű-Szabó. (2018) Enhanced discrete bacterial memetic evolutionary algorithm - An efficacious metaheuristic for the traveling salesman optimization. Information Sciences 460-461, pages 389-400.
Crossref
Xiangjing Lai, Dong Yue, Jin-Kao Hao & Fred Glover. (2018) Solution-based tabu search for the maximum min-sum dispersion problem. Information Sciences 441, pages 79-94.
Crossref
Xiangjing Lai, Jin-Kao Hao, Fred Glover & Zhipeng Lü. (2018) A two-phase tabu-evolutionary algorithm for the 0–1 multidimensional knapsack problem. Information Sciences 436-437, pages 282-301.
Crossref
Izabela Nielsen, Ngoc Anh Dung Do, Zbigniew Antoni Banaszak & Mukund Nilakantan Janardhanan. (2017) Material supply scheduling in a ubiquitous manufacturing system. Robotics and Computer-Integrated Manufacturing 45, pages 21-33.
Crossref
Boldizsár Tüű-Szabó, Péter Földesi & László T. Kóczy. 2017. Multi-disciplinary Trends in Artificial Intelligence. Multi-disciplinary Trends in Artificial Intelligence 426 436 .
Manuel Díaz-Madroñero, David Peidro & Josefa Mula. (2015) A review of tactical optimization models for integrated production and transport routing planning decisions. Computers & Industrial Engineering 88, pages 518-535.
Crossref
Christos Papalitsas, Konstantinos Giannakis, Theodore Andronikos, Dimitrios Theotokis & Angelo Sifaleras. (2015) Initialization methods for the TSP with Time Windows using Variable Neighborhood Search. Initialization methods for the TSP with Time Windows using Variable Neighborhood Search.
Yossiri Adulyasak, Jean-François Cordeau & Raf Jans. (2015) The production routing problem: A review of formulations and solution algorithms. Computers & Operations Research 55, pages 141-152.
Crossref
Quang-Vinh Dang, Izabela Nielsen, Kenn Steger-Jensen & Ole Madsen. (2013) Scheduling a single mobile robot for part-feeding tasks of production lines. Journal of Intelligent Manufacturing 25:6, pages 1271-1287.
Crossref
Korhan Karabulut & M. Fatih Tasgetiren. (2014) A variable iterated greedy algorithm for the traveling salesman problem with time windows. Information Sciences 279, pages 383-395.
Crossref
Xiao Song Bai & Jing Yang. (2014) Design of Intelligent Dispatching and Monitoring System of Highway Maintenance. Applied Mechanics and Materials 602-605, pages 2281-2284.
Crossref
Alkın Yurtkuran & Erdal Emel. (2014) Efficient Constraint Handling in Electromagnetism-Like Algorithm for Traveling Salesman Problem with Time Windows. The Scientific World Journal 2014, pages 1-12.
Crossref
Manuel López-Ibáñez, Christian Blum, Jeffrey W. Ohlmann & Barrett W. Thomas. (2013) The travelling salesman problem with time windows: Adapting algorithms from travel-time to makespan optimization. Applied Soft Computing 13:9, pages 3806-3815.
Crossref
Christian Tummel, Christian Franzen, Eckart Hauck & Sabina Jeschke. 2013. Automation, Communication and Cybernetics in Science and Engineering 2011/2012. Automation, Communication and Cybernetics in Science and Engineering 2011/2012 753 765 .
Nenad Mladenović, Raca Todosijević & Dragan Urošević. (2012) An efficient GVNS for solving Traveling Salesman Problem with Time Windows. Electronic Notes in Discrete Mathematics 39, pages 83-90.
Crossref
Korhan Karabulut & M. Fatih Tasgetiren. (2012) A discrete artificial bee colony algorithm for the traveling salesman problem with time windows. A discrete artificial bee colony algorithm for the traveling salesman problem with time windows.
Tadanobu Mizogaki, Masao Sugi, Masashi Yamamoto, Hidetoshi Nagai, Yusuke Shiomi & Jun Ota. (2011) A Compressed Annealing Approach with Pre-Process for the Asymmetric Traveling Salesman Problem with Time Windows. International Journal of Automation Technology 5:5, pages 669-678.
Crossref
Yi Sui, Erhan Kutanoglu & J. Wesley Barnes. 2011. Service Parts Management. Service Parts Management 251 278 .
Rodrigo Ferreira da Silva & Sebastián Urrutia. (2010) A General VNS heuristic for the traveling salesman problem with time windows. Discrete Optimization 7:4, pages 203-211.
Crossref
Hassan Sarhadi & Keivan Ghoseiri. (2010) An ant colony system approach for fuzzy traveling salesman problem with time windows. The International Journal of Advanced Manufacturing Technology 50:9-12, pages 1203-1215.
Crossref
Manuel López-Ibáñez & Christian Blum. (2010) Beam-ACO for the travelling salesman problem with time windows. Computers & Operations Research 37:9, pages 1570-1583.
Crossref
Michael Ciarleglio, J. Wesley Barnes & Sahotra Sarkar. (2008) ConsNet—A tabu search approach to the spatially coherent conservation area network design problem. Journal of Heuristics 16:4, pages 537-557.
Crossref
Michael Ciarleglio, J. Wesley Barnes & Sahotra Sarkar. (2009) ConsNet: new software for the selection of conservation area networks with spatial and multi-criteria analyses. Ecography 32:2, pages 205-209.
Crossref
Ann Melissa Campbell & Barrett W. Thomas. (2009) Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines. Computers & Operations Research 36:4, pages 1231-1248.
Crossref
José Albiach, José María Sanchis & David Soler. (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 189:3, pages 789-802.
Crossref
Ann M. Campbell & Barrett W. Thomas. (2008) Probabilistic Traveling Salesman Problem with Deadlines. Transportation Science 42:1, pages 1-21.
Crossref
Les R. Foulds, Stein W. Wallace, John Wilson & Martin West. 2008. Aspects of Mathematical Modelling. Aspects of Mathematical Modelling 305 320 .
Jeffrey W. Ohlmann & Barrett W. Thomas. (2007) A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows. INFORMS Journal on Computing 19:1, pages 80-90.
Crossref
Andreas Trautmann. 2007. Internet der Dinge. Internet der Dinge 281 294 .
Hoon Jung, Keumwoo Lee & Wookwan Chun. (2006) Integration of GIS, GPS, and optimization technologies for the effective control of parcel delivery service. Computers & Industrial Engineering 51:1, pages 154-162.
Crossref
Martin Grunow, Hans-Otto Günther & Matthias Lehmann. 2005. Container Terminals and Automated Transport Systems. Container Terminals and Automated Transport Systems 231 255 .
William P Nanry & J Wesley Barnes. (2000) Solving the pickup and delivery problem with time windows using reactive tabu search. Transportation Research Part B: Methodological 34:2, pages 107-121.
Crossref
Don Weigel & Buyang Cao. (1999) Applying GIS and OR Techniques to Solve Sears Technician-Dispatching and Home Delivery Problems. Interfaces 29:1, pages 112-130.
Crossref
Fred Glover. 1997. Interfaces in Computer Science and Operations Research. Interfaces in Computer Science and Operations Research 1 75 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.