Hyperspectral reflectance imaging data are analyzed for poultry skin tumor detection. We consider selecting only a few wavebands from hyperspectral data for potential use in a real-time multispectral camera. To do thi...
详细信息
Hyperspectral reflectance imaging data are analyzed for poultry skin tumor detection. We consider selecting only a few wavebands from hyperspectral data for potential use in a real-time multispectral camera. To do this, we improve our prior tumor detection system by employing our new adaptive branch and bound algorithm and a support vector machine classifier. Our HS analysis is useful since it provides a guideline for selection of the specific wavelengths for best tumor detection (feature selection). Experimental results demonstrate that our optimal adaptive branch and bound algorithm is significantly faster than other versions of the branch and bound algorithm. We compare the performance of our feature selection algorithm to that of a feature extraction algorithm and show that using our feature selection algorithm gives a better tumor detection rate and a lower false alarm rate. (C) 2009 Elsevier Ltd. All rights reserved.
Nash Equilibrium is the solution of the Cournot Model considering the reaction functions provided that outputs are successive. However in practice, the outputs of some products are not successive. An improved branch a...
详细信息
ISBN:
(纸本)9780769535609
Nash Equilibrium is the solution of the Cournot Model considering the reaction functions provided that outputs are successive. However in practice, the outputs of some products are not successive. An improved branch and bound algorithm is proposed combining the Nash Equilibrium, considering the discontinuous output. The proposed algorithm is different from the traditional algorithm where the respond functions would be converted into constrains. While the improved algorithm is used to calculate the output of each manufacturer, the worst solution arising in the mid-process of calculation will be removed firstly, and then the final common integer solution of all manufactures will be the optimal solution. The procedure of the proposed algorithm is explicated in this paper. An example where two manufactures exist is studied, and the results validate the effectiveness of the method.
In order to solve a kind of quadratic integer programming problem with unrestrained conditions and multi-objective function, improvements on the traditional branch and bound algorithm are carried out in this paper. By...
详细信息
ISBN:
(纸本)9780769537054
In order to solve a kind of quadratic integer programming problem with unrestrained conditions and multi-objective function, improvements on the traditional branch and bound algorithm are carried out in this paper. By introducing response function, a practical branch and bound algorithm to solve the quadratic integer programming model is derived. The procedure of the proposed algorithm is explicated in this paper and an example with two manufactures is studied. Numerical results show that the proposed algorithm is more effective than the traditional branch and bound algorithm, and fit for more complex problems.
The D-C (difference of convex functions) programming occurs very often in economic and financial field. In this paper, a class of D-C programming problems be studied, witch objection function is the sum of a convex qu...
详细信息
The D-C (difference of convex functions) programming occurs very often in economic and financial field. In this paper, a class of D-C programming problems be studied, witch objection function is the sum of a convex quadratic function and a separable concave function, the constrains is the intersection of a polytop and a rectangular. A branch and bound algorithm is given for solving it. we compare the largest distance bisection with omega-subdivision in branch and bound algorithm. Numerical tests on different dimensions showed that the proposed branch and bound algorithm is efficient for solving medium-scale problems, and the efficiency of the largest distance bisection and omega-subdivision is nearly. (c) 2004 Elsevier Inc. All rights reserved.
As wind power penetrations increase in isolated power systems, more innovative and sophisticated approaches to system operation will need to be adopted due to the intermittency and unpredictability of wind power gener...
详细信息
As wind power penetrations increase in isolated power systems, more innovative and sophisticated approaches to system operation will need to be adopted due to the intermittency and unpredictability of wind power generation. In this paper, a hybrid approach of combining branch and bound algorithm with a dynamic programming algorithm is developed to coordinate the wind and thermal generation scheduling problem for operating an isolated hybrid power system reliably and efficiently. Several technique constraints are applied to determine the maximum proportion of wind generator capacity that can be integrated into the system. A simplified dispatch based on the direct search method (DSM) is also introduced to relieve the computational burden further. Numerical experiments are included to understand the wind generator capacity in production cost analysis and to provide valuable information for both operational and planning problems.
In reality, the machine might become unavailable due to machine breakdowns or various inevitable reasons, and machine might have different capability to processing job. Motivated by this, we consider the problem of sc...
详细信息
In reality, the machine might become unavailable due to machine breakdowns or various inevitable reasons, and machine might have different capability to processing job. Motivated by this, we consider the problem of scheduling n non-preemptive and independent jobs on m identical machines incorporating machine availability and eligibility constraints while minimizing the maximum lateness. Each machine is capable of processing at specific availability intervals. We develop a branch and bound algorithm applying several immediate selection rules for solving this scheduling problem.
In this paper we revisit the problem of peer-to-peer refueling of a satellite constellation in orbit with propellant. In particular, we propose the egalitarian peer-to-peer refueling strategy that relaxes the restrict...
详细信息
In this paper we revisit the problem of peer-to-peer refueling of a satellite constellation in orbit with propellant. In particular, we propose the egalitarian peer-to-peer refueling strategy that relaxes the restriction on the active satellites to return to their original orbital slots after all fuel exchanges have been completed. We formulate the problem as a minimum cost flow problem in the so-called constellation network, and minimize the total Delta V subject to flow balance constraints, along with certain additional constraints introduced to avoid conflicts between active and passive satellites. Recognizing that the actual objective is to minimize the total fuel expenditure, instead of Delta V, we also propose a method to improve the results by performing a local search around the minimum-Delta V solution. We also provide explicit upper and lower bounds on the suboptimality of the obtained results. With the help of numerical examples, it is shown that the proposed egalitarian peer-to-peer refueling strategy leads to considerable reduction in terms of the total fuel expenditure over the baseline peer-to-peer strategy.
This study addresses the problem of minimizing total tardiness on a single machine with unequal release dates. Dominance properties established in previous literatures and herein are adopted to develop branch and boun...
详细信息
This study addresses the problem of minimizing total tardiness on a single machine with unequal release dates. Dominance properties established in previous literatures and herein are adopted to develop branch and bound and heuristic procedures. Computational experiments were conducted to evaluate the approaches. The results revealed that the branch and bound algorithm is efficient in solving hard problems and easy problems that involve up to 50 and 500 jobs, respectively. The computational effectiveness of the heuristic is also reported. (C) 2007 Elsevier B.V. All rights reserved.
We consider matching markets at a senior level, where workers are assigned to firms at an unstable matching-the status-quo-which might not be Pareto efficient. It might also be that none of the matchings Pareto superi...
详细信息
We consider matching markets at a senior level, where workers are assigned to firms at an unstable matching-the status-quo-which might not be Pareto efficient. It might also be that none of the matchings Pareto superior to the status-quo are Core stable. We propose two weakenings of Core stability: status-quo stability and weakened stability, and the respective mechanisms which lead any status-quo to matchings meeting the stability requirements above mentioned. The first one is inspired by the Top trading cycle and Deferred Acceptance procedures, the other one belongs to the family of branch and bound algorithms. The last procedure finds a core stable matching in many-to-one markets whenever it exists, dispensing with the assumption of substitutability.
This paper describes an exact algorithm for the optimal cyclic scheduling in a robotic cell with flexible processing times and a material handling robot. The problem is formulated with the prohibited intervals of the ...
详细信息
ISBN:
(纸本)9781424426294
This paper describes an exact algorithm for the optimal cyclic scheduling in a robotic cell with flexible processing times and a material handling robot. The problem is formulated with the prohibited intervals of the cycle time based on the capacity constraints of the machines and the robot. After the analysis of the developed mathematic model, the problem is transformed to enumerate the non-prohibited intervals for the cycle time. An efficient branch and bound algorithm is proposed to complete this enumeration procedure. Computational results on randomly generated test instances indicate that the algorithm is effective.
暂无评论