Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Eagle_strategy> ?p ?o. }
Showing items 1 to 26 of
26
with 100 items per page.
- Eagle_strategy abstract "Eagle strategy is a search strategy for solving nonlinear optimization problems, and this strategy was developed by Xin-she Yang and Suash Deb, based on the foraging behaviour of eagle species such as Golden Eagles.In optimization, a common strategy is to search for the optimal solution starting from a set of initial guess solutions (either random and educated guess). In the case when the cost functions are multimodal with multiple local best solutions, the final solutionsmay heavily depend on the initial starting solutions. In order to minimize such dependence on initial random solutions, most modern algorithms, especially metaheuristic algorithms, are able to escape local optima by using some sophisticated random techniques. However, most of these algorithms are one-stage type; that is, once initialization is done, the search process continues until an algorithm stops. Running an algorithm many times from different initial solutions may occasionally improve the overall performance on average.Eagle strategy improves this by using an iterative, interacting two-stage strategy to enhance the search efficiency by escaping the local optima and use initial solutions in different regions. It uses a slow search stage and a fast stage to simulate an eagle searching for prey tends to search on a large area and then quickly switches to a rapid chasing phase once a prey is in sight. In optimization, it uses a coarse search stage on a larger area in a search space in combination with an intensive faster search algorithm in the neighbourhood of promising solutions. Two stages interchanges and proceed iteratively. As there are two stages in the strategy, each stage can employ different algorithms. For example, differential evolution can be used within eagle strategy. Studies show that such a combination is better than any of its components.In the simplest case, when the first stage does not use any algorithm (just initialization), it essentially degenerates into a hill-climbing with random restart. However, this strategy could be potentially much more powerful if a good combination of different algorithms is used.".
- Eagle_strategy wikiPageID "34038837".
- Eagle_strategy wikiPageRevisionID "549984644".
- Eagle_strategy hasPhotoCollection Eagle_strategy.
- Eagle_strategy subject Category:Artificial_intelligence.
- Eagle_strategy subject Category:Evolutionary_algorithms.
- Eagle_strategy subject Category:Optimization_algorithms_and_methods.
- Eagle_strategy type Abstraction100002137.
- Eagle_strategy type Act100030358.
- Eagle_strategy type Activity100407535.
- Eagle_strategy type Algorithm105847438.
- Eagle_strategy type Event100029378.
- Eagle_strategy type EvolutionaryAlgorithms.
- Eagle_strategy type OptimizationAlgorithmsAndMethods.
- Eagle_strategy type Procedure101023820.
- Eagle_strategy type PsychologicalFeature100023100.
- Eagle_strategy type Rule105846932.
- Eagle_strategy type YagoPermanentlyLocatedEntity.
- Eagle_strategy comment "Eagle strategy is a search strategy for solving nonlinear optimization problems, and this strategy was developed by Xin-she Yang and Suash Deb, based on the foraging behaviour of eagle species such as Golden Eagles.In optimization, a common strategy is to search for the optimal solution starting from a set of initial guess solutions (either random and educated guess).".
- Eagle_strategy label "Eagle strategy".
- Eagle_strategy sameAs m.0hrfndw.
- Eagle_strategy sameAs Q5325319.
- Eagle_strategy sameAs Q5325319.
- Eagle_strategy sameAs Eagle_strategy.
- Eagle_strategy wasDerivedFrom Eagle_strategy?oldid=549984644.
- Eagle_strategy isPrimaryTopicOf Eagle_strategy.