Room 1

Room 2

Room 3

8h

Registration

9h

Opening talk

9h30

Tutorial - Dirk Thierens

From Multi-start Local Search   to Genetic Local Search:           a Practitioner's  Guide

Software Frameworks for Metaheuristics

E.G. Talbi  - Introduction

Networking

11h

Coffee Break

11h30

Tutorial- Marco Dorigo

Ant Colony Optimization:        An Introduction

ParadisEO-EO            Population based metaheuristics           (evolutionary algorithms,  particle swarm optimization)

Transport and logistic

13h00

Lunch

14h30

Tutorial - Celso Ribeiro

Metaheuristics for Optimization Problems in Sports

ParadisEO-MO               Solution based metaheuristics           (local search, tabu search, simulated annealing, ILS, VNS)

Multi-objective
Metaheuristics

16h

Coffee Break

16h30

Tutorial – Thomas Stüztle

Stochastic
Local Search

ParadisEO-MOEO              Multi-objective Metaheuristics

Multi-objective
Metaheuristics

Room 1

Room 2

Room 3

Room 4

9h

Knapsack

Artificial ants and collective intelligence

Transport and logistic

Supply Chain Network Design Heuristics

10h20

Coffee Break

10h50

Metaheuristics and Grid Computing

Meta-Heuristics for Security, reliability and Trust

Multi-criteria         decision making

Metaheuristics and Real-World problems

12h10

Lunch

14h

Scheduling

ANTS / PSO

Routing

Metaheuristics and Real-World problems

15h40

Coffee Break

16h10

Networking

ANTS / PSO

Routing

Datamining

19h30

Conference Dinner

Room 1

Room 2

Room 3

Room 4

9h

Theory

Metaheuristics and Structural Biology

Transport and Logistic

Parallel implementation of Metaheuristics

10h20

Coffee Break

10h50

Scheduling

Metaheuristics and Structural Biology

Electronic Design Automation …

Continuous optimization

12h15

Closing

9h30

Room 1

From Multi-start Local Search to Genetic Local Search: a Practitioner's Guide

Dirk Thierens 

Multi-start Local Search (MLS) is a powerful heuristic search paradigm for tackling combinatorial optimization problems.  The performance of MLS can be further improved by recognizing that it is basically an unbiased random search in the space of local optima. Transforming MLS into a biased search leads to Iterated Local Search (ILS) and Genetic Local Search (GLS).  In this talk we take a practical point of view and discuss how a practitioner can smoothly progress from MLS to ILS and further to GLS  if his demands on performance require so.  We will focus on the statistical features of the fitness landscape  that can guide a practitioner when extending MLS into ILS and further  into GLS. The discussion is illustrated with extensive experimental results on the graph bipartitioning and the graph coloring problem.

11h30

Room 1

Ant Colony Optimization: An Introduction

Marco Dorigo

Abstract

14h30

Room 1

Metaheuristics for Optimization Problems in Sports 

Celso Ribeiro

Abstract

16h30

Room 1

Stochastic Local Search

Thomas Stüztle

Abstract

9h30

Room 2

Software frameworks for Metaheuristics

Introduction

El-Ghazali Talbi 

11h30

Room 2

ParadisEO-EO, Introduction to PEO

Alexandru Tantar, Arnaud Liefooghe

Technical staff: Jean-Charles Boisson, Jérôme Brongniart, Jérémie Humeau

Paradiseo-EO deals with population based metaheuristics, it is a templates-based, ANSI-C++ compliant evolutionary computation library (evolutionary algorithms, particle swarm optimization...). It contains classes for almost any kind of evolutionary computation you might come up to - at least for the ones we could think of. It is component-based, so that if you don't find the class you need in it, it is very easy to subclass existing abstract or concrete classes.

14h30

Room 2

ParadisEO-MO 

Jean-Charles Boisson

Technical staff: Jérôme Brongniart, Jérémie Humeau, Arnaud Liefooghe, Alexandru Tantar

