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.
The use of information technology in the e-Learning process gives positive and negative impacts. One of the positive impacts is the easy access for vast information;while the negative impacts is the ineffective learni...
详细信息
ISBN:
(纸本)9781728152929
The use of information technology in the e-Learning process gives positive and negative impacts. One of the positive impacts is the easy access for vast information;while the negative impacts is the ineffective learning because it makes students lazy. Previous research has used games or game elements to decrease the negative impacts of e-Learning. A survey about algorithm Design and Analysis course was conducted, and it shows that there are some difficult subjects that need to be taught using an alternative method of learning. This research discusses how to design a video game in order to learn branch and bound algorithm and evaluate the game produced with the design. First, online surveys were done to gather the requirement, then the game design was made, then the game was implemented and evaluated. The evaluation would be used to make a better design for the next development iteration. The result of playtesting shows positive feedbacks and receives critics and suggestions. This research finds that designing a good game for learning is hard because developer must carefully define all elements in the game, so that everything is balanced and complements each other.
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...
详细信息
We propose a new branch and bound algorithm for the solution of large scale separable concave programming problems. The largest distance bisection (LDB) technique is proposed to divide rectangle into sub-rectangles wh...
详细信息
We propose a new branch and bound algorithm for the solution of large scale separable concave programming problems. The largest distance bisection (LDB) technique is proposed to divide rectangle into sub-rectangles when one problem is branched into two subproblems. It is proved that the LDB method is a normal rectangle subdivision (NRS). Numerical tests on problems with dimensions from 100 to 10000 show that the proposed branch and bound algorithm is efficient for solving large scale separable concave programming problems, and convergence rate is faster than ω-subdivision method.
This paper proposes an efficient algorithm to deal with various scheduling requirements of diverse structure cluster tools. Cluster tools not only have complex flow patterns such as parallel PMs, wafer residency time ...
详细信息
ISBN:
(纸本)9781479970162
This paper proposes an efficient algorithm to deal with various scheduling requirements of diverse structure cluster tools. Cluster tools not only have complex flow patterns such as parallel PMs, wafer residency time constraints and dual-arm robot, but also have different structures such as the equipment front-end module which consists of an aligner, a signal-arm robot and two load locks. Different solutions for different requirements may be impractical. To solve this problem, the Petri net models of different configured cluster tool with diverse scheduling requirements is developed first. Then, based on the Petri net models the state search tree is presented, which can efficiently determine the local optimal scheduling sequence. Through experiments, the effectiveness of the branch and bound algorithm proposed in this paper is verified.
In this paper, we investigate a class of nonconvex quadratic programming with box constrains. A new branch and bound algorithm is proposed. The improvement of the new method is how to determine the lower bound. We put...
详细信息
ISBN:
(纸本)9781467352536
In this paper, we investigate a class of nonconvex quadratic programming with box constrains. A new branch and bound algorithm is proposed. The improvement of the new method is how to determine the lower bound. We put nonconvex quadratic programming into convex quadratic programming, and get an optimal solution as lower bound of original problem. Meanwhile, an upper bound is got by existing methods. Moreover, by used of the branch and bound algorithm, we can solve the original problem by solved a series of subproblems. Finally, the convergence of the proposed new algorithm is proved.
In this paper, we study a novel self-driving travel planning problem, where the tourist aims to minimize the total cost. The idea is to use a mathematical model to planning a route-time scheme for travel spots and hot...
详细信息
ISBN:
(纸本)9781538675182
In this paper, we study a novel self-driving travel planning problem, where the tourist aims to minimize the total cost. The idea is to use a mathematical model to planning a route-time scheme for travel spots and hotels. Specifically, this planning determines the tour for travel spots and considers the hotel selection under the rest break constraint, as well as schemes routes and time arrangement for the trip. Meanwhile, based on real-time and multi-resource demand, we use multi-resource data to execute multiple websites' information extraction. We utilize two algorithms to solve the proposed problem and make a comparison, one is exact branch and bound scheme and the other is the branch and bound based heuristic algorithm. In the proposed heuristic algorithm, the travel spots in the problem are decomposed by K-means algorithm, then each group of travel spots is bounded by the greedy algorithm and Hungarian method for upper bound and lower bound, respectively. Each branch node branches using Hungarian method and each branch can be treated as an assignment problem solved by Hungarian method. Finally, we give numerical examples and discuss the results.
暂无评论