Paper Info
Title
A Self-Adaptable Distributed Evolutionary Algorithm to Tackle Space Planning Problems
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.
Year
Venue
Keywords
2002
PARA
space-planning problem,space planning problem,sequential evolutionary algorithm,sequential approach,fixed set,tackle space planning problems,key idea,evolutionary algorithm,heterogeneous environment,constraint satisfaction,constraint satisfaction problem
Field
DocType
Volume
Constraint satisfaction,Mathematical optimization,Evolutionary algorithm,Object-oriented programming,Computer science,Space planning,Theoretical computer science,Constraint satisfaction problem,Distributed algorithm,Constraint logic programming,Genetic algorithm
Conference
2367
ISSN
ISBN
Citations 
0302-9743
3-540-43786-X
2
PageRank 
References 
Authors
0.47
14
2
Name
Order
Citations
PageRank
Xavier Bonnaire18511.88
María Cristina Riff220023.91