General Purpose Simulated Annealing
From MaRDI portal
Publication:4018536
DOI10.1057/jors.1992.75zbMath0756.90066OpenAlexW2045467381MaRDI QIDQ4018536
Publication date: 16 January 1993
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/jors.1992.75
Integer programming (90C10) Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Discrete dynamical system approaches for Boolean polynomial optimization ⋮ Adaptive large neighborhood search for the curriculum-based course timetabling problem ⋮ A comparison of two methods for solving 0-1 integer programs using a general purpose simulated annealing algorithm ⋮ Metaheuristics: A bibliography ⋮ A simulated annealing approach to the traveling tournament problem ⋮ Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge ⋮ Hysteretic optimization for the traveling salesman problem ⋮ Solving the continuous flow-shop scheduling problem by metaheuristics. ⋮ A hybrid algorithm for identifying global and local minima when optimizing functions with many minima. ⋮ The impact of operations redesign on the safety stock investment in supply chains ⋮ A co-operative parallel heuristic for mixed zero--one linear programming: Combining simulated annealing with branch and bound ⋮ Analysis of solution space-dependent performance of simulated annealing: The case of the multi-level capacitated lot sizing problem ⋮ Unnamed Item ⋮ Solving zero-one mixed integer programming problems using tabu search
