modify height
PROGRAM

The Workshop starts on October 13 (Friday) with the check-in of the participants at the reception desk and a formal opening. Additionally, Saturday morning there will be a short time for participants who do not arrive on Friday to register. The Workshop will end on October 14 (Saturday) 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 excursion on Saturday afternoon are purposely planned.

PRELIMINAR SCHEDULE

Friday, October 13, 2006

08:30-10:30 Registration

10:30-10:45 Workshop opening

10:45-11:15 Invited Paper: A Survey on Hybrid Metaheuristics (G. Raidl)

11:15-12:15 Tutorial on hybrid metaheuristics (E. Talbi)

13:00 Lunch

15:00-16:30 Session 1
15:00-15:30 Packing Problems with Soft Rectangles
(T. Ibaraki and K. Nakamura)
15:30-16:00 Exact Color Reassignment in Tabu Search for the Graph Set T-Colouring Problem
(M. Chiarandini, T. Stuetzle and K.S. Larsen)
16:00-16:30 Improvement in the performance of island based genetic algorithms through path relinking
(L. delaOssa, J.A. Gámez and J.M. Puerta)

16:30-17:00 Coffee break

17:00-18:30 Session 2
17:00-17:30 Using datamining techniques to help metaheuristics: a short survey
(L. Jourdan, C. Dhaenens, and E. Talbi)
17:30-18:00 An iterated local search heuristic for a capacitated hub location problem
(I. Rodríguez-Martín and J.J. Salazar-González)
18:00-18:30 Hybrid Approaches for Rostering: a Case Study in the Integration of Constraint Programming and Local Search
(R. Cipriano, L. Di Gaspero, and A. Dovier)

20:30 Social dinner

Saturday, October 14, 2006

09:00-11:00 Session 3
9:00-9:30 A Reactive Greedy Randomized Variable Neighborhood Tabu Search for the Vehicle Routing Problem with Time Windows
(P.P. Repoussis, D.C. Paraskevopoulos, C.D. Tarantilis, and G. Ioannou)
9:30-10:00 Using memory to improve the VNS metaheuristic for the design of SDH/WDM networks
(B. Melián-Batista)
10:00-10:30 Multi-level ant colony optimization for DNA sequencing by hybridization
(C. Blum and M. Yábar Vallés)
10:30-11:00 Multi-Population Parallel Genetic Algorithm for Highly Constrained Continuous Galvanizing Line Scheduling
(M. Kapanoglu and I. Ozan Koc)

11:00-11:30 Coffee break

11:30-13:00 Session 4
11:30-12:00 Scheduling Social Golfers with Memetic Evolutionary Programming
(C. Cotta, I. Dotú, A.J. Fernández, P. Van Hentenryck)
12:00-12:30 Incorporating Inference into Evolutionary Algoritms for Max-CSP
(M. Ionita, C. Croitoru, and M. Breaban)
12:30-13:00 One-Go Evolution Strategy/Quasi-Newton Hybridizations
(T. Bartz-Beielstein, M. Preuss, G. Rudolph)

13:00-13:15 Workshop closing

13:15 Lunch

16:00 Excursion