Navigation within a Structured Search Space in Layout Problems

O Akın and R Sen

Environment and Planning B, 1996, vol. 23, issue 4, 421-442

Abstract: HeGeL-2 is a heuristic-based layout generator equipped with a nonserial dynamic programming algorithm. HeGeL-2 finds optimal solutions to plan-layout design (PLD) problems which are defined as problems that involve the allocation of a nontrivial number (ten or more) of design units in one application. The search strategy HeGeL-2 uses is similar in some respects and dissimilar in others to human search behavior, which has been simulated in an earlier version of HeGeL-2. These similarities include constraint relaxing strategies common to both versions. Dissimilarities concern claims of optimality and ‘goodness’ of solutions measured by an objective function based on soft constraints. In this paper, the general problem of navigation in a search space for layout problems is discussed in the context of a general-purpose formalism. Through this formalism several layout generators, including LOOS, WRIGHT, and HeGeL-2, are described.

Date: 1996
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://journals.sagepub.com/doi/10.1068/b230421 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:sae:envirb:v:23:y:1996:i:4:p:421-442

DOI: 10.1068/b230421

Access Statistics for this article

More articles in Environment and Planning B
Bibliographic data for series maintained by SAGE Publications ().