Learning and reusing information in space layout problems using genetic engineering

Aus de_evolutionary_art_org
Version vom 8. Dezember 2014, 12:55 Uhr von Gbachelier (Diskussion | Beiträge)

(Unterschied) ← Nächstältere Version | Aktuelle Version (Unterschied) | Nächstjüngere Version → (Unterschied)
Wechseln zu: Navigation, Suche

Reference

Gero, JS and Kazakov, V (1997): Learning and reusing information in space layout problems using genetic engineering. Artificial Intelligence in Engineering 11(3): 329-334.

DOI

http://dx.doi.org/10.1016/S0954-1810(96)00051-9

Abstract

The paper describes the application of a genetic engineering based extension to genetic algorithms to the layout planning problem. We study the gene evolution which takes place when an algorithm of this type is running and demonstrate that in many cases it effectively leads to the partial decomposition of the layout problem by grouping some activit ies together and optimally placing these groups during the first stage of the computation. At a second stage it optimally places activities within these groups. We show that the algorithm finnds the solution faster than standard evolutionary methods and that evolved genes represent design features that can be re-used later in a range of similar problems.

Extended Abstract

Bibtex

Used References

Links

Full Text

[extern file]

intern file

Sonstige Links

http://cumincad.architexturez.net/doc/oai-cumincadworks.id-2483

http://www.researchgate.net/publication/30870155_Learning_and_reusing_information_in_space_layout_problems_using_genetic_engineering