Optimizing simulated annealing schedules with genetic programming

DOI10.1016/0377-2217(94)00350-5zbMath0912.90235OpenAlexW1978798413WikidataQ126635135 ScholiaQ126635135MaRDI QIDQ1268274

Ulrich Wilhelm Thonemann, Andreas Bölte

Publication date: 25 May 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)00350-5

zbMATH Keywords

heuristicssimulated annealingquadratic assignmentgenetic programming

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Quadratic programming (90C20) Combinatorial optimization (90C27)

Related Items

Planning personnel retraining: column generation heuristics, A survey for the quadratic assignment problem, Detailed layout planning for irregularly-shaped machines with transportation path design, A multi-stage IP-based heuristic for class timetabling and trainer rostering, Two-level modified simulated annealing based approach for solving facility layout problem, A tutorial on adaptive design optimization, An implementation of the iterated tabu search algorithm for the quadratic assignment problem, Application of the simulated annealing algorithm to the combinatorial optimization problem with permutation property: An investigation of generation mechanism, A simulated annealing methodology to distribution network design and management

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Quadratic assignment problems
• An improved annealing scheme for the QAP
• A thermodynamically motivated simulation procedure for combinatorial optimization problems
• A parallel heuristic for quadratic assignment problems
• The Quadratic Assignment Problem
• The Backboard Wiring Problem: A Placement Algorithm
• Assignment Problems and the Location of Economic Activities
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
• Convergence of an annealing algorithm
• Using simulated annealing to solve routing and location problems
• Simulated annealing methods with general acceptance probabilities
• Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem
• On Optimal Allocation in a Distributed Processing Environment
• Tabu Search—Part I
• Tabu Search—Part II
• Tabu Search Applied to the Quadratic Assignment Problem
• P-Complete Approximation Problems
• Entwurf von Schreibmaschinentastaturen mittels quadratischer Zuordnungsprobleme
• Equation of State Calculations by Fast Computing Machines
• Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem