The Resource Theory and principled methods for the design of metaheuristics, edited by Yossi Borenstein, Alberto Moraglio
Theory and principled methods for the design of metaheuristics, edited by Yossi Borenstein, Alberto Moraglio
Resource Information
The item Theory and principled methods for the design of metaheuristics, edited by Yossi Borenstein, Alberto Moraglio represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of MissouriSt. Louis Libraries.This item is available to borrow from 1 library branch.
Resource Information
The item Theory and principled methods for the design of metaheuristics, edited by Yossi Borenstein, Alberto Moraglio represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of MissouriSt. Louis Libraries.
This item is available to borrow from 1 library branch.
 Summary
 Metaheuristics, and evolutionary algorithms in particular, are known to provide efficient, adaptable solutions for many realworld problems, but the often informal way in which they are defined and applied has led to misconceptions, and even successful applications are sometimes the outcome of trial and error. Ideally, theoretical studies should explain when and why metaheuristics work, but the challenge is huge: mathematical analysis requires significant effort even for simple scenarios and reallife problems are usually quite complex. In this book the editors establish a bridge between theory and practice, presenting principled methods that incorporate problem knowledge in evolutionary algorithms and other metaheuristics. The book consists of 11 chapters dealing with the following topics: theoretical results that show what is not possible, an assessment of unsuccessful lines of empirical research; methods for rigorously defining the appropriate scope of problems while acknowledging the compromise between the class of problems to which a search algorithm is applied and its overall expected performance; the topdown principled design of search algorithms, in particular showing that it is possible to design algorithms that are provably good for some rigorously defined classes; and, finally, principled practice, that is reasoned and systematic approaches to setting up experiments, metaheuristic adaptation to specific problems, and setting parameters. With contributions by some of the leading researchers in this domain, this book will be of significant value to scientists, practitioners, and graduate students in the areas of evolutionary computing, metaheuristics, and computational intelligence
 Language
 eng
 Extent
 1 online resource.
 Contents

 No Free Lunch Theorems: Limitations and Perspectives of Metaheuristics
 Convergence Rates of Evolutionary Algorithms and Parallel Evolutionary Algorithms
 Rugged and Elementary Landscapes
 SingleFunnel and Multifunnel Landscapes and Subthreshold Seeking Behavior
 BlackBox Complexity for Bounding the Performance of Randomized Search Heuristics
 Designing an Optimal Search Algorithm with Respect to Prior Information
 The Bayesian Search Game
 Principled Design of Continuous Stochastic Search: From Theory to Practice
 Parsimony Pressure Made Easy: Solving the Problem of Bloat in GP
 Experimental Analysis of Optimization Algorithms: Tuning and Beyond
 Formal Search Algorithms + Problem Characterizations = Executable Search Strategies
 Isbn
 9783642332067
 Label
 Theory and principled methods for the design of metaheuristics
 Title
 Theory and principled methods for the design of metaheuristics
 Statement of responsibility
 edited by Yossi Borenstein, Alberto Moraglio
 Subject

 Computer algorithms
 Computer algorithms
 Computer algorithms
 Heuristic programming
 Heuristic programming
 Heuristic programming
 MATHEMATICS  Applied
 MATHEMATICS  Probability & Statistics  General
 Mathematical optimization
 Mathematical optimization
 Mathematical optimization
 Problem solving  Data processing
 Problem solving  Data processing
 Problem solving  Data processing
 Language
 eng
 Summary
 Metaheuristics, and evolutionary algorithms in particular, are known to provide efficient, adaptable solutions for many realworld problems, but the often informal way in which they are defined and applied has led to misconceptions, and even successful applications are sometimes the outcome of trial and error. Ideally, theoretical studies should explain when and why metaheuristics work, but the challenge is huge: mathematical analysis requires significant effort even for simple scenarios and reallife problems are usually quite complex. In this book the editors establish a bridge between theory and practice, presenting principled methods that incorporate problem knowledge in evolutionary algorithms and other metaheuristics. The book consists of 11 chapters dealing with the following topics: theoretical results that show what is not possible, an assessment of unsuccessful lines of empirical research; methods for rigorously defining the appropriate scope of problems while acknowledging the compromise between the class of problems to which a search algorithm is applied and its overall expected performance; the topdown principled design of search algorithms, in particular showing that it is possible to design algorithms that are provably good for some rigorously defined classes; and, finally, principled practice, that is reasoned and systematic approaches to setting up experiments, metaheuristic adaptation to specific problems, and setting parameters. With contributions by some of the leading researchers in this domain, this book will be of significant value to scientists, practitioners, and graduate students in the areas of evolutionary computing, metaheuristics, and computational intelligence
 Cataloging source
 GW5XE
 Dewey number
 519.6
 Index
 no index present
 Language note
 English
 LC call number
 QA402.5
 Literary form
 non fiction
 Nature of contents

 dictionaries
 bibliography
 http://library.link/vocab/relatedWorkOrContributorName

 Borenstein, Yossi
 Moraglio, Alberto
 Series statement
 Natural computing series
 http://library.link/vocab/subjectName

 Mathematical optimization
 Heuristic programming
 Problem solving
 Computer algorithms
 MATHEMATICS
 MATHEMATICS
 Computer algorithms
 Heuristic programming
 Mathematical optimization
 Problem solving
 Label
 Theory and principled methods for the design of metaheuristics, edited by Yossi Borenstein, Alberto Moraglio
 Antecedent source
 unknown
 Bibliography note
 Includes bibliographical references
 Carrier category
 online resource
 Carrier category code

 cr
 Carrier MARC source
 rdacarrier
 Color
 multicolored
 Content category
 text
 Content type code

 txt
 Content type MARC source
 rdacontent
 Contents
 No Free Lunch Theorems: Limitations and Perspectives of Metaheuristics  Convergence Rates of Evolutionary Algorithms and Parallel Evolutionary Algorithms  Rugged and Elementary Landscapes  SingleFunnel and Multifunnel Landscapes and Subthreshold Seeking Behavior  BlackBox Complexity for Bounding the Performance of Randomized Search Heuristics  Designing an Optimal Search Algorithm with Respect to Prior Information  The Bayesian Search Game  Principled Design of Continuous Stochastic Search: From Theory to Practice  Parsimony Pressure Made Easy: Solving the Problem of Bloat in GP  Experimental Analysis of Optimization Algorithms: Tuning and Beyond  Formal Search Algorithms + Problem Characterizations = Executable Search Strategies
 Control code
 868024621
 Dimensions
 unknown
 Extent
 1 online resource.
 File format
 unknown
 Form of item
 online
 Isbn
 9783642332067
 Level of compression
 unknown
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code

 c
 Other control number

 10.1007/9783642332067
 10.1007/978364233
 Quality assurance targets
 not applicable
 Reformatting quality
 unknown
 Sound
 unknown sound
 Specific material designation
 remote
 System control number
 (OCoLC)868024621
 Label
 Theory and principled methods for the design of metaheuristics, edited by Yossi Borenstein, Alberto Moraglio
 Antecedent source
 unknown
 Bibliography note
 Includes bibliographical references
 Carrier category
 online resource
 Carrier category code

 cr
 Carrier MARC source
 rdacarrier
 Color
 multicolored
 Content category
 text
 Content type code

 txt
 Content type MARC source
 rdacontent
 Contents
 No Free Lunch Theorems: Limitations and Perspectives of Metaheuristics  Convergence Rates of Evolutionary Algorithms and Parallel Evolutionary Algorithms  Rugged and Elementary Landscapes  SingleFunnel and Multifunnel Landscapes and Subthreshold Seeking Behavior  BlackBox Complexity for Bounding the Performance of Randomized Search Heuristics  Designing an Optimal Search Algorithm with Respect to Prior Information  The Bayesian Search Game  Principled Design of Continuous Stochastic Search: From Theory to Practice  Parsimony Pressure Made Easy: Solving the Problem of Bloat in GP  Experimental Analysis of Optimization Algorithms: Tuning and Beyond  Formal Search Algorithms + Problem Characterizations = Executable Search Strategies
 Control code
 868024621
 Dimensions
 unknown
 Extent
 1 online resource.
 File format
 unknown
 Form of item
 online
 Isbn
 9783642332067
 Level of compression
 unknown
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code

 c
 Other control number

 10.1007/9783642332067
 10.1007/978364233
 Quality assurance targets
 not applicable
 Reformatting quality
 unknown
 Sound
 unknown sound
 Specific material designation
 remote
 System control number
 (OCoLC)868024621
