Branch-and-Bound Algorithm for Interface-Based Modular Product Design

2012 ◽  
Author(s):  
John Jung-Woon Yoo ◽  
Anirudh Aryasomayajula
Keyword(s):  
Optimal Design ◽  
Product Design ◽  
Branch And Bound ◽  
Mathematical Formulation ◽  
Branch And Bound Algorithm ◽  
Intermediate Step ◽  
Binary Integer Programming ◽  
Modular Product ◽  
Final Goal ◽  
Main Components

In our earlier work we have proposed a collaboration system for modular product design. One of the main components of the system is a design repository to which suppliers can upload their component descriptions using machine-readable, interface-based component description language, so that manufacturers can refer to the descriptions during product design phases. A mathematical formulation for modular product design has been proposed based on Artificial Intelligence Planning framework. The proposed Binary Integer Programming formulation generates the optimal design of a product. The optimal design consists of multiple components that are compatible with each other in terms of input and out interfaces. However, the mathematical approach is faced with scalability issue. The development of a heuristic algorithm that generates a high quality solution within a reasonable amount of time is the final goal of the research. In this paper, we propose an algorithmic approach based on branch-and-bound method as an intermediate step for the final goal. This paper describes the details of the proposed branch-and-bound algorithm using a case study and experimental results are discussed.

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

2013 ◽  
Vol 13 (4) ◽  
Author(s):  
John Jung-Woon Yoo ◽  
Anirudh Aryasomayajula ◽  
Seung Ki Moon
Keyword(s):  
Performance Evaluation ◽  
Product Design ◽  
Branch And Bound ◽  
Branch And Bound Algorithm ◽  
Planning Problem ◽  
Modular Product ◽  
And Performance ◽  
Main Components ◽  
Machine Readable

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.

Unit Commitment Solution by Branch and Bound Algorithm

2020 ◽  
Author(s):  
Bishaljit Paul ◽  
Sushovan Goswami ◽  
Dipu Mistry ◽  
Chandan Kumar Chanda
Keyword(s):  
Branch And Bound ◽  
Unit Commitment ◽  
Branch And Bound Algorithm

scholarly journals Identification of mechanical properties of arteries with certification of global optimality

2021 ◽  
Author(s):  
Jan-Lucas Gade ◽  
Carl-Johan Thore ◽  
Jonas Stålhand
Keyword(s):  
Global Solution ◽  
Branch And Bound ◽  
Clinical Data ◽  
Minimization Problem ◽  
Branch And Bound Algorithm ◽  
Stationary Points ◽  
Model Parameters ◽  
Global Optimality ◽  
Clinical Value ◽  
Non Linear

AbstractIn this study, we consider identification of parameters in a non-linear continuum-mechanical model of arteries by fitting the models response to clinical data. The fitting of the model is formulated as a constrained non-linear, non-convex least-squares minimization problem. The model parameters are directly related to the underlying physiology of arteries, and correctly identified they can be of great clinical value. The non-convexity of the minimization problem implies that incorrect parameter values, corresponding to local minima or stationary points may be found, however. Therefore, we investigate the feasibility of using a branch-and-bound algorithm to identify the parameters to global optimality. The algorithm is tested on three clinical data sets, in each case using four increasingly larger regions around a candidate global solution in the parameter space. In all cases, the candidate global solution is found already in the initialization phase when solving the original non-convex minimization problem from multiple starting points, and the remaining time is spent on increasing the lower bound on the optimal value. Although the branch-and-bound algorithm is parallelized, the overall procedure is in general very time-consuming.

Sign in / Sign up

Export Citation Format

Share Document