SLS 2007
Engineering Stochastic Local Search Algorithms
Designing, Implementing and Analyzing Effective Heuristics
6-8 September 2007. Brussels, Belgium
Home
Call for Papers
Committee
Proceedings
Program
Best Paper Award
Tutorials
Calendar
Submission
Registration
Practicalities
Location
Accomodation
ConfTool
Doctoral Symposium

Workshop Program

The workshop will be held from 6 to September 8 at the Université Libre de Bruxelles. Click here for a map of room locations.

Thursday, 6 September 2007

08:30-16:00 Registration

09:30 SLS Engineering: An Introduction
Thomas Stützle, Mauro Birattari, and Holger H. Hoos

10:30-11:00 Coffee break

11:00-12:00 Oral Presentation Session 1
  • 11:00 The Importance of Being Careful
    Arne Lokketangen

  • 11:30 Implementation Effort and Performance
    Paola Pellegrini and Mauro Birattari


12:00 Preview Highlights
3 minute preview highlights of all short papers of SLS workshop
  • A Set Covering Approach for the Pickup and Delivery Problem with General Constraints on Each Route
    Hideki Hashimoto, Youichi Ezaki, Mutsunori Yagiura, Koji Nonobe, Toshihide Ibaraki, Arne Lokketangen

  • Simple Meta-heuristics Using the Simplex Algorithm for Non-linear Programming
    Joao Pedro Pedroso

  • Formulation Space Search for Circle Packing Problems
    Nenad Mladenovic, Frank Plastria, and Dragan Urosevic

  • EasySyn++: A Tool for Automatic Synthesis of Stochastic Local Search Algorithms
    Luca Di Gaspero and Andrea Schaerf

  • Solving a Bi-objective Vehicle Routing Problem by Pareto Ant Colony Optimization
    Joseph M. Pasia, Karl F. Doerner, Richard F. Hartl, and Marc Reimann

  • A Study of Neighborhood Structures for the Multiple Depot Vehicle Scheduling Problem
    Benoit Laurent, Jin-Kao Hao

  • Local Search in Complex Scheduling Problems
    Thijs Urlings and Ruben Ruiz

  • A Multi-sphere Scheme for 2D and 3D Packing Problems
    Takashi Imamichi, Hiroshi Nagamochi

  • Human-Guided Enhancement of a Stochastic Local Search: Visualization and Adjustment of 3D Pheromone
    Jaya Sreevalsan-Nair, Meike Verhoeven, David L. Woodruff, Ingrid Hotz, Bernd Hamann

12:30-15:00 Poster Session
Poster presentation of papers from the Preview Highlights
Sandwich lunch is served during the poster session

15:00-16:30 Oral Presentation Session 2

  • 15:00 A Path Relinking Approach for the Multi-Resource Generalized Assignment Problem
    Mutsunori Yagiura, Akira Komiya, Kenya Kojima, Koji Nonobe, Hiroshi Nagamochi, Toshihide Ibaraki, and Fred Glover

  • 15:30 A Practical Solution using Simulated Annealing for General Routing Problems with Nodes, Edges, and Arcs
    Hisafumi Kokubugata, Ayako Moriyama, and Hironao Kawashima

  • 16:00 A Bidirectional Greedy Heuristic for the Subspace Selection Problem
    Dag Haugland

16:30-17:00 Coffee break


17:00-18:00 Tutorial 1: An Overview of Software Framework for SLS Methods
Luca Di Gaspero

19:00 Workshop dinner
The organizing committee of the SLS 2007 workshop would like to invite all participants to a social dinner at the Restaurant La Mirabelle, 459, Chaussee de Boondeal.
We will meet on Thursday, 6 at 18:45 just after Tutorial 1, at the workshop location and head down to the restaurant together. Please try and remember to have your invitation with you. Guest invitations can be purchased at the SLS 2007 registration desk.

Friday, 7 September 2007

09:00-16:00 Registration

09:30 Tutorial 2: Empirical Methods for the Analysis of Algorithms
Marco Chiarandini and Luis Paquete

