An efficient branch-and-bound algorithm for interface-based modular product design and performance evaluation
In our earlier work, we have proposed a cyberinfrastructure-based collaboration system for modular product design. One of the main components of the system is a design repository to which suppliers can upload the descriptions of their components using machine-readable, interface-based component desc...
Saved in:
Main Authors: | , , |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
2014
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/106269 http://hdl.handle.net/10220/24000 http://dx.doi.org/10.1115/1.4025403 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
id |
sg-ntu-dr.10356-106269 |
---|---|
record_format |
dspace |
spelling |
sg-ntu-dr.10356-1062692019-12-06T22:07:47Z An efficient branch-and-bound algorithm for interface-based modular product design and performance evaluation Aryasomayajula, Anirudh Yoo, John Jung-Woon Moon, Seung Ki School of Mechanical and Aerospace Engineering DRNTU::Engineering::Aeronautical engineering::Materials of construction In our earlier work, we have proposed a cyberinfrastructure-based collaboration system for modular product design. One of the main components of the system is a design repository to which suppliers can upload the descriptions of their components using machine-readable, interface-based component description language, so that manufacturers can refer to the descriptions during product design phases. In this paper, we propose an efficient algorithmic approach based on a branch-and-bound (BnB) algorithm to support product design using the interface-based component descriptions stored in the design repository. This product design problem is categorized into a planning problem, whose complexity is known as non-deterministic polynomial-time (NP) hard. For performance evaluation, we compare the performance of the branch-and-bound algorithm with that of a depth-first search (DFS) algorithm, which is an exhaustive search method. This paper describes the details of the proposed branch-and-bound algorithm using a case study and experimental results are discussed. 2014-10-13T01:18:27Z 2019-12-06T22:07:47Z 2014-10-13T01:18:27Z 2019-12-06T22:07:47Z 2013 2013 Journal Article Yoo, J. J.-W., Aryasomayajula, A., & Moon, S. K. (2013). An efficient branch-and-bound algorithm for interface-based modular product design and performance evaluation. Journal of computing and information science in engineering, 13(4), 044502-. 1530-9827 https://hdl.handle.net/10356/106269 http://hdl.handle.net/10220/24000 http://dx.doi.org/10.1115/1.4025403 en Journal of computing and information science in engineering © 2013 ASME. |
institution |
Nanyang Technological University |
building |
NTU Library |
country |
Singapore |
collection |
DR-NTU |
language |
English |
topic |
DRNTU::Engineering::Aeronautical engineering::Materials of construction |
spellingShingle |
DRNTU::Engineering::Aeronautical engineering::Materials of construction Aryasomayajula, Anirudh Yoo, John Jung-Woon Moon, Seung Ki An efficient branch-and-bound algorithm for interface-based modular product design and performance evaluation |
description |
In our earlier work, we have proposed a cyberinfrastructure-based collaboration system for modular product design. One of the main components of the system is a design repository to which suppliers can upload the descriptions of their components using machine-readable, interface-based component description language, so that manufacturers can refer to the descriptions during product design phases. In this paper, we propose an efficient algorithmic approach based on a branch-and-bound (BnB) algorithm to support product design using the interface-based component descriptions stored in the design repository. This product design problem is categorized into a planning problem, whose complexity is known as non-deterministic polynomial-time (NP) hard. For performance evaluation, we compare the performance of the branch-and-bound algorithm with that of a depth-first search (DFS) algorithm, which is an exhaustive search method. This paper describes the details of the proposed branch-and-bound algorithm using a case study and experimental results are discussed. |
author2 |
School of Mechanical and Aerospace Engineering |
author_facet |
School of Mechanical and Aerospace Engineering Aryasomayajula, Anirudh Yoo, John Jung-Woon Moon, Seung Ki |
format |
Article |
author |
Aryasomayajula, Anirudh Yoo, John Jung-Woon Moon, Seung Ki |
author_sort |
Aryasomayajula, Anirudh |
title |
An efficient branch-and-bound algorithm for interface-based modular product design and performance evaluation |
title_short |
An efficient branch-and-bound algorithm for interface-based modular product design and performance evaluation |
title_full |
An efficient branch-and-bound algorithm for interface-based modular product design and performance evaluation |
title_fullStr |
An efficient branch-and-bound algorithm for interface-based modular product design and performance evaluation |
title_full_unstemmed |
An efficient branch-and-bound algorithm for interface-based modular product design and performance evaluation |
title_sort |
efficient branch-and-bound algorithm for interface-based modular product design and performance evaluation |
publishDate |
2014 |
url |
https://hdl.handle.net/10356/106269 http://hdl.handle.net/10220/24000 http://dx.doi.org/10.1115/1.4025403 |
_version_ |
1681047038969511936 |