Integrating and accelerating tabu search, simulated annealing, and genetic algorithms
From MaRDI portal
Publication:2366994
DOI10.1007/BF02022562zbMath0771.90083MaRDI QIDQ2366994
Publication date: 16 August 1993
Published in: Annals of Operations Research (Search for Journal in Brave)
Combinatorial optimization (90C27) Parallel numerical computation (65Y05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
A heuristic for optimizing stochastic activity networks with applications to statistical digital circuit sizing, Metaheuristics: A bibliography, Parallel local search, Evaluating the convergence of tabu enhanced hybrid quantum optimization, Revisiting simulated annealing: a component-based analysis, Redesigning product lines in a period of economic crisis: a hybrid simulated annealing algorithm with crossover, Random restarting versus simulated annealing
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Simulation of nonhomogeneous poisson processes by thinning
- Markov chain models - rarity and exponentiality
- Tabu search for nonlinear and parametric optimization (with links to genetic algorithms)
- Future paths for integer programming and links to artificial intelligence
- A user's guide to tabu search
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Cooling Schedules for Optimal Annealing
- On the Convergence Rate of Annealing Processes
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- Some Convergence Results for Probabilistic Tabu Search
- A Comparison of Two Simulated Annealing Algorithms Applied to the Directed Steiner Problem on Networks
- Faster Simulated Annealing
