---

＜電子ブック＞
Handbook of Metaheuristics / edited by Fred W. Glover, Gary A. Kochenberger
(International Series in Operations Research & Management Science. ISSN:22147934 ; 57)

版	1st ed. 2003.
出版者	(New York, NY : Springer US : Imprint: Springer)
出版年	2003
本文言語	英語
大きさ	XII, 557 p : online resource
著者標目	Glover, Fred W editor Kochenberger, Gary A editor SpringerLink (Online service)
件　名	LCSH:Mathematical optimization LCSH:Calculus of variations LCSH:Artificial intelligence LCSH:Operations research LCSH:Management science FREE:Optimization FREE:Calculus of Variations and Optimization FREE:Artificial Intelligence FREE:Operations Research and Decision Theory FREE:Operations Research, Management Science
一般注記	Scatter Search and Path Relinking: Advances and Applications -- An Introduction to Tabu Search -- Genetic Algorithms -- Genetic Programming: Automatic Synthesis of Topologies and Numerical Parameters -- A Gentle Introduction to Memetic Algorithms -- Variable Neighborhood Search -- Guided Local Search -- Greedy Randomized Adaptive Search Procedures -- The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances -- The Theory and Practice of Simulated Annealing -- Iterated Local Search -- Multi-Start Methods -- Local Search and Constraint Programming -- Constraint Satisfaction -- Artificial Neural Networks for Combinatorial Optimization -- Hyper-Heuristics: An Emerging Direction in Modern Search Technology -- Parallel Strategies for Meta-Heuristics -- Metaheuristic Class Libraries -- Asynchronous Teams Metaheuristics, in their original definition, are solution methods that orchestrate an interaction between local improvement procedures and higher level strategies to create a process capable of escaping from local optima and performing a robust search of a solution space. Over time, these methods have also come to include any procedures that employ strategies for overcoming the trap of local optimality in complex solution spaces, especially those procedures that utilize one or more neighborhood structures as a means of defining admissible moves to transition from one solution to another, or to build or destroy solutions in constructive and destructive processes. The degree to which neighborhoods are exploited varies according to the type of procedure. In the case of certain population-based procedures, such as genetic al- rithms, neighborhoods are implicitly (and somewhat restrictively) defined by reference to replacing components of one solution with those of another, by variously chosen rules of exchange popularly given the name of “crossover. ” In other population-based methods, based on the notion of path relinking, neighborhood structures are used in their full generality, including constructive and destructive neighborhoods as well as those for transitioning between (complete) solutions. Certain hybrids of classical evoluti- ary approaches, which link them with local search, also use neighborhood structures more fully, though apart from the combination process itself HTTP:URL=https://doi.org/10.1007/b101874

 類似資料