Optimizing simulated annealing schedules with genetic programming
type: Item
instance of: scholarly article
title: Optimizing simulated annealing schedules with genetic programming
zbMATH Open document ID: 0912.90235
DOI: 10.1016/0377-2217(94)00350-5
author: Andreas Bölte
author: Ulrich W. Thonemann
published in: European Journal of Operational Research
publication date: 1999-05-25T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 68T05
zbMATH DE Number: 1212249
zbMATH Keywords: heuristics
zbMATH Keywords: simulated annealing
zbMATH Keywords: genetic programming
zbMATH Keywords: quadratic assignment
MaRDI profile type: Publication
full work available at URL: 0377-2217(94)00350-5
OpenAlex ID: W1978798413
cites work: Simulated annealing methods with general acceptance probabilities
cites work: Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem
cites work: Quadratic assignment problems
cites work: Entwurf von Schreibmaschinentastaturen mittels quadratischer Zuordnungsprobleme
cites work: A thermodynamically motivated simulation procedure for combinatorial optimization problems
cites work: An improved annealing scheme for the QAP
cites work: Q3992822
cites work: On Optimal Allocation in a Distributed Processing Environment
cites work: Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
cites work: Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
cites work: Tabu Search—Part I
cites work: Tabu Search—Part II
cites work: Using simulated annealing to solve routing and location problems
cites work: Q4079017
cites work: A parallel heuristic for quadratic assignment problems
cites work: Optimization by Simulated Annealing
cites work: Assignment Problems and the Location of Economic Activities
cites work: The quadratic assignment problem
cites work: Convergence of an annealing algorithm
cites work: Equation of State Calculations by Fast Computing Machines
cites work: P-Complete Approximation Problems
cites work: Tabu Search Applied to the Quadratic Assignment Problem
cites work: The Backboard Wiring Problem: A Placement Algorithm
cites work: Q3702491
Wikidata QID: Q126635135
Recommended article: Q4391613
Recommended article: A Simulated Annealing Genetic Algorithm for Solving Timetable Problems
Recommended article: Q3992822
Recommended article: Q4216477
Recommended article: Q4464837
Recommended article: Scheduling problem using genetic algorithm, simulated annealing and the effects of parameter values on GA performance
Recommended article: Q4856751
Recommended article: Annealing a genetic algorithm for constrained optimization
Recommended article: Simulation optimisation using a genetic algorithm
description: scientific article; zbMATH DE number 1212249