An approach to the multi-level space allocation problem in architecture using a hybrid evolutionary technique

A multi-level allocation problem consists in determining the position and size of spaces on several levels according to the user's requirements and constraints. How levels are connected and how vertical circulation objects are treated may limit the practitioner's preferences or reduce the...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Automation in construction Ročník 35; s. 482 - 498
Hlavní autori: Rodrigues, Eugénio, Gaspar, Adélio Rodrigues, Gomes, Álvaro
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Kidlington Elsevier B.V 01.11.2013
Elsevier
Predmet:
ISSN:0926-5805
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:A multi-level allocation problem consists in determining the position and size of spaces on several levels according to the user's requirements and constraints. How levels are connected and how vertical circulation objects are treated may limit the practitioner's preferences or reduce the number of solutions. Literature review has shown that in the multi-level allocation problem very often stairs and elevators are considered as fixed and rigid objects during the search process and sometimes even neglected. This paper presents an approach to deal with multi-levels based on a hybrid evolutionary technique where stairs and elevators are parametric objects, which interact with other spaces during the search process. Three case studies are presented, where the algorithm is tested on handling large and complex problems, how concurrent vertical circulation objects interact, and how several levels are stacked within a building boundary. The algorithm shows to be capable of generating coherent multi-level floor plans. •An approach to multi-level space allocation problem in architecture is presented.•Stairs and elevators are non-fixed and resizable objects that serve the floor levels.•Three case studies are conducted to demonstrate the algorithm capabilities.
Bibliografia:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0926-5805
DOI:10.1016/j.autcon.2013.06.005