Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics International Workshop, SLS 2007, Brussels, Belgium, September 6-8, 2007, Proceedings /

Stochastic 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 conceptua...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor Corporativo: SpringerLink (Online service)
Otros Autores: Stützle, Thomas (Editor ), Birattari, Mauro (Editor ), Hoos, Holger H. (Editor )
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2007.
Edición:1st ed. 2007.
Colección:Theoretical Computer Science and General Issues, 4638
Temas:
Artificial intelligence-Data processing.
Information retrieval.
Computer architecture.
Algorithms.
Computer science-Mathematics.
Mathematical statistics.
Data mining.
Information storage and retrieval systems.
Data Science.
Data Storage Representation.
Probability and Statistics in Computer Science.
Data Mining and Knowledge Discovery.
Information Storage and Retrieval.
Acceso en línea:Texto Completo
Tabla de Contenidos:
  • 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.

Ejemplares similares