Single solution-based metaheuristics correspond to the family of local search algorithms. From an initial solution (randomly generated or obtained by another optimization method), the aim is to find a better solution. ParadisEO-MO proposes several local search schemes, from the simple hill climbing to the iterated local search. In order to use ParadisEO-MO, the user needs only to design how a solution can be transformed into another one. It is the notion of move.

16h30

Room 2

ParadisEO-MOEO

Arnaud Liefooghe

Technical staff: Jean-Charles Boisson, Jérôme Brongniart, Jérémie Humeau, Alexandru Tantar

Paradiseo-MOEO provides tools for the flexible design of metaheuristics for multi-objective optimization. It embeds some features and techniques for a priori and a posteriori resolution methods and aims to provide a set of classes allowing to ease and speed up the development of computationally efficient programs : Encoding mecanisms for multi-objective optimization problems of discrete and combinatorial nature, fitness assignment schemes, diversity preservation mechanisms, elitism, performance metrics and easy-to-use state-of-the-art multi-objective evolutionary algorithms NSGA-II, IBEA

9h30

Room 3

Networking

P. Bouvry

• Ahmed Riadh REBAI and Saïd Hanaf - An Enhancement Heuristic Algorithm for Efficient WLAN IEEE802.11 Handoff Procedure
• Inmaculada Rodriguez-Martin and Juan José Salazar González - A Local Branching Heuristic for the Capacitated Fixed-Charge Network Design Problem

11h30

Room 3

Transport and Logistic

F. Clautiaux

• Lian Lian and Emmanuel Castelain - A heuristic division method to solve a General Delivery
• Tien-Tuan Dao, Alexandre Nace, Dritan Nace and Xiaokang Cao - The Multi-Period Renewal Equipment Problem
• François Clautiaux and Saïd Hanafi - Using Tabu Search to generate maximal dual-feasible functions, application to the bin packing problem

14h30

Room 3

Multi-objective Metaheuristics

C. Dhaenens

• Arnaud Liefooghe, Laetitia Jourdan and El-Ghazali Talbi - Metaheuristics and Hybrid Metaheuristics for the Bi-objective Ring Star Problem
• Abou El Hassane Benyamina - An Hybrid algorithm for Mapping on NoC Architectures
• Mario Camara Sola, Julio Ortega and Francisco de Toro Negro - A Diversity Enhanced Single Front Multiobjective Algorithm for Dynamic Optimization
• Meziane Aider and Chahrazad Adiche - A branch and bound algorithm for solving multi-objective assignment problem

16h30

Room 3

Multi-objective Metaheuristics

L. Jourdan

• Mohamed Hachimi and Brahim Aghezzaf - An Interactive Multiobjective Genetic Algorithm Using Aspirations
• Meziane Aider and Chahrazad Adiche - Hybrid method for solving the multi-objective assignment problem
• Brahim Aghezzaf and Mohamed Naimi - On the performance of the two-stage recombination operator in the context of the multiobjective 0/1 knapsack problem
• Celso Ribeiro and Alexandre Duarte - A bicriteria ILS heuristic for combinatorial problems: A case study

9h

Room 1

Knapsack

S. Hanafi

• Raid mansi, Luce Brotcorne and Saïd Hanafi - Hybrid Heuristic for the Bilevel Knapsack Problem
• Amine Lamine, Saïd Hanafi and Mahdi Khemakhem - Oscillation strategy and adaptative memory for Solving the Multi-Choice Multidimensional Knapsack Problem
•  Amine Lamine, Saïd Hanafi, Mahdi Khemakhem and Christophe Wilbaut - An iterative linear programming-based heuristic to the multiple-choice multidimensional knapsack problem
• Ali Khanafer, François Clautiaux and Talbi El-Ghazali - How Tree Decomposition Can Guide Heuristics for Bin Packing Problems with Conflicts

9h

Room 2

Artificial Ants and Collective Intelligence based Metaheuristics

N. Monmarché

• Bassem Jarboui, Mansour Eddaly, Patrick Siarry and Abdelwaheb Rebaï - Particle Swarm Optimization for permutation flowshop with blocking
• Serge Fenet - Artistic rendering with a particle swarm
• Akil Elkamel, Salma Jamoussi and Mariem Mariem Gzara - CAC: An Ant Clustering Algorithm

