@inproceedings{84893669253,
    abstract = "© Springer-Verlag Berlin Heidelberg 2002.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 = "2002",
    title = "A self-adaptable distributed evolutionary algorithm to tackle space planning problems",
    volume = "2367",
    pages = "403-410",
    booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    author = "Riff Rojas, Maria Cristina and Bonnaire, Xavier"
}

{"_id":"TtLQvXfLDCADsFDyA","bibbaseid":"riffrojas-bonnaire-aselfadaptabledistributedevolutionaryalgorithmtotacklespaceplanningproblems-2002","downloads":0,"creationDate":"2017-04-03T15:16:25.539Z","title":"A self-adaptable distributed evolutionary algorithm to tackle space planning problems","author_short":["Riff Rojas, M. C.","Bonnaire, X."],"year":2002,"bibtype":"inproceedings","biburl":"https://1fichier.com/?yjj84y68k0","bibdata":{"bibtype":"inproceedings","type":"inproceedings","abstract":"© Springer-Verlag Berlin Heidelberg 2002.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":"2002","title":"A self-adaptable distributed evolutionary algorithm to tackle space planning problems","volume":"2367","pages":"403-410","booktitle":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","author":[{"propositions":[],"lastnames":["Riff","Rojas"],"firstnames":["Maria","Cristina"],"suffixes":[]},{"propositions":[],"lastnames":["Bonnaire"],"firstnames":["Xavier"],"suffixes":[]}],"bibtex":"@inproceedings{84893669253,\n abstract = \"© Springer-Verlag Berlin Heidelberg 2002.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.\",\n year = \"2002\",\n title = \"A self-adaptable distributed evolutionary algorithm to tackle space planning problems\",\n volume = \"2367\",\n pages = \"403-410\",\n booktitle = \"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)\",\n author = \"Riff Rojas, Maria Cristina and Bonnaire, Xavier\"\n}\n\n","author_short":["Riff Rojas, M. C.","Bonnaire, X."],"key":"84893669253","id":"84893669253","bibbaseid":"riffrojas-bonnaire-aselfadaptabledistributedevolutionaryalgorithmtotacklespaceplanningproblems-2002","role":"author","urls":{},"downloads":0},"search_terms":["self","adaptable","distributed","evolutionary","algorithm","tackle","space","planning","problems","riff rojas","bonnaire"],"keywords":[],"authorIDs":[],"dataSources":["mqyNxb9twi6rYAXFv"]}