ACCEPTED PAPERS
The list of accepted papers is available. Following the link you can also find the instructions for the submission of the camera-ready version of the papers.
Out of 37 submissions, we accepted 13 papers,
which yields an acceptance rate of 35.1%.
The decision on the papers is based on (at least) two referee reports
and on an evaluation by the workshop chairs. We expect you to follow
carefully the comments of the referees. Note that the decision of
acceptance is conditional to your implementation of the comments of the
referees.
PROGRAM
The Workshop starts on August 29 (Monday) with the check-in of the participants at the reception desk and a formal opening. Additionally, every morning there will be a short time for participants who do not arrive on Monday to register. The Workshop will end on August 31 (Wednesday) in the afternoon.
Each accepted paper is allocated a time slot of 30 minutes (25-minutes talk plus 5 minutes for questions).
The Conference intends to bring together leading researchers in Metaheuristics and provide them with a relaxed atmosphere for interaction and discussion. The number and distribution of the talks is planned with this goal in mind. Common lunches with long lunch breaks and one free afternoon are purposely planned.
PRELIMINARY SCHEDULE
Monday, August 29, 2005
09:00-11:15 Registration
11:15-11:30 Workshop opening
11:30-12:30 Session 1
11:30-12:00 A Taxonomy of Cooperative Search Algorithms (M.El-Abd and M.Kamel) 12:00-12:30 Parametrized Greedy Heuristics in Theory and Practice (A.Fuegenschuh)
13:00 Lunch
15:00-16:30 Session 2
15:00-15:30 A Hybrid GRASP-Path Relinking Algorithm for the Capacitated p-hub Median Problem (M.Pérez, F.Almeida, J.M.Moreno) 15:30-16:00 A Hybrid GRASP with Data Mining for the Maximum Diversity Problem (L.F.Santos, M.H.Ribeiro, A.Plastino, S.L.Martins) 16:00-16:30 Fast Ejection Chain Algorithms for Vehicle Routing with Time Windows (H.M.J.Sontrop, S.P. van der Horn, and M.Uetz)
16:30-17:00 Coffee break
17:00-18:00 Session 3
17:00-17:30 Comparing parallelization of an ACO : message passing vs. shared-memory (P.Delisle, M.Gravel, M.Krajecki, C.Gagné, W.L.Price) 17:30-18:00 A New Multi-Objective Particle Swarm Optimization Algorithm Using Clustering Applied to Automated Docking (S.Janson and D.Merkle)
around 20:00 Social dinner
Tuesday, August 30, 2005
09:00-10:30 Session 4
9:00- 9:30 Hybrid tabu search for lot sizing problems (J.P.Pedroso and M.Kubo) 9:30-10:00 A Hybrid Genetic and Variable Neighborhood Descent for Probabilistic SAT Problem (Z.Ognjanovic, U.Midic, N.Mladenovic) 10:00-10:30 Evolution Strategies and Threshold Selection (T.Bartz-Beielstein)
10:30-11:00 Coffee break
11:00-12:30 Session 5
11:00-11:30 An LP-based hybrid heuristic procedure for the generalized assignment problem with special ordered sets (A.P.French and J.M.Wilson) 11:30-12:00 3D Inter-Subject Medical Image Registration by Scatter Search (O.Cordón, S.Damas, J.Santamaría, and R.Martí) 12:00-12:30 A Hybrid Meta-Heuristic Approach for Natural Gas Pipeline Network Optimization (C.Borraz-Sánchez, R.Z.Ríos-Mercado)
12:30-12:45 Workshop closing
13:00 Lunch
15:00 Excursion (Visit of the Freixenet cellars with cava tasting)