Wiley Encyclopedia of Operations Research and Management Science 2011
DOI: 10.1002/9780470400531.eorms1009
|View full text |Cite
|
Sign up to set email alerts
|

Stochastic Search Methods for Global Optimization

Abstract: Stochastic search methods, also known as random search algorithms, are popular for ill‐structured global optimization problems because they are straightforward to implement and usually find a relatively good solution quickly. These algorithms have been inspired by physics, such as simulated annealing and interacting particle algorithms, as well as by biology, including genetic algorithms, evolutionary programming, particle swarm, and ant colony optimization. This article highlights the use of a Markov chain Mo… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2014
2014
2020
2020

Publication Types

Select...
3
2

Relationship

2
3

Authors

Journals

citations
Cited by 7 publications
(3 citation statements)
references
References 59 publications
0
3
0
Order By: Relevance
“…Another program for the design of buckled stiffened panels is PANDA2 (Bushnell 1987) that can analyse panels using FSM, finite difference energy method or smeared representation of the stiffeners. VICONOPT and PANDA2 use the method of feasible directions for carrying out the optimization while COSTADE uses the Improving Hit-and-Run algorithm (Zabinsky 1998).…”
Section: Introductionmentioning
confidence: 99%
“…Another program for the design of buckled stiffened panels is PANDA2 (Bushnell 1987) that can analyse panels using FSM, finite difference energy method or smeared representation of the stiffeners. VICONOPT and PANDA2 use the method of feasible directions for carrying out the optimization while COSTADE uses the Improving Hit-and-Run algorithm (Zabinsky 1998).…”
Section: Introductionmentioning
confidence: 99%
“…For specific combinatorial problems, such as the Traveling Salesman Problem, specialized neighborhood generators have been developed to be used in random sampling in optimization algorithms [3,10,27]. However, for mixed continuous/discrete domains, which are prevalent in many engineering optimization problems [12,18,22,28], appropriate neighborhood generators have not been developed. Many effective global and convex optimization algorithms for continuous problems have embedded the Markov chain Monte Carlo sampler known as Hit-and-Run (HR) [7,11,19,20,29,30].…”
Section: Introductionmentioning
confidence: 99%
“…Stochastic approaches, such as simulated annealing, genetic algorithms, and evolutionary programming, are useful for optimizing engineering problems. The reader may consult [2,5,8,9,11,29,31,33] for more details of various techniques on the stochastic approaches.…”
Section: Optimization Algorithm Considerationmentioning
confidence: 99%