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

DOI10.1016/0898-1221(94)00147-2zbMath0812.68067OpenAlexW1973189474WikidataQ127088230 ScholiaQ127088230MaRDI QIDQ1336877

Giampietro Tecchiolli, Roberto Battiti

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

simulated annealingtabu searchquadratic assignment problem

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (13)

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

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• Algorithms for assignment problems on an array processor
• Simulated annealing and tabu search in the long run: A comparison on QAP tasks
• Bounding the probability of success of stochastic methods for global optimization
• EPCOT: An efficient procedure for coloring optimally with Tabu Search
• Local search with memory: Benchmarking RTS
• The Backboard Wiring Problem: A Placement Algorithm
• Tabu Search—Part I
• Tabu Search—Part II

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