Skip to Main content Skip to Navigation
Conference papers

A self adaptable evolutionary algorithm to tackle space planning problems

Xavier Bonnaire 1 María Cristina Riff
1 SRC - Systèmes répartis et coopératifs
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : In this paper we consider the space-planning problem, where a fixed set of objects have to be allocated on a single defined area. This is a Constraint Satisfaction Problem where the constraints are: the objects must be placed without overlapping. We have already designed a sequential evolutionary algorithm for space planning problem that has shown to be more performant than others approaches. Our aim is to be able to find more solutions than the sequential approach. The key idea is to design a self-adaptable distributed evolutionary algorithm. The first adaptation of our algorithm comes from the benefit of results already achieved by other nodes of the processors pool. In the paper we compare the first experimental results of our approach for solving space planning problem to the sequential ones. The implementation is running on an heterogeneous environment.
Document type :
Conference papers
Complete list of metadatas
Contributor : Lip6 Publications <>
Submitted on : Thursday, June 22, 2017 - 10:48:20 AM
Last modification on : Thursday, March 21, 2019 - 1:00:07 PM

Links full text



Xavier Bonnaire, María Cristina Riff. A self adaptable evolutionary algorithm to tackle space planning problems. PARA 2002 - 6th International Conference on Applied Parallel Computing, Jun 2002, Espoo, Finland. pp.403-410, ⟨10.1007/3-540-48051-X_40⟩. ⟨hal-01544792⟩



Record views