Heuristic Search The Emerging Science of Problem Solving
This book aims to provide a general overview of heuristic search, to present the basic steps of the most popular heuristics, and to stress their hidden difficulties as well as their opportunities. It provides a comprehensive understanding of Heuristic search, the applications of which are now widely...
Saved in:
Main Author | |
---|---|
Format | eBook Publication |
Language | English |
Published |
Cham
Springer International Publishing
2017
Springer International Publishing AG Palgrave Macmillan |
Edition | 1 |
Series | SpringerLink |
Subjects | |
Online Access | Get full text |
ISBN | 3319493558 9783319493558 331949354X 9783319493541 |
DOI | 10.1007/978-3-319-49355-8 |
Cover
Loading…
Abstract | This book aims to provide a general overview of heuristic search, to present the basic steps of the most popular heuristics, and to stress their hidden difficulties as well as their opportunities. It provides a comprehensive understanding of Heuristic search, the applications of which are now widely used in a variety of industries including engineering, finance, sport, management and medicine. It intends to aid researchers and practitioners in solving complex combinatorial and global optimisation problems, and spark interest in this exciting decision science-based subject. It will provide the reader with challenging and lively methodologies through which they will be able to design and analyse their own techniques |
---|---|
AbstractList | This book aims to provide a general overview of heuristic search, to present the basic steps of the most popular heuristics, and to stress their hidden difficulties as well as their opportunities. It provides a comprehensive understanding of Heuristic search, the applications of which are now widely used in a variety of industries including engineering, finance, sport, management and medicine. It intends to aid researchers and practitioners in solving complex combinatorial and global optimisation problems, and spark interest in this exciting decision science-based subject. It will provide the reader with challenging and lively methodologies through which they will be able to design and analyse their own techniques This work aims to provide a general overview of heuristic search, to present the basic steps of the most popular heuristics, and to stress their hidden difficulties as well as their opportunities. It provides a comprehensive understanding of Heuristic search, the applications of which are now widely used in a variety of industries including engineering, finance, sport, management and medicine. It intends to aid researchers and practitioners in solving complex combinatorial and global optimisation problems, and spark interest in this exciting decision science-based subject. It will provide the reader with challenging and lively methodologies through which they will be able to design and analyse their own techniques. |
Author | Salhi, Saïd |
Author_xml | – sequence: 1 fullname: Salhi, Saïd |
BackLink | http://www.econis.eu/PPNSET?PPN=1656857154$$DView this record in ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften |
BookMark | eNpNkDtPwzAURo14iLZUYkVi6IYYQu1cx48RqvKQKjGAWC3HvWlDQ1LsFMS_x20qwWR98vH57nWfHNVNjYRcMHrDKJVjLVUCCTCdcA1ZlqgD0ocYd0kd_g8npKclpFqkkp6SYQjvlNJUcgFM9sj5I258GdrSjV7Qerc8I8eFrQIO9-eAvN1PXyePyez54WlyO0tsynTsVYzxOTrtFEinXA6FlFQBLZRQmRVzlLlzCDYTvLCWcp2nQkjOIHPWsdzCgFx3YhtW-B2WTdUG81Vh3jSrYOKCfytEdtSx6Jq6DGbtyw_rfwwTWWyTLOMRGXdIiJf1Ar3pRIya7Y9thQZMVJqd02ylV92LtW8-Nxhas-t2WLfeVmZ6N-GK0VRDJC_3JPoKF81eDVwrGqf7BUgrb3k |
ContentType | eBook Publication |
Copyright | The Editor(s) (if applicable) and The Author(s) 2017 |
Copyright_xml | – notice: The Editor(s) (if applicable) and The Author(s) 2017 |
DBID | YSPEL OQ6 |
DEWEY | 658.403 |
DOI | 10.1007/978-3-319-49355-8 |
DatabaseName | Perlego ECONIS |
DatabaseTitleList | |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Business Computer Science |
EISBN | 3319493558 9783319493558 |
Edition | 1 |
ExternalDocumentID | 9783319493558 1656857154 421632 EBC4810293 3498058 |
Genre | Electronic books |
GroupedDBID | 0DA 20A 38. AABBV AALVI ABING ABMNI ABQUB ACBPT ADCXD ADOQC AEJLV AEKFX AETDV AEZAY AGIGN AIODD ALBAV ALMA_UNASSIGNED_HOLDINGS AUTMW AZZ BBABE CQUQW CZZ DIQRB IEZ JJU SBO TPJZQ YSPEL Z7U Z83 ACBYE OQ6 Z81 |
ID | FETCH-LOGICAL-a21919-8114dec9c837c8cb3f770830f8685a6de7bcce3a564faa049b26674135cac1ba3 |
ISBN | 3319493558 9783319493558 331949354X 9783319493541 |
IngestDate | Fri Nov 08 05:45:40 EST 2024 Tue Apr 15 03:58:08 EDT 2025 Fri May 23 02:58:28 EDT 2025 Fri May 30 22:56:48 EDT 2025 Wed Sep 03 00:05:52 EDT 2025 |
IsPeerReviewed | false |
IsScholarly | false |
LCCallNum_Ident | HF54.5-.56 |
Language | English |
LinkModel | OpenURL |
MergedId | FETCHMERGED-LOGICAL-a21919-8114dec9c837c8cb3f770830f8685a6de7bcce3a564faa049b26674135cac1ba3 |
OCLC | 973296270 |
PQID | EBC4810293 |
PageCount | 1 online resource |
ParticipantIDs | askewsholts_vlebooks_9783319493558 econis_primary_1656857154 springer_books_10_1007_978_3_319_49355_8 proquest_ebookcentral_EBC4810293 perlego_books_3498058 |
PublicationCentury | 2000 |
PublicationDate | 2017 20170221 2017-02-18 |
PublicationDateYYYYMMDD | 2017-01-01 2017-02-21 2017-02-18 |
PublicationDate_xml | – year: 2017 text: 2017 |
PublicationDecade | 2010 |
PublicationPlace | Cham |
PublicationPlace_xml | – name: Cham |
PublicationSeriesTitle | SpringerLink |
PublicationYear | 2017 |
Publisher | Springer International Publishing Springer International Publishing AG Palgrave Macmillan |
Publisher_xml | – name: Springer International Publishing – name: Springer International Publishing AG – name: Palgrave Macmillan |
SSID | ssj0002746317 |
Score | 2.4254892 |
Snippet | This book aims to provide a general overview of heuristic search, to present the basic steps of the most popular heuristics, and to stress their hidden... This work aims to provide a general overview of heuristic search, to present the basic steps of the most popular heuristics, and to stress their hidden... |
SourceID | askewsholts econis springer proquest perlego |
SourceType | Aggregation Database Index Database Publisher |
SubjectTerms | Algorithm Analysis and Problem Complexity Algorithms Big data Big Data/Analytics Business Business and Management Business Information Systems Computer science Computer Science, general Computer software Decision making Heuristic Heuristik Management information systems Operations research Operations Research/Decision Theory Problem solving Theorie |
Subtitle | The Emerging Science of Problem Solving |
TableOfContents | A Simple Example of a Basic SA Implementation -- SA Key Elements -- Initial Value of the Temperature -- The Final Temperature Tf -- The Updating of the Temperature -- Flexibility in Resetting the Temperature -- The Evaluation Function Speed Ups -- Stopping Criteria -- Some Thoughts -- 3.2 TA Heuristics -- Algorithm 3.2: A Basic TA Heuristic -- Record to Record Heuristic -- List-Based TA -- Some Thoughts -- 3.3 Tabu Search (TS) -- Basic Terminology -- The TS Algorithm -- Algorithm 3.3: A Basic TS Heuristic -- Basic Explanations of the Steps -- TS Key Elements -- Tabu Restrictions -- Tabu List Size |Ts| -- Constant |Ts| -- Dynamic Changes in |Ts| -- Soft Aspiration Level -- Softer Aspiration Level -- Diversification and Intensification -- Strategic Oscillation (SO) -- Some Thoughts -- 3.4 Summary -- References -- 4: Population-Based Heuristics -- 4.1 Genetic Algorithms -- Algorithm 4.1: A Basic Genetic Algorithm -- Chromosome Representation -- Integer/Real Numbers Representation -- GA Operators -- Bit Mutation -- Inversion -- Crossover Operators -- One Point Crossover -- Multi Points Crossover -- PMX Operator -- Reproduction/Selection Mechanisms -- Tournament Selection -- Matching Issues -- Flexible Reproduction -- Effect of Migration -- Fitness Function Representation -- Some Thoughts -- 4.2 Scatter Search -- Algorithm 4.2: A Basic Scatter Search Heuristic -- Some Thoughts -- 4.3 Harmony Search -- Illustrative Example -- Algorithm 4.3: Basic Harmony Search Heuristic -- Discrete Case -- Some Thoughts -- 4.4 Differential Evolution -- Algorithm 4.4: A Basic Differential Evolution Heuristic -- Some Thoughts -- 4.5 Ant Colonies -- Introduction to Ant System -- Selection Rule -- Local Updating -- Global Updating -- The AS Algorithm -- Algorithm 4.5: A Basic AS Heuristic -- Ant Colony System -- Modified Transition Rule -- Local Updating -- Other Variants Intro -- Preface -- Acknowledgements -- Contents -- List of Algorithms -- List of Figures -- List of Table -- 1: Introduction -- 1.1 Introduction -- 1.2 The Optimisation Problem -- Local versus Global Optimality -- Local Search -- 1.3 Possible Methodological Approaches -- Algorithm 1.1: A Possible Recursive Methodological Approach -- 1.4 Need for Heuristics -- 1.5 Some Characteristics of Heuristics -- 1.6 Complexity and Performance of Heuristics -- Solution Quality -- Computational Effort -- Time Complexity -- Space Complexity -- `Real´ Meaning of Large or Small Computing Time -- 1.7 A Possible Heuristic Classification -- 1.8 Summary -- References -- 2: Improvement-Only Heuristics -- 2.1 Neighbourhood Definition and Examples -- The Travelling Salesman Problem -- The p-Median Problem -- The Bin Packing Problem -- The Vehicle Routing Problem -- Non-linear Optimisation Problems -- 2.2 Basic Descent or Hill Climbing Method -- Algorithm 2.1: The Basic Descent Method -- Initial Solutions (Step 1) -- Construction-Based Heuristics for the TSP -- Basic Enhancement of Step 1 in BDM -- Improvement Phase of the BDM (Step 2) -- Selection Strategies -- 2.3 Classical Multi-Start -- 2.4 GRASP -- Algorithm 2.2: A Basic GRASP -- Some Thoughts -- 2.5 Simple Composite Heuristics -- Algorithm 2.3: A Basic Composite Heuristic -- 2.6 A Multi-Level Composite Heuristic -- Algorithm 2.4: A Basic Multi-level Heuristic -- Some Thoughts -- 2.7 Variable Neighbourhood Search -- Algorithm 2.5: A Basic VNS Heuristic -- Some Thoughts -- 2.8 Problem Perturbation Heuristics -- Related Approaches -- Some Thoughts -- 2.9 Other Improving Only Methods -- Large Neighbourhood Search -- Iterated Local Search -- Guided Local Search -- 2.10 Summary -- References -- 3: Not Necessary Improving Heuristics -- 3.1 Simulated Annealing -- The Physical Analogy -- Algorithm 3.1: A Basic SA Heuristic A Simple Implementation and Adaptation -- 6.5 Parameters Estimation/Adaptive Search -- 6.6 Constraint Handling via SO -- 6.7 Impact of Parallelisation -- Master-Slaves Model -- Speed of Parallel Processing -- Internal Parallel Processing -- Effect of GPU -- 6.8 Fuzzy Logic -- 6.9 Dealing with Multiple Objectives -- 6.10 Summary -- References -- 7: Applications, Conclusion and Research Challenges -- 7.1 Real-Life Applications -- Radiotherapy -- Sport Management -- Manpower Scheduling -- Computational Chemistry -- Distribution Management (Routing) -- Location Issues -- Financial Portfolio Management -- Civil Engineering -- Chemical Engineering -- Other Engineering Applications -- General/Academic Type Applications -- 7.2 Conclusion -- 7.3 Research Challenges -- References -- Index Some Thoughts -- 4.6 The Bees Algorithm -- Algorithm 4.6: A Basic Bees Algorithm -- Algorithm 4.7: The ABC Algorithm -- Some Thoughts -- 4.7 Particle Swarm Optimisation -- Algorithm 4.8: A Basic PSO Heuristic -- Some Thoughts -- 4.8 A Brief on Other Population-Based Approaches -- Path Relinking -- CE-Based Algorithms -- Artificial Immune Systems -- The Plant Propagation Algorithm -- Psycho-Clonal Algorithm -- 4.9 Summary -- References -- 5: Hybridisation Search -- 5.1 Hybridisation of Heuristics with Heuristics -- Hyper-Heuristics -- Constructive Hyper-Heuristics -- A Brute Force Approach -- A Random Scheme -- A Learning-Based Approach -- Improvement Metaheuristics -- MA and Its Variants -- A Brief on Other Metaheuristic Hybridisations -- 5.2 Integrating Heuristics Within Exact Methods -- Injection of UB -- Tightening of LB and UB -- Lagrangean Relaxation Heuristics (LRH) -- Illustrative Example -- Reduction/Relaxation-Based Schemes -- Kernel Search -- Regular Seeking of New UBs -- Local Branching -- 5.3 Integration of ILP Within Heuristics/Metaheuristics -- Problem Decomposition -- Heuristic Concentration (HC) -- Multi-level Decomposition -- 5.4 Data Mining Hybridisation Search -- 5.5 Summary -- References -- 6: Implementation Issues -- 6.1 Data Structure -- Avoidance of the Recomputation of Already Computed Information -- Elimination of Common Tasks Which Are Used in Several Parts of the Method -- Avoidance of Extra Computation -- Tree-Based DS -- 6.2 Duplication Identification -- Hashing Function -- Simultaneous Use of Multiple Simple Performance Functions -- String-Based Checks -- Set-Based Identifications -- 6.3 Approximation Effect on Cost Function Evaluation -- 6.4 Reduction Tests/Neighbourhood Reduction -- Proximity-Based Scheme (Rule 1) -- Relaxing Flag(i,j) Due to Depot Location (Rule 2) -- Angle-Based Scheme (Rule 3) |
Title | Heuristic Search |
URI | https://www.perlego.com/book/3498058/heuristic-search-the-emerging-science-of-problem-solving-pdf https://ebookcentral.proquest.com/lib/[SITE_ID]/detail.action?docID=4810293 http://link.springer.com/10.1007/978-3-319-49355-8 http://www.econis.eu/PPNSET?PPN=1656857154 https://www.vlebooks.com/vleweb/product/openreader?id=none&isbn=9783319493558&uid=none |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8QwEB50F0UvvrG-WMSDIJXtJm2To8ouIiqCD_QUkjRVcVnFXT346520abtd9KCX0oa2SWfayTcz_SYAezpWKU6zHT_QOvJpyts-b0vuBwadg06kdEIsOfniMjq9pWf34X21alnGLhmpQ_31I6_kP1rFNtSrZcn-QbPlTbEB91G_uEUN43YC_JaHbkUf85FXWD64roJRNk4is8R3D0Gk7D89j7v0QTzh0hchvYmgYBWXqvmABD8imlVJ_9Eijv8EYQlL2ak-q8x_kfJ-uL7qnteb3TTHWTtk0zAdx6wBzaPu2fldGcZCpzZCCGJZM-U48rpG1XGRTHb1fGvjmId5OXxBe462fjS0bC-Ntgx3Zt7Me988vtaQ_0SyOsMAN4vQNJYYsgRTZrAMswVjYAUWSm20cm2swl2ve3Ny6ruFJnyJBjuwcdCAJkZzje66ZlqRNI4Rm7ZTFrFQRomJldaGyDCiqZToVCnENYjFSKilDpQka9AYvA7MOrS4Qp8_ZAENFaUk5UxyknQSlaYEz2WRB7tjDyw--1lSfChqEvPAy-Ug3vKaI8IWSWJhjIDXg1UnGpFf6RTkQasQlMju6f7uFd3jE8oQR3LiwX4hQHdtUbQaexdEYP8iG4BgG7_0sglz1Ru7BY3R-4fZRlg2Ujvu1fgGfZsrRQ |
linkProvider | Library Specific Holdings |
openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.title=Heuristic+Search&rft.au=Sa%C3%AFd+Salhi&rft.date=2017-01-01&rft.pub=Springer+International+Publishing&rft.isbn=9783319493558&rft_id=info:doi/10.1007%2F978-3-319-49355-8&rft.externalDBID=YSPEL&rft.externalDocID=3498058 |
thumbnail_l | http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=https%3A%2F%2Fwww.perlego.com%2Fbooks%2FRM_Books%2Fingram_csplus_gexhsuob%2F9783319493558.jpg |
thumbnail_m | http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=https%3A%2F%2Fvle.dmmserver.com%2Fmedia%2F640%2F97833194%2F9783319493558.jpg |
thumbnail_s | http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=https%3A%2F%2Fmedia.springernature.com%2Fw306%2Fspringer-static%2Fcover-hires%2Fbook%2F978-3-319-49355-8 |