• Violaine Antoine, Nicolas Monmarché and Slimane Mohamed - Data Clustering with Artificial Ants: the API algorithm case study

9h

Room 3

Transport and Logistic

F. Clautiaux

• Imen Ome Ezzine, Habib Chabchoub and Frederic Semet - Heuristics for the traveling repairman problem
• Rachida Abounacer, Ghizlane Bencheikh, Jaouad Boukachour, btissam dkhissi and Ahmed Al Hilali Alaoui - Multi colony of ants to solve the problem of transportation staff
• Milka Uzunova, Daniel Jolly and Emil NIkolov - Analytical solution of the macroscopic traffic flow model. Traffic flow simulation model viewed as a distributed parameter system

9h

Room 4

Supply Chain Network design Heuristics

W. Klibi

• Jose Eduardo Pecora, Angel Ruiz and Patrick Soriano - Iterative Restricted Space Search Framework
• Jose Eduardo Pecora, Angel Ruiz and Patrick Soriano - Iterative Restricted Space Search applied to a location-allocation problem
• Afifa Kombas, BENAISSA MOUNIR, Chabchoub Habib and BOUKACHOUR Jaouad. A multi-product and multi-period facility location model for reverse logistics
• Walid Klibi, Alain Martel and Adel Guitouni - The Impact of Anticipation Quality on Supply Network Design Robustness

10h20

Coffee break

10h50

Room 1

Metaheuristics and Grid Computing

N. Melab

• Aletéia Araújo, Cristina Boeres, Vinod Rebello and Celso Ribeiro - Autonomic Parallelization of Metaheuristics in Computational Grids
• Luis Santos, Simone Martins and Alexandre Plastino - Parallelization Strategies for DM-GRASP heuristic
• Abdelbasset Essabri, Mariem Mariem Gzara and Taicir Loukil - A Distributed Multi-objective Evolutionary Algorithm with Exploration-Exploitation Balance
• Benkhider Sadjia and Drias Habiba - A new memetic approach for classification rule extraction problem
• Giandomenico Spezzano, Gianluigi Folino and Giuseppe Papuzzo - A Bio-inspired Adaptive Framework for Self-Managing Service-based Workflows in a Grid Environment

10h50

Room 2

Metaheuristics for Security, Reliabilty and Trust

P. Bouvry and G. Danoy 

• ·         Sebastien Varrette and Marek Ostaszewski. Nature inspired Algorithm-Based Fault Tolerance on Global Computing Platforms. Application to Symbolic Regression.
• ·         Marcin Seredynski, Pascal Bouvry and Mieczyslaw Klopotek. Evolutionary Approach Towards Analysis of Evolution of Trust in Ad Hoc Networks
• ·         Francisco Chicano and Enrique Alba. Ant Colony Optimization for Testing Concurrent Systems: Analysis of Scalability
• Julio Cesar Hernandez, Juan M. Estevez-Tapiador, Nicolas Veyrat-Charvillon and Jean-Jacques Quisquater. Ayin, A Collision-Free Function for Low-Cost RFID Systems
• Noura Beji, Bassem Jarboui and Patrick Siarry. A Differential Evolution Algorithm for Redundancy

10h50

Room 3

Multi-criteria decision making

H. Chabchoub

• Emilia Tantar, Clarisse Dhaenens, Jose Figueira and El-Ghazali Talbi - Comparison of interactive Tools for multi-objective combinatorial optimization
• Mehmet Sevkli, Selim Zaim and Ali Turkyilmaz - A Fuzzy ELECTRE Approach for Supplier Selection
• Paul Pitiot, Thierry Coudert, Laurent Geneste and Claude Baron - An expert knowledge reuse to guide evolutionary computation
• Aïda Kharrat, Habib Chabchoub and Belaid Aouni - An Interactive Simulated Annealing Technique for Goal Programming Model

10h50

Room 4

Metaheuristics and Real-World Problem