10:30-11:00 Coffee break

11:00-12:00 Oral Presentation Session 3
  • 11:00 Tuning SLS through Animation and Graphics: an Extended Walk-through
    Steven Halim and Roland Yap

  • 11:30 Tuning the Performance of the MMAS Heuristic
    Enda Ridge and Daniel Kudenko

  • 12:00 Doctoral Symposium: Preview Highlights
    3 minute preview highlights of papers of Doctoral Symposium
    • Communication policies for a Parallel Multi-colony ACO algorithm with Identical Colonies
      Max Manfrin, Mauro Birattari, Thomas Stützle, and Marco Dorigo

    • Parametric Models of Search Progression
      Johan Oppen and David L. Woodruff

    • Sampling Strategies and Local Search for Stochastic Combinatorial Optimization
      Prasanna Balaprakash, Mauro Birattari, Thomas Stützle, and Marco Dorigo

    • Development of Algorithms to Knowledge Discovery. Swarm Intelligence and Rough Set Theory as tools.
      Yudel Gomez, Rafael Bello, and Ann Nowe

    • Two Phase Stochastic Local Search Algorithms for the Biobjective Traveling Salesman problem
      Thibaut Lust and Jacques Teghem

    • A Multi-sphere Scheme for 2D and 3D Packing Problems
      Takashi Imamichi, Hiroshi Nagamochi

    • Novel Genetic Algorithm Crossover Approaches for Time-Series Problems
      Paul M. Godley, Julie Cowie, David E. Cairns

    • Implementation of Local Search algorithms for Solving the Genomic Median Problem
      Renaud Lenne, Christine Solnon, Thomas Stützle, Eric Tannier, and Mauro Birattari

    • Parametrized Random Greedy Algorithms for the Heterogeneous VRP with Time Windows
      Zhi Yuan and Armin Fügenschuh

    • On the Potential of Automatic Algorithm Configuration
      Frank Hutter

    • Composing Particle Swarm Optimization Algorithms
      Marco A. Montes de Oca, Thomas Stützle, Mauro Birattari, and Marco Dorigo

    • A study of Stochastic Local Search Algorithms for the Quadratic Assignment Problems
      Mohamed Saifullah Bin Hussin, Thomas Stützle, and Mauro Birattari

    • Study of Ant Colony Optimization Algorithm for a Biobjective Permutation Flowshop Problem
      Trung Truc Huynh, Thomas Stützle, Mauro Birattari, and Yves De Smet

    12:30-15:00 Doctoral Symposium: Poster Session
    Poster presentation of papers from the Doctoral Symposium
    Sandwich lunch is served during the poster session

    15:00-16:30 Oral Presentation Session 4

    • 15:00 EasyAnalyzer: An Object-Oriented Framework for the Analysis of Stochastic Local Search Algorithms
      Luca Di Gaspero, Andrea Roli, and Andrea Schaerf

    • 15:30 Mixed Models for the Analysis of Local Search Components
      Joergen Bang-Jensen, Marco Chiarandini, Yuri Goegebeur, and Bent Joergensen

    • 16:00 An Algorithm Portfolio for the Sub-graph Isomorphism Problem
      Roberto Battiti and Franco Mascia

    16:30-17:00 Coffee break


    17:00-18:00 Tutorial 3: Basic and Advanced Statistic Techniques for Algorithm Engineering
    Ruben Ruiz


    Saturday, 8 September 2007

    09:30 Tutorial 4: Reactive Search
    Roberto Battiti

    10:30-11:00 Coffee break

    11:00-12:00 Oral Presentation Session 5
    • 11:00 Comparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions
      Frank Neumann, Dirk Sudholt, and Carsten Witt

    • 11:30 Probabilistic Beam Search for the Longest Common Subsequence Problem
      Christian Blum and Maria J. Blesa

    12:15 Panel discussion (topic to be announced)
    Sandwich lunch is served during the discussion

    14:15 Best Paper Award, Farewell