Show simple item record

contributor authorHerber, Daniel R.
contributor authorGuo, Tinghao
contributor authorAllison, James T.
date accessioned2017-11-25T07:18:05Z
date available2017-11-25T07:18:05Z
date copyright2017/4/4
date issued2017
identifier issn1050-0472
identifier othermd_139_05_051403.pdf
identifier urihttp://138.201.223.254:8080/yetl1/handle/yetl/4234957
description abstractIn this article, a class of architecture design problems is explored with perfect matchings (PMs). A perfect matching in a graph is a set of edges such that every vertex is present in exactly one edge. The perfect matching approach has many desirable properties such as complete design space coverage. Improving on the pure perfect matching approach, a tree search algorithm is developed that more efficiently covers the same design space. The effect of specific network structure constraints (NSCs) and colored graph isomorphisms on the desired design space is demonstrated. This is accomplished by determining all unique feasible graphs for a select number of architecture problems, explicitly demonstrating the specific challenges of architecture design. With this methodology, it is possible to enumerate all possible architectures for moderate scale-systems, providing both a viable solution technique for certain problems and a rich data set for the development of more capable generative methods and other design studies.
publisherThe American Society of Mechanical Engineers (ASME)
titleEnumeration of Architectures With Perfect Matchings
typeJournal Paper
journal volume139
journal issue5
journal titleJournal of Mechanical Design
identifier doi10.1115/1.4036132
journal fristpage51403
journal lastpage051403-13
treeJournal of Mechanical Design:;2017:;volume( 139 ):;issue: 005
contenttypeFulltext


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record