Notice bibliographique
- Notice
Type(s) de contenu et mode(s) de consultation : Texte noté : électronique
Auteur(s) : Rothlauf, Franz (1971-....)
Titre(s) : Design of modern heuristics [Texte électronique] : principles and application / Franz Rothlauf
Publication : Berlin ; New York : Springer, cop. 2011
Description matérielle : 1 ressource dématérialisée
Collection : Natural computing series
Note(s) : Includes bibliographical references (pages 227-256) and index
The author takes a different approach in this textbook by focusing on the users' needs
and answering three fundamental questions: First, he tells us which problems modern
heuristics are expected to perform well on, and which should be left to traditional
optimization methods. Second, he teaches us to systematically design the "right" modern
heuristic for a particular problem by providing a coherent view on design elements
and working principles. Third, he shows how we can make use of problem-specific knowledge
for the design of efficient and effective modern heuristics that solve not only small
toy problems but also perform well on large real-world problems
Sujet(s) : Programmation heuristique
Optimisation combinatoire
Informatique douce
Indice(s) Dewey :
006.3 (23e éd.) = Intelligence artificielle et calcul naturel
Identifiants, prix et caractéristiques : ISBN 9783540729624
Identifiant de la notice : ark:/12148/cb446952747
Notice n° :
FRBNF44695274
(notice reprise d'un réservoir extérieur)
Table des matières : 1. Introduction ; Part I. Fundamentals: 2. Optimization problems. ; Solution process
; Recognizing problems ; Defining problems ; Constructing models ; Solving models
; Validating solutions ; Implementing solutions ; Problem instances ; Search spaces
; Metrics ; Neighborhoods ; Fitness landscapes ; Optimal solutions ; Properties
of optimization problems ; Problem difficulty ; Locality ; Decomposability ; 3.
Optimization methods. Analytical and numerical optimization methods ; Optimization
methods for linear, continuous problems ; Linear optimization problems ; Simplex
method ; Simplex and interior point methods ; Optimization methods for linear, discrete
problems ; Integer linear problems ; Uninformed and informed search ; Branch and
bound methods ; Dynamic programming ; Cutting plane methods ; Heuristic optimization
methods ; Heuristics ; Approximation algorithms ; Modern heuristics ; No-free-lunch
theorem ; Part II. Modern Heuristics: 4. Design e