F. Luna

• Ricardo Aler, Cesar Estebanez and Jose Valls - Hybridization of Clustering and Local Search for the Frequency Assignment Problem
• Arnaud Zinflou, Caroline Gagné and Marc Gravel - Tackling the industrial car sequencing problem using genetic algorithm
• Burak Bilgin, Peter Demeester, Greet Vanden Berghe and Tony Wauters - A Model and a Hyperheuristic Approach for Automated Assignment of Patients to Beds in a Hospital
• Francisco Luna, Antonio Nebro, Juan J. Durillo and Enrique Alba - Large-scale real-world automatic frequency planning in GSM networks using GrEA

12h30

Lunch

14h

Room 1

Scheduling

J. Teghem

• ·          Frederic Guegnard and Marc Bourcerie - Tabu search method for single machine problem with time-dependent processing times
• ·          Adel Manaa and Chengbin Chu - Beam search for the dedicated two-processor task scheduling problem P2| fix_j | Σ w_jC_j
• ·          Walid Besbes, Jacques Teghem and Taicir Loukil - Minimizing the makespan for the hybrid flow shop problem with non-fixed availability constraints
• ·          Mohamed Bader-El-Den and Abdullah Alsheddy - Mutual Formulation of Workforce Scheduling Problem Using Genetic Programming Hyper-Heuristic
• ·          Emna Dhouib, Jacques Teghem and Taicir Loukil - Minimizing the number of tardy jobs in a permutation

14h

Room 2

ANTS / PSO

N. Monmarché

• ·          Toufic Barkat, Leila Mokhnache and Rida Abdessemed - Swarm Intelligence Application In Dielectric Materials
• ·          Patrick Albert, Laurent Henocque and Mathias Kleiner - Ant Colony Optimisation for Constraint-based Configuration
• ·          Abdelmadjid Boukra - Optimization of the response time in a data warehouse by a cooperative approach of metaheuristics.
• ·          Salim Bitam, Mohamed Batouche and El-Ghazali Talbi - A Taxonomy of Artificial Honeybee Colony Algorithms
• ·          Alexis Sepchat, Romain Clair, Nicolas Monmarché and Slimane Mohamed - Artificial ants and Accessible games for impaired players

14h

Room 3

Routing

T. Loukil

• ·          Semya Elaoud, Jacques Teghem and Taicir Loukil - Multiple crossover genetic algorithm for the multiobjective traveling salesman problem
• ·          Mohamed Amine Tahraoui, Abdelouhab Aloui and Zineb Habbas -  Using ACO for solving a multimodal transport problem
• ·          Houda Derbel - Iterative heuristic based on LP relaxation for the vehicle routing problem with time windows
• ·          Abdeljawed Sadok, Habib Chabchoub and Jacques Teghem - Periodic inventory routing problem: solving approach
• ·          Khaled Mili and Khaled Mellouli - The single straddle carrier routing problem

14h

Room 4

Metaheuristics and Real-World Problem

F. Luna

• ·          Czesaw Smutnicki - Cyclic job shop scheduling. Beyond original TSAB application
• ·          Richard Fuchshuber, Erick R. Fonseca, Luis F. M. Santos, Alexandre Plastino and Simone L. Martins - Exploring the Hybrid Metaheuristic DM-GRASP for Efficient Server Replication for Reliable Multicast
• ·          Johann Dréo - Multi-criteria meta-parameter tuning for mono-objective stochastic metaheuristics
• ·          hamadi hasni and Houssem Sabri - On a distributed hybrid genetic algorithm for solving the container loading problem with no orientation constraints
• ·          Mohamed Ben Ali, Moncef Gossa, Mohamed Sassi and Youssef Harrath - A multi-Objective genetic algorithm for job shop scheduling under maintenance constraints

15h40h

Coffee Break

16h10

Room 1

Networking

P. Siarry

• ·          Brongniart Jerome, Clarisse Dhaenens and El-Ghazali Talbi. A Structure for Constrained Minimum Spanning Tree Local Searches
• ·          Mustapha Oughdi, Alexandre Caminada and Lamrous Sid - Space partitioning based on GA optimisation

