Several algorithms of global optimal search

DOI10.1016/0965-9978(94)90035-3zbMATH Open0874.90166OpenAlexW2079758572MaRDI QIDQ1804243FDOQ1804243

Authors: Yao Zheng, R. W. Lewis 

Publication date: 13 November 1997

Published in: Advances in Engineering Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0965-9978(94)90035-3

Recommendations

• Stochastic adaptive search for global optimization.
• Simulated annealing, random search, MultiStart or SAD?
• Stochastic techniques for global optimization: A survey of recent advances
• Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithm—Corrigenda for this article is available here
• Random linkage: A family of acceptance/rejection algorithms for global sation

zbMATH Keywords

simulated annealingmulti-stage Monte-Carlo optimizationrandomized global optimization

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cited In (6)

• Multi-stage Monte Carlo optimization applied to a large travelling salesman problem
• The Montagne Russe algorithm for global optimization
• A direct search algorithm for global optimization
• Iterative MC-algorithm to solve the global optimization problems
• Promising GAHC and HC12 algorithms in global optimization tasks
• Title not available (Why is that?)

This page was built for publication: Several algorithms of global optimal search

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