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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
