0
Technical Briefs

An Efficient Branch-and-Bound Algorithm for Interface-Based Modular Product Design and Performance Evaluation

[+] Author and Article Information
John Jung-Woon Yoo

Assistant Professor
e-mail: jyoo@bradley.edu

Anirudh Aryasomayajula

e-mail: aaryasomayajula@mail.bradley.edu

Department of Industrial and Manufacturing
Engineering and Technology,
Bradley University,
Peoria, IL 61625

Seung Ki Moon

Assistant Professor
School of Mechanical and Aerospace Engineering,
Nanyang Technological University,
50 Nanyang Avenue, N3.2, 01-29,
Singapore 639798, Singapore
e-mail: skmoon@ntu.edu.sg

1Corresponding author.

Contributed by the Computers and Information Division of ASME for publication in the JOURNAL OF COMPUTERS AND INFORMATION DIVISION IN ENGINEERING. Manuscript received August 19, 2012; final manuscript received August 27, 2013; published online October 15, 2013. Assoc. Editor: Charlie C. L. Wang.

J. Comput. Inf. Sci. Eng 13(4), 044502 (Oct 15, 2013) (5 pages) Paper No: JCISE-12-1138; doi: 10.1115/1.4025403 History: Received August 19, 2012; Revised August 27, 2013

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.

FIGURES IN THIS ARTICLE
<>
Copyright © 2013 by ASME
Your Session has timed out. Please sign back in to continue.

References

Figures

Grahic Jump Location
Fig. 1

Internet-based infrastructure for collaborative modular product design

Grahic Jump Location
Fig. 3

An interface-based product design example

Grahic Jump Location
Fig. 6

Results from the experiments: solution time trends

Grahic Jump Location
Fig. 4

Pseudocode for forward search algorithm

Grahic Jump Location
Fig. 5

Pseudocode for backward search algorithm

Tables

Errata

Discussions

Some tools below are only available to our subscribers or users with an online account.

Related Content

Customize your page view by dragging and repositioning the boxes below.

Related Journal Articles
Related eBook Content
Topic Collections

Sorry! You do not have access to this content. For assistance or to subscribe, please contact us:

  • TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
  • EMAIL: asmedigitalcollection@asme.org
Sign In