An Optimization Method for Evaluation and Decision-Making of Distribution Network Planned Projects Based on Branch and Bound Algorithm

2018 ◽  
Author(s):  
Wei Jiang ◽  
Jie Wu ◽  
Hui Qi ◽  
Wei Feng ◽  
Xiaofeng Duan
Keyword(s):  
Decision Making ◽  
Branch And Bound ◽  
Distribution Network ◽  
Optimization Method ◽  
Branch And Bound Algorithm

scholarly journals A Novel Optimization Method for Nonconvex Quadratically Constrained Quadratic Programs

2014 ◽  
Vol 2014 ◽  
pp. 1-11 ◽  
Author(s):  
Hongwei Jiao ◽  
Yong-Qiang Chen ◽  
Wei-Xin Cheng
Keyword(s):  
Branch And Bound ◽  
Computational Efficiency ◽  
Numerical Experiments ◽  
Optimization Method ◽  
Global Optimum ◽  
Branch And Bound Algorithm ◽  
Linear Programs ◽  
Quadratic Programs ◽  
Optimum Point ◽  
Quadratically Constrained

This paper presents a novel optimization method for effectively solving nonconvex quadratically constrained quadratic programs (NQCQP) problem. By applying a novel parametric linearizing approach, the initial NQCQP problem and its subproblems can be transformed into a sequence of parametric linear programs relaxation problems. To enhance the computational efficiency of the presented algorithm, a cutting down approach is combined in the branch and bound algorithm. By computing a series of parametric linear programs problems, the presented algorithm converges to the global optimum point of the NQCQP problem. At last, numerical experiments demonstrate the performance and computational superiority of the presented algorithm.

scholarly journals Binary goal programming model for optimizing tire selection using branch and bound algorithm

2021 ◽  
Vol 12 ◽  
pp. 8
Author(s):  
Shady Aly
Keyword(s):  
Decision Making ◽  
Branch And Bound ◽  
Goal Programming ◽  
Programming Model ◽  
Operating Conditions ◽  
Branch And Bound Algorithm ◽  
Adoption Decision ◽  
Proposed Model ◽  
Goal Programming Model ◽  
Design Selection

The problem of assessment and adoption of automotive tyre design specifications has not been addressed sufficiently in literature. This is in spite of its significance as a crucial component relevant to design and safety of the automobile. In this paper, a multi-objective optimization model of the tyre design trademark adoption decision is proposed. Multi-attribute or multi-criterion decision making techniques are heuristics providing good solution, but do not guarantee optimum solution. Up to date, there is no optimal yielding method for selection of vehicle tyre manufacturer or trademark based on prespecified design targets. The proposed model is formulated as a binary goal programming model for optimizing tyre trademark design selection decision by adopting an optimal tyre design trademark that best achieve design targets. The model is solved by the branch and bound algorithm. One advantage of the proposed model is flexibility to incorporate multiple design targets, tolerance limits and different constraints. The proposed model can support efficient and effective decision making concerning the adoption of tyre trademark design for new automobile or to re-adopt new design for new road vehicle operating conditions.

scholarly journals Fuzzy Branch-and-Bound Algorithm with OWA Operators in the Case of Consumer Decision Making

Mathematics ◽  
2021 ◽  
Vol 9 (23) ◽  
pp. 3045
Author(s):  
Emili Vizuete-Luciano ◽  
Sefa Boria-Reverter ◽  
José M. Merigó-Lindahl ◽  
Anna Maria Gil-Lafuente ◽  
Maria Luisa Solé-Moro
Keyword(s):  
Decision Making ◽  
Branch And Bound ◽  
Average Distance ◽  
Weighted Average ◽  
Branch And Bound Algorithm ◽  
Weighted Averaging ◽  
Consumer Decision Making ◽  
Owa Operator ◽  
Consumer Decision ◽  
The City

The ordered weighted averaging (OWA) operator is one of the most used techniques in the operator’s aggregation procedure. This paper proposes a new assignment algorithm by using the OWA operator and different extensions of it in the Branch-and-bound algorithm. The process is based on the use of the ordered weighted average distance operator (OWAD) and the induced OWAD operator (IOWAD). We present it as the Branch-and-bound algorithm with the OWAD operator (BBAOWAD) and the Branch-and-bound algorithm with the IOWAD operator (BBAIOWAD). The main advantage of this approach is that we can obtain more detailed information by obtaining a parameterized family of aggregation operators. The application of the new algorithm is developed in a consumer decision-making model in the city of Barcelona regarding the selection of groceries by districts that best suit their needs. We rely on the opinion of local commerce experts in the city. The key advantage of this approach is that we can consider different sources of information independent of each other.

AN EXTENDED BRANCH AND BOUND ALGORITHM FOR BILEVEL MULTI-FOLLOWER DECISION MAKING IN A REFERENTIAL-UNCOOPERATIVE SITUATION

2007 ◽  
Vol 06 (02) ◽  
pp. 371-388 ◽  
Author(s):  
JIE LU ◽  
CHENGGEN SHI ◽  
GUANGQUAN ZHANG ◽  
DA RUAN
Keyword(s):  
Decision Making ◽  
Branch And Bound ◽  
Decision Problem ◽  
Decision Model ◽  
Branch And Bound Algorithm ◽  
Upper Level ◽  
Multiple Followers ◽  
Cross Reference

Within the framework of any bilevel decision problem, a leader's decision at the upper level is influenced by the reaction of their follower at the lower level. When multiple followers are involved in a bilevel decision problem, the leader's decision will not only be affected by the reactions of those followers, but also by the relationships among those followers. One of the popular situations within this framework is where these followers are uncooperatively making decisions while having cross reference of decision information, called a referential-uncooperative situation in this paper. The well-known branch and bound algorithm has been successfully applied to a one-leader-and-one-follower linear bilevel decision problem. This paper extends this algorithm to deal with the above-mentioned linear bilevel multi-follower decision problem by means of a linear referential-uncooperative bilevel multi-follower decision model. It then proposes an extended branch and bound algorithm to solve this problem with a set of illustrative examples in a referential-uncooperative situation.

A BRANCH-AND-BOUND ALGORITHM FOR FINDING ALL OPTIMAL SOLUTIONS OF THE ASSIGNMENT PROBLEM

2007 ◽  
Vol 24 (06) ◽  
pp. 831-839 ◽  
Author(s):  
ZHUO FU ◽  
RICHARD EGLESE ◽  
MIKE WRIGHT
Keyword(s):  
Decision Making ◽  
Branch And Bound ◽  
Assignment Problem ◽  
Experimental Results ◽  
Branch And Bound Algorithm ◽  
Optimization Models ◽  
Component Part ◽  
Optimal Solutions ◽  
Linear Assignment Problem ◽  
Linear Assignment

Alternative optimal solutions can give more choice for practical decision making. Therefore, the provision of methods for finding alternative optimal solutions is an important component part of the solution techniques for optimization models. The aim of this paper is to present a branch-and-bound algorithm for finding all optimal solutions of the linear assignment problem. Numerical experimental results are also given.

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