A Self-Adaptable Distributed Evolutionary Algorithm to Tackle Space Planning Problems

Authors:
Xavier Bonnaire;María Cristina Riff Rojas
Affiliations:
-;-
Venue:
PARA '02 Proceedings of the 6th International Conference on Applied Parallel Computing Advanced Scientific Computing
Year:
2002

Citing 8
Cited 1

A dynamic algorithm for placing rectangles without overlapping

Journal of Information Processing
Algorithms for constraint-satisfaction problems: a survey

AI Magazine
Genetic algorithms + data structures = evolution programs (2nd, extended ed.)

Genetic algorithms + data structures = evolution programs (2nd, extended ed.)
A Sufficient Condition for Backtrack-Free Search

Journal of the ACM (JACM)
Representations for space planning

Communications of the ACM
Solving Constraint Satisfaction Problems Using a Genetic/Systematic Search Hybrid That Realizes When to Quit

Proceedings of the 6th International Conference on Genetic Algorithms
Solving Binary Constraint Satisfaction Problems Using Evolutionary Algorithms with an Adaptive Fitness Function

PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
The Many Paths to Satisfaction

Constraint Processing, Selected Papers

An evolutionary strategy enhanced with a local search technique for the space allocation problem in architecture, Part 1: Methodology

Computer-Aided Design

Quantified Score

Hi-index	0.00

Visualization

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.