Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2015
Review
2015
This chapter provides a brief review of random search methods for simulation optimization. We start by describing the structure… 
Highly Cited
2006
Highly Cited
2006
Multiobjective optimal power plant operation requires an optimal mapping between unit load demand and pressure set point in a… 
Highly Cited
2004
Highly Cited
2004
Over the last decade, memetic algorithms (MAs) have relied on the use of a variety of different methods as the local improvement… 
Highly Cited
2002
Highly Cited
2002
Even though recent research has identified many different uses for peer-to-peer (P2P) architectures, file sharing remains the… 
Highly Cited
1994
Highly Cited
1994
The mutation distribution of evolutionary algorithms usually is oriented at the type of the search space. Typical examples are…