contributor author | Foster, Garrett | |
contributor author | Ferguson, Scott | |
date accessioned | 2017-05-09T00:57:13Z | |
date available | 2017-05-09T00:57:13Z | |
date issued | 2013 | |
identifier issn | 1530-9827 | |
identifier other | jcise_013_04_041003.pdf | |
identifier uri | http://yetl.yabesh.ir/yetl/handle/yetl/151243 | |
description abstract | The objective of this paper is to demonstrate that unique alternative designs can be efficiently found by searching the discarded data (or graveyard) from a multiobjective genetic algorithm (MOGA). Motivation for using graveyard data to generate design alternatives arises from the computational cost associated with realtime design space exploration of multiobjective optimization problems. The effectiveness of this approach is explored by comparing (1) the uniqueness of alternatives found using graveyard data and those generated using an optimizationbased search, and (2) how alternative generation near the Pareto frontier is impacted. Two multiobjective case study problems are introduced—a two bar truss and an Ibeam design optimization. Results from these studies indicate that using graveyard data allows for the discovery of alternative designs that are at least 70% as unique as alternatives found using an optimizationbased alternative identification approach, while saving a significant number of functional evaluations. Additionally, graveyard data are shown to be better suited for alternative generation near the Pareto frontier than standard sampling techniques. Finally, areas of future work are also discussed. | |
publisher | The American Society of Mechanical Engineers (ASME) | |
title | Exploring the Effectiveness of Using Graveyard Data When Generating Design Alternatives | |
type | Journal Paper | |
journal volume | 13 | |
journal issue | 4 | |
journal title | Journal of Computing and Information Science in Engineering | |
identifier doi | 10.1115/1.4024913 | |
journal fristpage | 41003 | |
journal lastpage | 41003 | |
identifier eissn | 1530-9827 | |
tree | Journal of Computing and Information Science in Engineering:;2013:;volume( 013 ):;issue: 004 | |
contenttype | Fulltext | |