Colouring
P. Siarry

• ·          Hend Bouziri, El Ghazali Talbi and Khaled Mellouli - The k-coloring fitness landscape
• ·          Lotfi Derbali, Sadok Bouamama, Moez Hammami and Khaled Ghedira - Multilevel Dynamic Distributed Double Guided Genetic Algorithm for the K-Graph Partitioning Problem

16h10

Room 2

ANTS / PSO

T. Stuetzle

• ·          Souad Mekni, Besma Fayech Chaar and Mekki Ksouri - Studying the Performance of Unified Particle Swarm Optimization on the Multi-objective Flexible Job Shop Scheduling Problems
• ·          Sahbi Boubaker and Fouazi M'sahli - Identification of a Hybrid Dynamical Switching System by Different variants of Particle Swarm Optimization
• ·          walid elloumi and Adel M. Alimi - Combinatory Optimization of ACO and PSO
• ·          Abbas Afshar and Shahrbanou Madadgar - Ant Algorithm for Continuous Hydropower Reservoir Optimization Problem
• ·          Metin Satir, Ekrem Manisali and Mehmet Sevkli - A Comparison Study between Discrete and Continuous Particle Swarm Optimization for Quadratic Assignment Problems
• Safa Khalouli, Fatima Ghedjati and Abdelaziz Hamzaoui. Using Ant Colony Optimization for solving a Multi-criteria Hybrid Flow Shop Scheduling Problem 

16h10

Room 3

Routing

C. Solnon

• ·          Prasanna Balaprakash, Mauro Birattari, Thomas Stuetzle and Marco Dorigo - Estimation-based stochastic local search algorithms for stochastic routing problems
• ·          Olfa Aouf Sammoud, Christine Solnon and Khaled Ghedira - Similarity based P-ACO for Dynamic Problems
• ·          Mostapha Khouadjia, Laetitia Jourdan and Talbi El-Ghazali - A particle swarm for the resolution of the Dynamic Vehicle Routing Problem
• ·          Jaber Jemai and Khaled Mellouli - A fuzzy tabu search for the vehicle routing problem with uncertain demands
• ·          Lemouari Ali and M. Benmohammed - Particle Swarm Method for a Vehicule Routing Problem with Pickup and Delivery
• ·          Emanuele Manni, Jeffrey Ohlmann and Barrett Thomas - A Compressed Annealing Heuristic for the Orienteering Problem with Time Windows

16h10

Room 4

Datamining

C.-E. Bichot

• ·          Alejandro Cervantes, Inés María Galván and Pedro Isasi - A Study of the Noise Sensitivity of a Particle Swarm Algorithm for Classification
• ·          Samia Chelloug, Yasser naamoune, Abdeldjallil bouguerra and Atef Benzarafa. A New Scheme Combining A Genetic Approach And SVM For Classifying Microarray Data
• ·          Manel Zribi - Contribution of a neural networks approach in the forecasting financial failure
• ·          Charles-Edmond Bichot - Application of the fusion-fission metaheuristic to document clustering

9h

Room 1

Theory

Y. Saika

• ·          Nicolas Levasseur, Patrice Boizumault and Samir Loudni - Conflict based neighborhood heuristics for VNS
• ·          Yohei Saika, Jun-ichi Inoue, Masato Okada and Hiroyuki Tanaka - Thermodynamics inspired computing for Bayes-optimal solution of inverse-halftoning problems
• ·          Kwon-Hee Lee, Sang-Mo Kang, Young-Chul Park, Won-Sik Joo and Jong-Kyu Kim - A Robust Optimization Using Approximation Model and Probability of Design-Success

9h

Room 2

Metaheuristics and Structural Biology

D. Merkle, C. Baldauf

