Efficient hybrid methods for global continuous optimization based on simulated annealing

DOI10.1016/J.COR.2004.09.005MaRDI QIDQ2571196zbMATH OpenOpenAlexWikidataFDO

Authors Marko M. Mäkelä, Heikki Maaranen, Kaisa Miettinen

Publication date 1 November 2005

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2004.09.005

zbMATH Keywords

global optimizationmetaheuristicshybridizationbundle methods

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Nonconvex programming, global optimization (90C26)

Recommendations

• scientific article; zbMATH DE number 854915
• Simulated annealing using hybrid Monte Carlo
• A new hybrid method for solving global optimization problem
• Hybrid simulated annealing and direct search method for nonlinear unconstrained global optimization
• Heuristic pattern search and its hybridization with simulated annealing for nonlinear global optimization

Cites work

• scientific article; zbMATH DE number 50640 (Why is no real title available?)
• scientific article; zbMATH DE number 53965 (Why is no real title available?)
• scientific article; zbMATH DE number 193993 (Why is no real title available?)
• scientific article; zbMATH DE number 906530 (Why is no real title available?)
• A Method for Solving Certain Quadratic Programming Problems Arising in Nonsmooth Optimization
• A Monte Carlo simulated annealing approach to optimization over continuous variables
• A direct search variant of the simulated annealing algorithm for optimization involving continuous variables
• A hybrid algorithm for identifying global and local minima when optimizing functions with many minima.
• A hybrid method combining continuous tabu search and Nelder--Mead simplex algorithms for the global optimization of multiminima functions
• A novel metaheuristics approach for continuous global optimization
• Aspiration based simulated annealing algorithm
• Continuous optimization by a variant of simulated annealing
• Convergence of the simulated annealing algorithm for continuous global optimization
• Enhanced simulated annealing for globally minimizing functions of many-continuous variables
• Equation of state calculations by fast computing machines
• Experiments with new stochastic global optimization search techniques
• FITTING OF TABU SEARCH TO OPTIMIZE FUNCTIONS OF CONTINUOUS VARIABLES
• Global optimization and simulated annealing
• Global optimization and stochastic differential equations
• Global optimization of statistical functions with simulated annealing
• Global optimizations and tabu search based on memory
• Handbook of global optimization
• Hybrid simulated annealing and direct search method for nonlinear unconstrained global optimization
• More test examples for nonlinear programming codes
• New limited memory bundle method for large-scale nonsmooth optimization
• Optimization by simulated annealing
• Proximity control in bundle methods for convex nondifferentiable minimization
• Quasi-random initial population for genetic algorithms
• Simulated annealing algorithms for continuous global optimization: Convergence conditions
• Simulated annealing: Practice versus theory
• Tabu search applied to global optimization
• The continuous reactive tabu search: Blending combinatorial optimization and stochastic search for global optimization

Cited in

(2)

• Optimization of Jacobian matrix annealing algorithm based on hybrid model
• Simulated annealing for optimal ship routing

Describes a project that uses

Uses Software

• GEATbx
• LDGB
• ASA

This page was built for publication: Efficient hybrid methods for global continuous optimization based on simulated annealing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2571196)