We consider the problem of minimizing the mean flow time on a single-batch processing machine. The machine can process at most B jobs simultaneously as a batch, and the processing time of a batch is equal to the proce...
详细信息
We consider the problem of minimizing the mean flow time on a single-batch processing machine. The machine can process at most B jobs simultaneously as a batch, and the processing time of a batch is equal to the processing time of the longest job in the batch. We present a new dominance property and develop a branch and bound method. Finally, the computational results of the method are discussed.
This paper discusses an efficient algorithm for solving the mean-absolute deviation-skewness (MADS) portfolio optimization model in which the third order moment in addition to the first and second moment of the rate o...
详细信息
This paper discusses an efficient algorithm for solving the mean-absolute deviation-skewness (MADS) portfolio optimization model in which the third order moment in addition to the first and second moment of the rate of return of the portfolio is taken into account. The MADS model can be considered either as an extension of the mean-absolute deviation (MAD) model or an approximation of the mean-variance-skewness (MVS) model which is a straightforward extension of the mean-variance (MV) model. Models which take account of the third moment play an important role when the rate of return of the assets are non-symmetrically distributed. We will propose an efficient branch and bound algorithm for solving a non-concave maximization problem and demonstrate that it can generate a globally optimal solution in an efficient manner.
Mixtures with a known range of possibly present species can be simultaneously analysed qualitatively and quantitatively by using the branch and bound algorithm. The computation time is much less than in the enumeratio...
详细信息
Mixtures with a known range of possibly present species can be simultaneously analysed qualitatively and quantitatively by using the branch and bound algorithm. The computation time is much less than in the enumeration procedure and there is no risk of missing the real combination of co-existing components in the sample. Nitrophenol mixtures were analysed satisfactorily.
This paper discusses an efficient algorithm for solving the mean-absolute deviation-skewness (MADS) portfolio optimization model in which the third order moment in addition to the first and second moment of the rate o...
详细信息
This paper discusses an efficient algorithm for solving the mean-absolute deviation-skewness (MADS) portfolio optimization model in which the third order moment in addition to the first and second moment of the rate of return of the portfolio is taken into account. The MADS model can be considered either as an extension of the mean-absolute deviation (MAD) model or an approximation of the mean-variance-skewness (MVS) model which is a straightforward extension of the mean-variance (MV) model. Models which take account of the third moment play an important role when the rate of return of the assets are non-symmetrically distributed. We will propose an efficient branch and bound algorithm for solving a non-concave maximization problem and demonstrate that it can generate a globally optimal solution in an efficient manner.
Synthetic pigments in food can be simultaneously analysed qualitatively and quantitatively by using a spectrophotometric method combined with the branch and bound algorithm. This method does not require a preseparatio...
详细信息
Synthetic pigments in food can be simultaneously analysed qualitatively and quantitatively by using a spectrophotometric method combined with the branch and bound algorithm. This method does not require a preseparation of the pigments and the relative error for each component in mixed samples was less than 5%. Candy, jelly and soft drinks were analysed satisfactorily.
This paper considers the constrained redundancy optimization problem in series systems. This problem can be formulated as a nonlinear integer programming problem of maximizing the overall systems reliability under lim...
详细信息
This paper considers the constrained redundancy optimization problem in series systems. This problem can be formulated as a nonlinear integer programming problem of maximizing the overall systems reliability under limited resource constraints. By exploiting special features of the problem, we derive a new necessary condition for optimal redundancy assignments. This condition leads to a new fathoming condition in the branch and bound method that may result in a significant reduction of computational efforts, as evidenced in our numerical calculation for linearly constrained redundancy optimization problems.
Graphical symbol spotting and retrieval in document images is an important sub-field in document analysis. This paper presents a branch and bound algorithm for spotting a queried graphical symbol in documents. The tec...
详细信息
ISBN:
(纸本)9781424479948
Graphical symbol spotting and retrieval in document images is an important sub-field in document analysis. This paper presents a branch and bound algorithm for spotting a queried graphical symbol in documents. The technique utilizes geometric primitives as feature points. The preprocessing of the input images involves applying some ordinary morphological operations and then sampling to get points or segments. As for the search;a branch and bound geometric matching algorithm is used to locate the required symbol(s) in the documents. The presented method has been tested on documents that contain electronic circuits and it achieved high accuracy.
This paper presents the motion planning of unicycle-like robot using single Rapidly-exploring Random Tree (RRT) algorithm, combining with branch and bound (BB) method. RRT can construct the searching tree efficiently ...
详细信息
ISBN:
(纸本)9781479911974;9781479911950
This paper presents the motion planning of unicycle-like robot using single Rapidly-exploring Random Tree (RRT) algorithm, combining with branch and bound (BB) method. RRT can construct the searching tree efficiently between initial configuration and goal configuration. Based on the constructed searching tree, the optimal path can be extracted with BB algorithm rapidly. Obstacles avoidance is realized by checking whether the contour points of robot locate in the space of obstacles. The simulation result in a complex environment with unicycle-like robot proves the validity of proposed algorithms
In this paper a novel branch and bound (B&B) algorithm to solve the transmission expansion planning which is a non-convex mixed integer nonlinear programming problem (MINLP) is presented. Based on defining the opt...
详细信息
ISBN:
(纸本)9781479928026
In this paper a novel branch and bound (B&B) algorithm to solve the transmission expansion planning which is a non-convex mixed integer nonlinear programming problem (MINLP) is presented. Based on defining the options of the separating variables and makes a search in breadth, we call this algorithm a B&BML algorithm. The proposed algorithm is implemented in AMPL and an open source Ipopt solver is used to solve the nonlinear programming (NLP) problems of all candidates in the B&B tree. Strategies have been developed to address the problem of non-linearity and non-convexity of the search region. The proposed algorithm is applied to the problem of long-term transmission expansion planning modeled as an MINLP problem. The proposed algorithm has carried out on five commonly used test systems such as Garver 6-Bus, IEEE 24-Bus, 46-Bus South Brazilian test systems, Bolivian 57-Bus, and Colombian 93-Bus. Results show that the proposed methodology not only can find the best known solution but it also yields a large reduction between 24% to 77.6% in the number of NLP problems regarding to the size of the systems.
We present a branch and bound algorithm for the maximum clique problem in arbitrary graphs. The main part of the algorithm consists in the determination of upper bounds by graph colorings. Using a modification of a kn...
详细信息
暂无评论