• ·          Dragos Horvath, El-Ghazali Talbi and Sylvaine Roy. Force-field-based conformational sampling of proteins within the Docking@GRID project: status, results, issues
• ·          Christine Martin and Antoine Cornuéjols. Relevant features mining on protein-protein interfaces
• ·          Renaud Lenne, Solnon Christine, Thomas Stuetzle and Eric Tannier. Advances on Stochastic Local Search Algorithms for the Genomic Median Problem
• ·          Alexandru Tantar, Nouredine Melab and El-Ghazali Talbi. Locality on Protein-Ligand Docking Optimization

9h

Room 3

Transport and Logistic

R. Dupas

• ·          Xin Zhao, Gilles Goncalves and Rémy Dupas - A genetic algorithm to solving the dynamic vehicle routing problem with time windows and real-time travel times
• ·          Amine Lamine, Saïd Hanafi, Frederic Semet, El-Ghazali Talbi and François Clautiaux - Tabu Search for Profitable Vehicle Routing Problem with Time Windows
• ·          Nacima LABADI, Christian Prins and Mohamed Reghioui - A new metaheuristic for the split delivery capacitated arc routing problem
• ·          Antonio LaTorre, François Clautiaux, El-Ghazali Talbi and Jose-Maria Pena - VRP-extended: when confidence and fleet size are also important
•  

9h

Room 4

Parallel Implementation of Metaheuristics

M. Krajecki

• ·          Souhail Dhouib and Habib Chabchoub - Cooperation between simulated annealing algorithm and its derivates to optimize researches: COSAAD algorithm
• ·          Wojciech Bozejko, Czeslaw Smutnicki and Mieczyslaw Wodecki - A distributed hybrid metaheuristics for the job shop problem with non-identical parallel machines
• ·          Deleau Hervé, Michael Krajecki and Arnaud Renard - Experimenting a hybrid CSP solver on cluster architecture
• ·          Lars Schley - Development and Benefits of Co-Allocation Scheduling Heuristics for the High Energy Physics Community

10h20

Coffee break

10h50

Room 1

Scheduling

A. Rebaï

• Steve Ah kioon, Akif Asil Bulgak and Tolga Bektas - An ILP-embedded Tabu Search heuristic for the design of integrated cellular manufacturing systems with production planning and dynamic system reconfiguration
• Mansour Eddaly, Bassem Jarboui, Patrick Siarry and Abdelwaheb Rebaï - Hybrid Estimation of Distribution Algorithm for permutation flowshop problem
• Latifa Dekhici and Khaled Belkadi - Scheduling surgical Interventions under constraints
• Fatima El Khoukhi, Jaouad Boukachour, Ahmed El Hilali Alaoui and Tarik Lamoudan - Modelling and solving a Job shop problem with multiple transport robots and limited input / output buffers, based on "just-in-time" philosophy

10h50

Room 2

Metaheuristics and Structural Biology

D. Merkle, C. Baldauf

• Rasmus Fonseca, Martin Paluszewski and Pawel Winter - Protein Structure Prediction Using Bee Colony Optimization Metaheuristic
• Jean-Charles Boisson, Laetitia Jourdan, El-Ghazali Talbi and Dragos Horvath - A new tri-objective model for the flexible docking problem
• Rafael Baños, Paula Cordero, Angel Goñi and Juan Castellano - Simulation of a DNA Renaturalization process
• René Meier, Carsten Baldauf and Daniel Merkle - A Modular Framework for the Evaluation of Population-Based Algorithms for Molecular Docking

10h50

Room 3

Electronic Design, Automation…

O. Hammami

• Omar Hammami, Alia BELLABAS and Xinyu LI. Scheduling and Application-Specific Multiprocessor Iterative Codesign
• Hend liouane. Hybrid approach for pole assignment using LQR technique and Ant System metaheuristic
• Jun-ichi Inoue, Yohei Saika and Masato Okada. Quantum mechanics inspired decoding algorithm for error-correcting codes

10h50

Room 4

Continuous Optimization

P. Siarry

• Sebastien Aupetit, Nicolas Monmarché and Mohamed Slimane. New exploration operators for the API algorithm
• Khelil Naceur, Djerou Leila, Mohamed Batouche and Zerarka Abdelwahab. Numerical Integration using Particle Swarm Optimization

12h15

CLOSING