LEADER 06523nam 22009255 450 001 996465636503316 005 20231005153459.0 010 $a3-642-03751-8 024 7 $a10.1007/978-3-642-03751-1 035 $a(CKB)1000000000784722 035 $a(SSID)ssj0000317493 035 $a(PQKBManifestationID)11253559 035 $a(PQKBTitleCode)TC0000317493 035 $a(PQKBWorkID)10294271 035 $a(PQKB)10090895 035 $a(DE-He213)978-3-642-03751-1 035 $a(MiAaPQ)EBC3064536 035 $a(PPN)139955097 035 $a(EXLCZ)991000000000784722 100 $a20100301d2009 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aEngineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics$b[electronic resource] $eInternational Workshop, SLS 2009, Brussels, Belgium, September 3-5, 2009, Proceedings /$fedited by Thomas Stützle, Mauro Birattari, Holger H. Hoos 205 $a1st ed. 2009. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2009. 215 $a1 online resource (X, 155 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5752 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-03750-X 320 $aIncludes bibliographical references and index. 327 $aHigh-Performance Local Search for Task Scheduling with Human Resource Allocation -- High-Performance Local Search for Task Scheduling with Human Resource Allocation -- On the Use of Run Time Distributions to Evaluate and Compare Stochastic Local Search Algorithms -- Estimating Bounds on Expected Plateau Size in MAXSAT Problems -- A Theoretical Analysis of the k-Satisfiability Search Space -- Loopy Substructural Local Search for the Bayesian Optimization Algorithm -- Running Time Analysis of ACO Systems for Shortest Path Problems -- Techniques and Tools for Local Search Landscape Visualization and Analysis -- Short Papers -- High-Performance Local Search for Solving Real-Life Inventory Routing Problems -- A Detailed Analysis of Two Metaheuristics for the Team Orienteering Problem -- On the Explorative Behavior of MAX?MIN Ant System -- A Study on Dominance-Based Local Search Approaches for Multiobjective Combinatorial Optimization -- A Memetic Algorithm for the Multidimensional Assignment Problem -- Autonomous Control Approach for Local Search -- EasyGenetic: A Template Metaprogramming Framework for Genetic Master-Slave Algorithms -- Adaptive Operator Selection for Iterated Local Search -- Improved Robustness through Population Variance in Ant Colony Optimization -- Mixed-Effects Modeling of Optimisation Algorithm Performance. 330 $aStochastic local search (SLS) algorithms are established tools for the solution of computationally hard problems arising in computer science, business adm- istration, engineering, biology, and various other disciplines. To a large extent, their success is due to their conceptual simplicity, broad applicability and high performance for many important problems studied in academia and enco- tered in real-world applications. SLS methods include a wide spectrum of te- niques, ranging from constructive search procedures and iterative improvement algorithms to more complex SLS methods, such as ant colony optimization, evolutionary computation, iterated local search, memetic algorithms, simulated annealing, tabu search, and variable neighborhood search. Historically, the development of e?ective SLS algorithms has been guided to a large extent by experience and intuition. In recent years, it has become - creasingly evident that success with SLS algorithms depends not merely on the adoption and e?cient implementation of the most appropriate SLS technique for a given problem, but also on the mastery of a more complex algorithm - gineering process. Challenges in SLS algorithm development arise partly from the complexity of the problems being tackled and in part from the many - grees of freedom researchers and practitioners encounter when developing SLS algorithms. Crucial aspects in the SLS algorithm development comprise al- rithm design, empirical analysis techniques, problem-speci?c background, and background knowledge in several key disciplines and areas, including computer science, operations research, arti?cial intelligence, and statistics. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5752 606 $aComputer programming 606 $aArtificial intelligence?Data processing 606 $aData structures (Computer science) 606 $aInformation theory 606 $aInformation retrieval 606 $aComputer architecture 606 $aAlgorithms 606 $aComputer science 606 $aProgramming Techniques 606 $aData Science 606 $aData Structures and Information Theory 606 $aData Storage Representation 606 $aAlgorithms 606 $aComputer Science Logic and Foundations of Programming 606 $aRecursos electrňnics en xarxa$2thub 606 $aCerca a Internet$2thub 606 $aProgramació estocŕstica$2thub 608 $aCongressos$2thub 608 $aLlibres electrňnics$2thub 615 0$aComputer programming. 615 0$aArtificial intelligence?Data processing. 615 0$aData structures (Computer science). 615 0$aInformation theory. 615 0$aInformation retrieval. 615 0$aComputer architecture. 615 0$aAlgorithms. 615 0$aComputer science. 615 14$aProgramming Techniques. 615 24$aData Science. 615 24$aData Structures and Information Theory. 615 24$aData Storage Representation. 615 24$aAlgorithms. 615 24$aComputer Science Logic and Foundations of Programming. 615 7$aRecursos electrňnics en xarxa 615 7$aCerca a Internet 615 7$aProgramació estocŕstica 676 $a005.11 702 $aStützle$b Thomas$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aBirattari$b Mauro$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aHoos$b Holger H$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996465636503316 996 $aEngineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics$9772147 997 $aUNISA