Amazon cover image
Image from Amazon.com

Engineering stochastic local search algorithms : designing, implementing and analyzing effective heuristics : international workshop, SLS 2007, Brussels, Belgium, September 6-8, 2007 : proceedings / Thomas Stützle, Mauro Birattari, Holger H. Hoos (eds.).

By: Contributor(s): Material type: TextTextSeries: Lecture notes in computer science ; 4638. | LNCS sublibrary. SL 1, Theoretical computer science and general issues.Publication details: Berlin ; New York : Springer, ©2007.Description: 1 online resource (x, 221 pages) : illustrationsContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783540744467
  • 3540744460
  • 3540744452
  • 9783540744450
Other title:
  • SLS 2007
Subject(s): Genre/Form: Additional physical formats: Print version:: Engineering stochastic local search algorithms.DDC classification:
  • 005.1 22
LOC classification:
  • QA76.9.A43 S57 2007eb
Online resources:
Contents:
The 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.
In: Springer e-booksSummary: Annotation This book constitutes the refereed proceedings of the International Workshop on Engineering Stochastic Local Search Algorithms 2007, held in Brussels, Belgium, September 6-8, 2007. The 12 revised full papers presented together with 9 short papers were carefully reviewed and selected from more than 50 submissions. The topics include Methodological developments, behavior of SLS algorithms, search space analysis, algorithm performance, tuning procedures, AI/OR techniques and dynamic behaviour.
Holdings
Item type Current library Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library eBook LNCS Available
Total holds: 0

Includes bibliographical references and index.

Print version record.

Annotation This book constitutes the refereed proceedings of the International Workshop on Engineering Stochastic Local Search Algorithms 2007, held in Brussels, Belgium, September 6-8, 2007. The 12 revised full papers presented together with 9 short papers were carefully reviewed and selected from more than 50 submissions. The topics include Methodological developments, behavior of SLS algorithms, search space analysis, algorithm performance, tuning procedures, AI/OR techniques and dynamic behaviour.

The 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.

Powered by Koha