Subject
 Computer algorithms
 Computer algorithms
 Computer algorithms
 Heuristic programming
 Heuristic programming
 Heuristic programming
 MATHEMATICS  Applied
 MATHEMATICS  Probability & Statistics  General
 Mathematical optimization
 Mathematical optimization
 Mathematical optimization
 Problem solving  Data processing
 Problem solving  Data processing
 Problem solving  Data processing
Member of
Library Links
Embed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.umsl.edu/portal/Theoryandprincipledmethodsforthedesignof/HBl8xRCCvhA/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.umsl.edu/portal/Theoryandprincipledmethodsforthedesignof/HBl8xRCCvhA/">Theory and principled methods for the design of metaheuristics, edited by Yossi Borenstein, Alberto Moraglio</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.umsl.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.umsl.edu/">University of MissouriSt. Louis Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Item Theory and principled methods for the design of metaheuristics, edited by Yossi Borenstein, Alberto Moraglio
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.umsl.edu/portal/Theoryandprincipledmethodsforthedesignof/HBl8xRCCvhA/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.umsl.edu/portal/Theoryandprincipledmethodsforthedesignof/HBl8xRCCvhA/">Theory and principled methods for the design of metaheuristics, edited by Yossi Borenstein, Alberto Moraglio</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.umsl.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.umsl.edu/">University of MissouriSt. Louis Libraries</a></span></span></span></span></div>