This paper considers the problem of optimally placing fixed and switched type capacitors in a radial distribution network. The aim of this problem is to minimize the costs associated with capacitor banks, peak power, ...
详细信息
This paper considers the problem of optimally placing fixed and switched type capacitors in a radial distribution network. The aim of this problem is to minimize the costs associated with capacitor banks, peak power, and energy losses whilst satisfying a pre-specified set of physical and technical constraints. The proposed solution is obtained using a two-phase approach. In phase-I, the problem is formulated as a conic program in which all nodes are candidates for placement of capacitor banks whose sizes are considered as continuous variables. A global solution of the phase-I problem is obtained using an interior-point based conic programming solver. Phase-II seeks a practical optimal solution by considering capacitor sizes as discrete variables. The problem in this phase is formulated as a mixedintegerlinear program based on minimizing the L1-norm of deviations from the phase-I state variable values. The solution to the phase-II problem is obtained using a mixed integer linear programming solver. The proposed method is validated via extensive comparisons with previously published results. (C) 2007 Elsevier B.V. All rights reserved.
This paper proposes several schemes for optimal scheduling of power producers in a shipboard power system for a typical offshore supply vessel, having a multiple number of possibly varying capacity gensets. The propos...
详细信息
This paper proposes several schemes for optimal scheduling of power producers in a shipboard power system for a typical offshore supply vessel, having a multiple number of possibly varying capacity gensets. The proposed scheduling methods are illustrated using four alternative power system configurations, ranging from a few large gensets to many gensets of smaller ratings. mixed integer linear programming is used to formulate the optimization problems. Three formulations are presented: one for minimizing online capacity without further objectives, one that includes a redundancy constraint for loosing a group of gensets (to account for a worst-case failure scenario), and one to also balance running hours and minimizing connect/disconnect of the gensets. These different objectives can be combined and weighted based on importance, with or without redundancy constraints. Simulations are carried out to demonstrate the properties of the three different scheduling methods. The first method, minimizing online capacity only, is also used to illustrate the differences between the four genset configurations. This shows, for instance, that using more small gensets ensures generally a lower online available power (the connected capacity matches better the prevailing load) and near optimal loading of each genset around 80% (assuming equal loadsharing), at the same time as resilience to genset failures is preserved.
Traditional truss layout optimization employing the ground structure method will often generate layouts that are too complex to fabricate in practice. To address this, mixed integer linear programming can be used to e...
详细信息
Traditional truss layout optimization employing the ground structure method will often generate layouts that are too complex to fabricate in practice. To address this, mixed integer linear programming can be used to enforce buildability constraints, leading to simplified truss forms. Limits on the number of joints in the structure and/or the minimum angle between connected members can be imposed, with the joints arising from crossover of pairs of members accounted for. However, in layout optimization, the number of constraints arising from 'crossover joints' increases rapidly with problem size, along with computational expense. To address this, crossover constraints are here dynamically generated and added at runtime only as required (so-called lazy constraints);speedups of more than 20 times are observed whilst ensuring that there is no loss of solution quality. Also, results from the layout optimization step are shown to provide a suitable starting point for a non-linear geometry optimization step, enabling results to be obtained that are in agreement with literature solutions. It is also shown that symmetric problems may not have symmetric optimal solutions, and that multiple distinct and equally optimal solutions may be found.
The growing complexity of power system operation demands a greater performance of the modeling approaches, even for generation technologies already consolidated as hydroelectricity. Five mixedintegerlinear programmi...
详细信息
The growing complexity of power system operation demands a greater performance of the modeling approaches, even for generation technologies already consolidated as hydroelectricity. Five mixed integer linear programming formulations for modeling the hydro production function (HPF) are compared: four based on previous references (the traditional method based on a single concave piecewise linear flow-power function, the rectangle method, the logarithmic independent branching 6-stencil method, and the quadrilateral method), and one firstly presented in the paper (the parallelogram method). The comparison is made in the context of daily and weekly hydro scheduling problems of a hypothetical three-plant system on different national day-ahead markets and using different levels of detail in the HPF discretization and time limits. The discussion of results is focused around the relative accuracy, effectiveness, and speed of the analyzed methods to solve the scheduling problems in order to aid in making the most appropriate choice depending on the time horizon. This discussion shows the logarithmic independent branching 6-stencil method as one of the most accurate, the parallelogram method as one of the most effective, and the traditional method based on a single concave piecewise linear flow-power function as the fastest one.
Unmanned air vehicles (UAVs), which have been popular in military context, have recently attracted attention of many researchers because of their potential civilian applications. However, before the UAVs can be used f...
详细信息
Unmanned air vehicles (UAVs), which have been popular in military context, have recently attracted attention of many researchers because of their potential civilian applications. However, before the UAVs can be used for civilian applications, a systematic integration of UAVs in the National Airspace System (NAS) is needed that can allow safe operation of UAVs along with other manned aircrafts. One of the critical capabilities needed for safe operation of the UAVs in the NAS is the ability of UAV to carry out sense and avoid task which would allow the UAV to amend its path to avoid collision with other aircrafts. Despite recent technological advances, such as availability of automatic dependent surveillance broadcast that can transmit position of an aircraft to others in the vicinity, planning a collision-free path autonomously is still challenging in a dynamic environment. The objective of this paper is to develop a methodology for discovering a path for the UAV that meets mission goals, avoids collision, is optimal in terms of path length and, more importantly, is feasible. The paper formulates the problem of path planning using the mathematical paradigm of mixed integer linear programming and provides a solution strategy for solving this problem in the dynamic sense. The tasks of avoidance of obstacles and waypoint navigation are incorporated as constraints in the MILP problem. The paper presents the solution of the MILP problem and verifies the performance of the proposed methodology with regard to optimality of the solution and computational time requirement via several simulated scenarios of different complexities.
This paper presents a mixed integer linear programming (MILP) based approach for determining the optimal number, type and location of automation devices to be installed in the network by considering different types of...
详细信息
This paper presents a mixed integer linear programming (MILP) based approach for determining the optimal number, type and location of automation devices to be installed in the network by considering different types of devices simultaneously (remotely controlled circuit breakers/reclosers, sectionalizing switches, remotely supervised fault passage indicators). Simultaneously, it determines the new (optimal) locations of the automation devices that already exist in the network. In determining the most effective network automation scenario, the proposed approach takes into account the outage cost of consumers/producers due to momentary, short-term, and long-term interruptions, the commonly used network reliability indices (SAIFI, SAIDI, MAIFI, and ASIDI) as well as the cost of automation devices and the cost of crews. It provides the best network automation scenario in distribution systems if the network reliability indices are used for measuring the distribution system reliability, if cost of interruptions is defined to all consumers/producers, and if both aforementioned approaches (criteria) are used. (C) 2017 Elsevier B.V. All rights reserved.
The performance of classification methods, such as Support Vector Machines, depends heavily on the proper choice of the feature set used to construct the classifier. Feature selection is an NP-hard problem that has be...
详细信息
The performance of classification methods, such as Support Vector Machines, depends heavily on the proper choice of the feature set used to construct the classifier. Feature selection is an NP-hard problem that has been studied extensively in the literature. Most strategies propose the elimination of features independently of classifier construction by exploiting statistical properties of each of the variables, or via greedy search. All such strategies are heuristic by nature. In this work we propose two different mixed integer linear programming formulations based on extensions of Support Vector Machines to overcome these shortcomings. The proposed approaches perform variable selection simultaneously with classifier construction using optimization models. We ran experiments on real-world benchmark datasets, comparing our approaches with well-known feature selection techniques and obtained better predictions with consistently fewer relevant features. (C) 2014 Elsevier Inc. All rights reserved.
In this paper, we consider a multi-attribute technician routing and scheduling problem motivated by an application for the maintenance and repair of electronic transaction equipment. This problem is aimed at routing t...
详细信息
In this paper, we consider a multi-attribute technician routing and scheduling problem motivated by an application for the maintenance and repair of electronic transaction equipment. This problem is aimed at routing technicians to perform tasks at different customer locations so as to maximize the total gain associated with served customers, minus the operations costs (total travelled distance and overtime of the technicians). At the same time, a number of constraints must be satisfied like technician skills, breaks, maximum distance, multiple time windows and parts inventory. A mixed integer linear programming model is proposed to address this problem, which is then solved with a commercial solver. The computational results explore the difficulty of the problem along various dimensions and underline its inherent complexity.
Due to booming economic development over the past decades, energy demands in most of China's provincial power grids have increased sharply, and it has become challenging to guarantee the energy balance at peak per...
详细信息
Due to booming economic development over the past decades, energy demands in most of China's provincial power grids have increased sharply, and it has become challenging to guarantee the energy balance at peak periods. In many provincial electric systems of China, gas-fired generators are one of the most important peaking power sources to respond the load change at peak periods. To meet this practical necessity, a novel mixed integer linear programming model is proposed in this paper for the peak operation of gas-fired generating units with disjoint-prohibited operating zones. In the developed model, the objective function is chosen to minimize the peak-valley difference of the remaining load series that is obtained by subtracting the total generation of all the gas-fired units from the original load curve. The real-world simulations in several cases show that the developed model is able to generate satisfying scheduling results by reasonably allocating the power outputs of all the gas-fired generators in the scheduling horizon. Then, the management implications obtained lie in the fact that it is necessary to increase the share of peak power sources in the mid- to long-term planning of an electrical power system;and in the daily operation of the power grid, greater flexibility should be given to the gas-fired units to reduce peak pressure.
Square-based fiducial markers are one of the most popular approaches for camera pose estimation due to its fast detection and robustness. In order to maximize their error correction capabilities, it is required to use...
详细信息
Square-based fiducial markers are one of the most popular approaches for camera pose estimation due to its fast detection and robustness. In order to maximize their error correction capabilities, it is required to use an inner binary codification with a large inter-marker distance. This paper proposes two mixed integer linear programming (MILP) approaches to generate configurable square-based fiducial marker dictionaries maximizing their inter-marker distance. The first approach guarantees the optimal solution, however, it can only be applied to relatively small dictionaries and number of bits since the computing times are too long for many situations. The second approach is an alternative formulation to obtain suboptimal dictionaries within restricted time, achieving results that still surpass significantly the current state of the art methods. (C) 2015 Elsevier Ltd. All rights reserved.
暂无评论