SLS 2007: Brussels, Belgium

Thomas Stützle, Mauro Birattari, Holger H. Hoos (Eds.): Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics, International Workshop, SLS 2007, Brussels, Belgium, September 6-8, 2007, Proceedings. Lecture Notes in Computer Science 4638 Springer 2007, ISBN 978-3-540-74445-0 BibTeX

Arne Løkketangen:
The Importance of Being Careful. 1-15
Electronic Edition (link) BibTeX
Steven Halim, Roland H. C. Yap:
Designing and Tuning SLS Through Animation and Graphics: An Extended Walk-Through. 16-30
Electronic Edition (link) BibTeX
Paola Pellegrini, Mauro Birattari:
Implementation Effort and Performance. 31-45
Electronic Edition (link) BibTeX
Enda Ridge, Daniel Kudenko:
Tuning the Performance of the MMAS Heuristic. 46-60
Electronic Edition (link) BibTeX
Frank Neumann, Dirk Sudholt, Carsten Witt:
Comparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions. 61-75
Electronic Edition (link) BibTeX
Luca Di Gaspero, Andrea Roli, Andrea Schaerf:
EasyAnalyzer: An Object-Oriented Framework for the Experimental Analysis of Stochastic Local Search Algorithms. 76-90
Electronic Edition (link) BibTeX
Jørgen Bang-Jensen, Marco Chiarandini, Yuri Goegebeur, Bent Jørgensen:
Mixed Models for the Analysis of Local Search Components. 91-105
Electronic Edition (link) BibTeX
Roberto Battiti, Franco Mascia:
An Algorithm Portfolio for the Sub-graph Isomorphism Problem. 106-120
Electronic Edition (link) BibTeX
Mutsunori Yagiura, Akira Komiya, Kenya Kojima, Koji Nonobe, Hiroshi Nagamochi, Toshihide Ibaraki, Fred Glover:
A Path Relinking Approach for the Multi-Resource Generalized Quadratic Assignment Problem. 121-135
Electronic Edition (link) BibTeX
Hisafumi Kokubugata, Ayako Moriyama, Hironao Kawashima:
A Practical Solution Using Simulated Annealing for General Routing Problems with Nodes, Edges, and Arcs. 136-149
Electronic Edition (link) BibTeX
Christian Blum, Maria J. Blesa:
Probabilistic Beam Search for the Longest Common Subsequence Problem. 150-161
Electronic Edition (link) BibTeX
Dag Haugland:
A Bidirectional Greedy Heuristic for the Subspace Selection Problem. 162-176
Electronic Edition (link) BibTeX

Short Papers

Luca Di Gaspero, Andrea Schaerf:
EasySyn++: A Tool for Automatic Synthesis of Stochastic Local Search Algorithms. 177-181
Electronic Edition (link) BibTeX
Jaya Sreevalsan-Nair, Meike Verhoeven, David L. Woodruff, Ingrid Hotz, Bernd Hamann:
Human-Guided Enhancement of a Stochastic Local Search: Visualization and Adjustment of 3D Pheromone. 182-186
Electronic Edition (link) BibTeX
Joseph M. Pasia, Karl F. Doerner, Richard F. Hartl, Marc Reimann:
Solving a Bi-objective Vehicle Routing Problem by Pareto-Ant Colony Optimization. 187-191
Electronic Edition (link) BibTeX
Hideki Hashimoto, Youichi Ezaki, Mutsunori Yagiura, Koji Nonobe, Toshihide Ibaraki, Arne Løkketangen:
A Set Covering Approach for the Pickup and Delivery Problem with General Constraints on Each Route. 192-196
Electronic Edition (link) BibTeX
Benoît Laurent, Jin-Kao Hao:
A Study of Neighborhood Structures for the Multiple Depot Vehicle Scheduling Problem. 197-201
Electronic Edition (link) BibTeX
Thijs Urlings, Rubén Ruiz:
Local Search in Complex Scheduling Problems. 202-206
Electronic Edition (link) BibTeX
Takashi Imamichi, Hiroshi Nagamochi:
A Multi-sphere Scheme for 2D and 3D Packing Problems. 207-211
Electronic Edition (link) BibTeX
Nenad Mladenovic, Frank Plastria, Dragan Urosevic:
Formulation Space Search for Circle Packing Problems. 212-216
Electronic Edition (link) BibTeX
João Pedro Pedroso:
Simple Metaheuristics Using the Simplex Algorithm for Non-linear Programming. 217-221
Electronic Edition (link) BibTeX