Optimizing tabu list size for the traveling salesman problem
Explore this paper's citation graph
Summary
It is revealed that good tabu list sizes are smaller than generally believed and that smaller neighborhoods require larger tabulist sizes to be effective.
- Type
- article
- Published
- 1998-02-01
- Cited by
- 60
- References
- 10
- OpenAlex
- https://openalex.org/W1984641114
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:39877702
Keywords
Tabu search, Travelling salesman problem, Heuristics, Guided Local Search, Mathematical optimization
References
- A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation
- Nonoptimal Edges for the Symmetric Traveling Salesman Problem
- The Traveling-Salesman Problem and Minimum Spanning Trees
- The symmetric traveling salesman problem and edge exchanges in minimal 1-trees
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- The traveling-salesman problem and minimum spanning trees: Part II
- Future paths for integer programming and links to artificial intelligence
- Tabu Search - Part II
- Computer solutions of the traveling salesman problem
- HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS
Cited by
- Some numerical experiments on multi-criterion tabu programming for finding Pareto-optimal solutions
- An Improved Tabu Search for Vector Quantization
- A Java Universal Vehicle Router in Support of Routing Unmanned Aerial Vehicles
- Routing Unmanned Aerial Vehicles While Considering General Restricted Operating Zones
- Comparison of a memetic algorithm and a tabu search algorithm for the traveling salesman problem
- Multi-criterion decision making by artificial intelligence techniques
- A Comparative Analysis of Traveling Salesman Solutions from Geographic Information Systems
- Coupling Ant Colony System with Local Search
- Modeling and performance study of AP placement framework for indoor location-awareness and network performance
- Neighborhood reduction strategy for tabu search implementation in asymmetric traveling salesman problem
- Randomized gravitational emulation search algorithm for symmetric traveling salesman problem
- An evolution-based tabu search approach to codebook design
- Chaotic ant swarm for the traveling salesman problem
- An Iterated Local Search heuristic for the single machine total weighted tardiness scheduling problem with sequence-dependent setup times
- Review of Solution Approaches for the Symmetric Traveling Salesman Problem
- Parameter control of metaheuristics with genetic fuzzy systems
- A Generic Bee Colony Optimization Framework for Combinatorial Optimization Problems
- A Study on Wireless LAN Topology Configuration for Enhancing Indoor Location-awareness and Network Performance
- Tabu Search Implementation on Traveling Salesman Problem and Its Variations: A Literature Survey
- Applying tabu search and simulated annealing to the optimal design of sewer networks
Related papers
- RANDOM TABU SEARCH WITH SIMULATED ANNEALING APPROACH FOR THE UNIT COMMITMENT PROBLEM
- Improved tabu search algorithm for continuous problems
- A parallel tabu search based method for reconfigurations of distribution systems
- Tabu Search metaheuristics for global optimization of electromagnetic problems
- Multi‐point Tabu Search for traveling salesman problems
- Adaptive Tabu Search for Traveling Salesman Problems
- Tabu Search Implementation on Traveling Salesman Problem and Its Variations: A Literature Survey
- A Review of the Tabu Search Literature on Traveling Salesman Problems Sumanta