The robust capability of evolutionary algorithms (EAs) to find solutions to difficult problems
has permitted them to become popular as optimization and search techniques for many …

The ability of ant colonies to form paths for carrying food is rather fascinating. When
considering the scale of ants, this path-finding problem is complex: ants only have a local …

This paper investigates the capabilities of the Ant Colony Optimization (ACO) meta-heuristic
for solving the maximum clique problem, the goal of which is to find a largest set of pairwise …

Distribution of constituents within a composite material dictates important constitutive
properties and is therefore of interest for all multiphase materials including nano-, micro …

This paper proposes a hybrid evolutionary algorithm (EA) dealing with population-based
incremental learning (PBIL) and some efficient local search strategies. A simple PBIL using …

Carbon nanotubes (CNTs) and carbon nanofirbers (CNFs) have excellent properties
(mechanical, electrical, magnetic, etc.), which can make them effective nanoreinforcements …

This paper presents a study for the dynamic selection of operators in a local search process.
The main purpose is to propose a generic autonomous local search method which manages …

Ce document rassemble différents éléments introduits dans le cours de Master recherche.
On définit tout d'abord dans la section 1 ce que l'on entend par «problème combinatoire», et …

On qualifie de «combinatoires» les problèmes dont la résolution se heurte à une explosion
du nombre de combinaisons à explorer. C'est le cas par exemple lorsque l'on cherche à …

Current planning approaches for home care services do not generally support the social and
human dimension of planning. They focus on optimization criteria that are easily …