Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,217,174 papers from all fields of science
Search
Sign In
Create Free Account
Random search
Random search (RS) is a family of numerical optimization methods that do not require the gradient of the problem to be optimized, and RS can hence be…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
9 relations
Derivative-free optimization
Gaussian adaptation
List of numerical analysis topics
Local search (optimization)
Expand
Broader (1)
Stochastic optimization
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Review
2015
Review
2015
A Review of Random Search Methods
S. Andradóttir
2015
Corpus ID: 56608852
This chapter provides a brief review of random search methods for simulation optimization. We start by describing the structure…
Expand
Highly Cited
2010
Highly Cited
2010
Solving a comprehensive model for multiobjective project portfolio selection
Ana F. Carazo
,
T. Gómez
,
J. M. Luque
,
A. G. Hernández-Díaz
,
F. Guerrero
,
R. Caballero
Computers & Operations Research
2010
Corpus ID: 2793503
Highly Cited
2007
Highly Cited
2007
An effective architecture for learning and evolving flexible job-shop schedules
N. B. Ho
,
J. Tay
,
E. Lai
European Journal of Operational Research
2007
Corpus ID: 15428828
Highly Cited
2006
Highly Cited
2006
Multiobjective control of power plants using particle swarm optimization techniques
J. Heo
,
Kwang Y. Lee
,
R. Garduno-Ramirez
IEEE transactions on energy conversion
2006
Corpus ID: 18967853
Multiobjective optimal power plant operation requires an optimal mapping between unit load demand and pressure set point in a…
Expand
Highly Cited
2004
Highly Cited
2004
Meta-Lamarckian learning in memetic algorithms
Y. Ong
,
A. Keane
IEEE Transactions on Evolutionary Computation
2004
Corpus ID: 11003004
Over the last decade, memetic algorithms (MAs) have relied on the use of a variety of different methods as the local improvement…
Expand
Highly Cited
2004
Highly Cited
2004
Population set-based global optimization algorithms: some modifications and numerical studies
M. Ali
,
A. Törn
Computers & Operations Research
2004
Corpus ID: 5922062
Highly Cited
2002
Highly Cited
2002
Can Heterogeneity Make Gnutella Scalable?
Qin Lv
,
Sylvia Ratnasamy
,
S. Shenker
International Workshop on Peer-to-Peer Systems
2002
Corpus ID: 16719621
Even though recent research has identified many different uses for peer-to-peer (P2P) architectures, file sharing remains the…
Expand
Highly Cited
1996
Highly Cited
1996
The simplex-simulated annealing approach to continuous non-linear optimization
M. F. Cardoso
,
R. Salcedo
,
S. F. D. Azevedo
1996
Corpus ID: 14406222
Highly Cited
1994
Highly Cited
1994
An Evolutionary Algorithm for Integer Programming
G. Rudolph
Parallel Problem Solving from Nature
1994
Corpus ID: 1722137
The mutation distribution of evolutionary algorithms usually is oriented at the type of the search space. Typical examples are…
Expand
Highly Cited
1980
Highly Cited
1980
Society as a Learning System : Discovery, Invention, and Innovation Cycles Revisited : Technological Forecasting and Social Change
Cesare Marchetti
1980
Corpus ID: 153658934
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE