Simulated annealing and tabu search in the long run: A comparison on QAP tasks

DOI10.1016/0898-1221(94)00147-2MaRDI QIDQ1336877zbMATH OpenOpenAlexWikidataFDO

Authors Roberto Battiti, Giampietro Tecchiolli

Publication date 6 November 1994

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0898-1221(94)00147-2

zbMATH Keywords

quadratic assignment problemsimulated annealingtabu search

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem
• Tabu search vs. simulated annealing as a function of the size of quadratic assignment problem instances
• Tabu Search Applied to the Quadratic Assignment Problem
• Simulated annealing and tabu search: Lessons from a line search
• Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem

Cites work

• Algorithms for assignment problems on an array processor
• Bounding the probability of success of stochastic methods for global optimization
• EPCOT: An efficient procedure for coloring optimally with Tabu Search
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• Local search with memory: Benchmarking RTS
• Optimization by simulated annealing
• Simulated annealing and tabu search in the long run: A comparison on QAP tasks
• Tabu Search—Part I
• Tabu Search—Part II
• The Backboard Wiring Problem: A Placement Algorithm

Cited in

(16)

• The single-finger keyboard layout problem
• Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process
• Simulated annealing and tabu search in the long run: A comparison on QAP tasks
• Simulated annealing and tabu search: Lessons from a line search
• Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation
• Revisiting simulated annealing: a component-based analysis
• Local search with memory: Benchmarking RTS
• A comparison of neighborhood search techniques for multi-objective combinatorial problems
• The continuous reactive tabu search: Blending combinatorial optimization and stochastic search for global optimization
• Designing and reporting on computational experiments with heuristic methods
• A multiperiod set covering location model for dynamic redeployment of ambulances
• Tabu search vs. simulated annealing as a function of the size of quadratic assignment problem instances
• Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem
• A causal framework for stochastic local search optimization algorithms
• Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
• A survey for the quadratic assignment problem

This page was built for publication: Simulated annealing and tabu search in the long run: A comparison on QAP tasks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1336877)