Title :

A Cooperative Tree-based Hybrid GA-B&B Approach for Solving Challenging Permutation-based Problems

Author(s) :

Mehdi, Malika [Auteur]
Université du Luxembourg [Uni.lu]
Charr, Jean [Auteur]
Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174) [FEMTO-ST]
Melab, Nouredine [Auteur]
Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Talbi, El-Ghazali [Auteur]
Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Bouvry, Pascal [Auteur]
Université du Luxembourg [Uni.lu]

Conference title :

GECCO 2011, 13th Conf. on Genetic and Evolutionary Computation Conference

City :

Dublin

Country :

Irlande

Start date of the conference :

2011

Publication date :

2011

HAL domain(s) :

Informatique [cs]/Calcul parallèle, distribué et partagé [cs.DC]
Informatique [cs]/Cryptographie et sécurité [cs.CR]
Informatique [cs]/Modélisation et simulation

English abstract : [en]

The issue addressed in this paper is how to build low-level hybrid cooperative optimization methods that combine aGenetic Algorithm (GA) with a Branch-and-Bound algorithm (B&B). The key challenge is to provide a common ...
Show more >The issue addressed in this paper is how to build low-level hybrid cooperative optimization methods that combine aGenetic Algorithm (GA) with a Branch-and-Bound algorithm (B&B). The key challenge is to provide a common solution and search space coding and associated transformation operators enabling an efficient cooperation between the two algorithms. The tree-based coding is traditionally used in exact optimization methods such as B&B. In this paper, we explore the idea of using such coding in Genetic Algorithms. Following this idea, we propose a pioneering approach hybridizing a GA with a B&B algorithm. The information (solutions and search subspaces) exchange between the two algorithms is performed at low-level and during the exploration process. From the implementation point of view, the common coding has facilitated the low-level coupling of two software frameworks: ParadisEO and BOB++ used to implement respectively the GA and the B&B algorithms. The proposed approach has been experimented on the 3D Quadratic Assignment Problem. In order to support the CPU cost of the hybridization mechanism, hierarchical parallel computing is used together with grid computing.Show less >

Language :

Anglais

Peer reviewed article :

Oui

Audience :

Internationale

Popular science :

Non

Collections :

• Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189

Source :

Harvested from HAL