Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem
From MaRDI portal
Publication:918425
DOI10.1007/BF02022093zbMath0705.90069OpenAlexW2123608273MaRDI QIDQ918425
Mohan Guruswamy, Miroslaw Malek, Mihir Pandya
Publication date: 1989
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02022093
Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Distributed algorithms (68W15)
Related Items
A user's guide to tabu search, Hashing vectors for tabu search, Part type selection problem in flexible manufacturing systems: Tabu search algorithms, Genetic algorithms and tabu search: Hybrids for optimization, Multi-start iterated tabu search for the minimum weight vertex cover problem, Routing problems: A bibliography, Synchronous tabu search parallelization strategies for multicommodity location-allocation with balancing requirements, Ejection chains, reference structures and alternating path methods for traveling salesman problems, Parallel asynchronous tabu search for multicommodity location-allocation with balancing requirements, Genetic algorithms for the traveling salesman problem, Metaheuristics: A bibliography, Parallel local search, Heuristics for biquadratic assignment problems and their computational comparison, Least-cost network topology design for a new service: An application of tabu search, Experimental analysis of simulated annealing based algorithms for the layout problem, Optimizing the system of virtual paths by tabu search., An iterative three-component heuristic for the team orienteering problem with time windows, Multiperiod multi traveling salesmen problem considering time window constraints with an application to a real world case, Evaluating artificial intelligence heuristics for a flexible Kanban system: simultaneous Kanban controlling and scheduling, A tabu search algorithm for the routing and capacity assignment problem in computer networks, Artificial intelligence search methods for multi-machine two-stage scheduling with due date penalty, inventory, and machining costs, Two simulated annealing optimization schemas for rational Bézier curve fitting in the presence of noise, SO-I: a surrogate model algorithm for expensive nonlinear integer programming problems including global optimization applications, Solving the medium newspaper production/distribution problem, Optimizing tabu list size for the traveling salesman problem, A simple tabu search method to solve the mixed-integer linear bilevel programming problem, Parallel processing for difficult combinatorial optimization problems, The life span method -- a new variant of local search, Cyber swarm algorithms - improving particle swarm optimization using adaptive memory strategies, An empirical study of a new metaheuristic for the traveling salesman problem, Adaptive Iterated Local Search with Random Restarts for the Balanced Travelling Salesman Problem, Clustering categorical data sets using tabu search techniques
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Optimization of a 532-city symmetric traveling salesman problem by branch and cut
- The traveling salesman problem: An update of research
- A man-machine approach toward solving the traveling salesman problem
- The Traveling-Salesman Problem and Minimum Spanning Trees
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
