A novel beam orientation optimization algorithm for intensity-modulated radiation therapy (IMRT) was developed. In addition, the effect of candidate pool of beam orientations, in terms of beam orientation resolution a...
详细信息
ISBN:
(纸本)9783540368397
A novel beam orientation optimization algorithm for intensity-modulated radiation therapy (IMRT) was developed. In addition, the effect of candidate pool of beam orientations, in terms of beam orientation resolution and the starting orientation, on the optimized beam configuration, plan quality and the optimization time was also explored. The algorithm is based on the technique of mixedinteger linear programming in which binary and positive float variables are employed to represent candidates of beam orientation and beamlet weights, respectively. Both beam orientations and beam intensity maps are simultaneously optimized in the algorithm with a deterministic method. Several clinical cases were used to test the algorithm and the results showed that both target coverage and critical structures sparing were significantly improved for the plans with optimized beam orientations compared to those with equi-spaced beam orientations. The calculation time was less than an hour for the cases with 36 binary variables on a PC with a Pentium IV 2.66 GHz processor. It is also found that decreasing beam orientation resolution to 10 degrees greatly reduced the size of candidate pool of beam orientations without significant influence on the optimized beam configuration and plan quality, while selecting different starting orientations had large influence. Our study demonstrates that the algorithm can be applied to IMRT scenarios and better beam orientation configurations can be obtained using this algorithm. Furthermore, the optimization efficiency can be greatly improved through proper selection of beam orientation resolution and the starting beam orientation while guaranteeing the optimized beam configurations and plan quality.
IBM ILOG CPLEX Optimization Studio delivers advanced and complex optimization libraries that solve linear programming (LP) and related problems, e.g., mixedinteger. Moreover, the optimization tool provides users with...
详细信息
IBM ILOG CPLEX Optimization Studio delivers advanced and complex optimization libraries that solve linear programming (LP) and related problems, e.g., mixedinteger. Moreover, the optimization tool provides users with its Academic Research Edition, which is available for teaching and noncommercial research at no-charge. This paper describes the usage of CPLEX C++ API for solving linear problems and, as an exhaustive example, optimization of network flows in overlay multicast is taken into account. Applying continuous and integral variables and implementing various constraints, including equations and inequalities, as well as setting some global parameters of the solver are presented and widely explained.
For the Department of Veterans Affairs (VA), traumatic brain injury (TBI) is a significant problem facing active duty military personnel, veterans, their families, and caregivers. The VA has designated TBI treatment a...
详细信息
Based on load balance ideas, this paper constructs an integerprogramming model for the order planning of the steel-iron enterprise, whose objective is to minimize the total cost including earliness-tardiness penalty,...
详细信息
Based on load balance ideas, this paper constructs an integerprogramming model for the order planning of the steel-iron enterprise, whose objective is to minimize the total cost including earliness-tardiness penalty, load imbalance penalty, order cancellation penalty. According to the characteristics of the model, a scatter search algorithm with heuristic repaired strategy for infeasible solutions is designed. To examine algorithm's efficiency and effectiveness, this paper also uses genetic algorithm to solve the model. Using several sets of practical order data as instances, this paper analyzes the two algorithms' results. The numerical analysis shows that the model and the scatter search algorithm are valid.
Based on load balance ideas, this paper constructs an integerprogramming model for the order planning of the steel-iron enterprise, whose objective is to minimize the total cost including earliness-tardiness penalty,...
详细信息
Based on load balance ideas, this paper constructs an integerprogramming model for the order planning of the steel-iron enterprise, whose objective is to minimize the total cost including earliness-tardiness penalty, load imbalance penalty, order cancellation penalty. According to the characteristics of the model, a scatter search algorithm with heuristic repaired strategy for infeasible solutions is designed. To examine algorithm’s efficiency and effectiveness, this paper also uses genetic algorithm to solve the model. Using several sets of practical order data as instances, this paper analyzes the two algorithms’ results. The numerical analysis shows that the model and the scatter search algorithm are valid.
N-1-1 contingency analysis considers the consecutive loss of two elements in a power system, with intervening time for operator adjustments;the associated reliability criterion was recently included in the NERC Standa...
详细信息
ISBN:
(纸本)9781467327275
N-1-1 contingency analysis considers the consecutive loss of two elements in a power system, with intervening time for operator adjustments;the associated reliability criterion was recently included in the NERC Standard TPL-001-1. In this paper, we introduce optimization models for N-1-1 contingency analysis, based on DC optimal power flow considerations. We use mixed-integerprogramming approaches to optimally model the system adjustments required to avoid potential cascading outages during the primary and secondary contingencies. Contingencies are determined via worst-case interdiction analysis. To facilitate operation during the secondary contingency, line overloads and load shedding are allowed. We test our models and algorithms on several IEEE test systems. Our computational experiments indicate potential for the models to augment comprehensive system operations models, such as unit commitment.
Large scale exploitation of Renewable Energy Sources (RES) and their sustainable integration in the power system are important and challenging goals for transmission system operators because of the unpredictability of...
详细信息
ISBN:
(纸本)9781467314534
Large scale exploitation of Renewable Energy Sources (RES) and their sustainable integration in the power system are important and challenging goals for transmission system operators because of the unpredictability of most of these sources. The aim of this paper is to highlight the advantages, in terms of enhanced RES exploitation and improved system flexibility, deriving from the coordinated management of wind power generation and energy storage systems: in particular, a Residual Unit Commitment procedure is proposed in order to provide the generation resources required to satisfy reserve and transmission network constraints. The resulting model consists in a large scale mixed-integerprogramming problem which is solved by the CPLEX optimization package. Tests on the IEEE 24 bus system will be presented.
This paper present a novel method to perform clustering of time-series and static data. The method, named Circle-Clustering (CirCle), could be classified as a partition method that uses criteria from SVM and hierarchi...
详细信息
ISBN:
(纸本)9781467314886
This paper present a novel method to perform clustering of time-series and static data. The method, named Circle-Clustering (CirCle), could be classified as a partition method that uses criteria from SVM and hierarchical methods to perform a better clustering. Different heuristic clustering techniques were tested against the CirCle method by using data sets from UCI Machine Learning Repository. In all tests, CirCle obtained good results and outperformed most of clustering techniques considered in this work. In addition, CirCle was tested against others heuristic techniques considering time-series data from electric feeders in Santiago, Chile's capital city. The optimal solution of the min-cut clustering optimization problem was solved in order to identify the optimal solution for 883 datasets. The results show that the proposed method obtains an average of 81% of well-classified samples in all datasets. Also, as compared to other algorithms, CirCle made a better classification in 98.7% of the datasets as compared to the Model-Base Best BIC. As compared to K-means, Robust K-means and Ward's methods the new algorithm classified better in nearly 68% of the datasets.
The aim of our research is to acquire ideal images of city and urban traffic for various purpose. To achieve the aim, we propose optimization models which consist of city, mobilities and inhabitants. There are two mod...
详细信息
ISBN:
(纸本)9781467327428
The aim of our research is to acquire ideal images of city and urban traffic for various purpose. To achieve the aim, we propose optimization models which consist of city, mobilities and inhabitants. There are two models we are proposed from point of view of accuracy and computation time. One is relatively accurate but takes a lot of time to compute. The other is less accurate, however, larger problems can be computed than the former model. The former model could not solve practical size due to computational time. Through computational experiment using extreme evaluation values, validness of latter model is suggested.
The optimal charging schemes for Electric vehicles (EV) generally differ from each other in the choice of charging periods and the possibility of performing vehicle-to-grid (V2G), and have different impacts on EV econ...
详细信息
ISBN:
(纸本)9781467327275
The optimal charging schemes for Electric vehicles (EV) generally differ from each other in the choice of charging periods and the possibility of performing vehicle-to-grid (V2G), and have different impacts on EV economics. Regarding these variations, this paper presents a numerical comparison of four different charging schemes, namely night charging, night charging with V2G, 24 hour charging and 24 hour charging with V2G, on the basis of real driving data and electricity price of Denmark in 2003. For all schemes, optimal charging plans with 5 minute resolution are derived through the solving of a mixed integer programming problem which aims to minimize the charging cost and meanwhile takes into account the users' driving needs and the practical limitations of the EV battery. In the post processing stage, the rainflow counting algorithm is implemented to assess the lifetime usage of a lithium-ion EV battery for the four charging schemes. The night charging scheme is found to be the cheapest solution after conducting an annual cost comparison.
暂无评论