000 06021nam a22006615i 4500
001 978-3-540-74446-7
003 DE-He213
005 20240730175612.0
007 cr nn 008mamaa
008 100301s2007 gw | s |||| 0|eng d
020 _a9783540744467
_9978-3-540-74446-7
024 7 _a10.1007/978-3-540-74446-7
_2doi
050 4 _aQ336
072 7 _aUN
_2bicssc
072 7 _aCOM021000
_2bisacsh
072 7 _aUN
_2thema
082 0 4 _a005.7
_223
245 1 0 _aEngineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics
_h[electronic resource] :
_bInternational Workshop, SLS 2007, Brussels, Belgium, September 6-8, 2007, Proceedings /
_cedited by Thomas Stützle, Mauro Birattari, Holger H. Hoos.
250 _a1st ed. 2007.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2007.
300 _aX, 230 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v4638
505 0 _aThe Importance of Being Careful -- The Importance of Being Careful -- Designing and Tuning SLS Through Animation and Graphics: An Extended Walk-Through -- Implementation Effort and Performance -- Tuning the Performance of the MMAS Heuristic -- Comparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions -- EasyAnalyzer: An Object-Oriented Framework for the Experimental Analysis of Stochastic Local Search Algorithms -- Mixed Models for the Analysis of Local Search Components -- An Algorithm Portfolio for the Sub-graph Isomorphism Problem -- A Path Relinking Approach for the Multi-Resource Generalized Quadratic Assignment Problem -- A Practical Solution Using Simulated Annealing for General Routing Problems with Nodes, Edges, and Arcs -- Probabilistic Beam Search for the Longest Common Subsequence Problem -- A Bidirectional Greedy Heuristic for the Subspace Selection Problem -- Short Papers -- EasySyn++: A Tool for Automatic Synthesis of Stochastic Local Search Algorithms -- Human-Guided Enhancement of a Stochastic Local Search: Visualization and Adjustment of 3D Pheromone -- Solving a Bi-objective Vehicle Routing Problem by Pareto-Ant Colony Optimization -- A Set Covering Approach for the Pickup and Delivery Problem with General Constraints on Each Route -- A Study of Neighborhood Structures for the Multiple Depot Vehicle Scheduling Problem -- Local Search in Complex Scheduling Problems -- A Multi-sphere Scheme for 2D and 3D Packing Problems -- Formulation Space Search for Circle Packing Problems -- Simple Metaheuristics Using the Simplex Algorithm for Non-linear Programming.
520 _aStochastic local search (SLS) algorithms enjoy great popularity as powerful and versatile tools for tackling computationally hard decision and optimization pr- lems from many areas of computer science, operations research, and engineering. To a large degree, this popularity is based on the conceptual simplicity of many SLS methods and on their excellent performance on a wide gamut of problems, ranging from rather abstract problems of high academic interest to the very s- ci?c problems encountered in many real-world applications. SLS methods range from quite simple construction procedures and iterative improvement algorithms to more complex general-purpose schemes, also widely known as metaheuristics, 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, and overall resembled more an art than a science. However, in recent years it has become evident that at the core of this development task there is a highly complex engineering process, which combines various aspects of algorithm design with empirical analysis techniques and problem-speci?c background, and which relies heavily on knowledge from a number of disciplines and areas, including computer science, operations research, arti?cial intelligence, and statistics. This development process needs to be - sisted by a sound methodology that addresses the issues arising in the various phases of algorithm design, implementation, tuning, and experimental eval- tion.
650 0 _aArtificial intelligence
_xData processing.
_921787
650 0 _aInformation retrieval.
_910134
650 0 _aComputer architecture.
_93513
650 0 _aAlgorithms.
_93390
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aMathematical statistics.
_99597
650 0 _aData mining.
_93907
650 0 _aInformation storage and retrieval systems.
_922213
650 1 4 _aData Science.
_934092
650 2 4 _aData Storage Representation.
_931576
650 2 4 _aAlgorithms.
_93390
650 2 4 _aProbability and Statistics in Computer Science.
_931857
650 2 4 _aData Mining and Knowledge Discovery.
_9117286
650 2 4 _aInformation Storage and Retrieval.
_923927
700 1 _aStützle, Thomas.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9117287
700 1 _aBirattari, Mauro.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9117288
700 1 _aHoos, Holger H.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9117289
710 2 _aSpringerLink (Online service)
_9117290
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540744450
776 0 8 _iPrinted edition:
_z9783540842750
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v4638
_9117291
856 4 0 _uhttps://doi.org/10.1007/978-3-540-74446-7
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c89991
_d89991