This thesis describes a stochastic, network interdiction optimization model to guide defensive, counter-air (DCA) operations planning. We model a layered, integrated air-defense system, which consists of fighter and m...
详细信息
This thesis describes a stochastic, network interdiction optimization model to guide defensive, counter-air (DCA) operations planning. We model a layered, integrated air-defense system, which consists of fighter and missile engagement zones. We extend an existing two-stage, stochastic, generalized-network interdiction model by Pan, Charlton and Morton, and adapt it to DCA operations planning. The extension allows us to handle multiple-type interdiction assets, and constrain the attacker's flight path by the maximum allowable traveled distance. The defender selects the locations to install multiple interceptor types, with uncertainty in the attacker's origin and destination, in order to minimize the probability of evasion, or the expected target value collected by the evader. Then, the attacker reveals an origin-destination pair (independent of the defender's decision), and sends a strike package along a path (through the interdicted network) that maximizes his probability of evasion. By adding a small persistence penalty we ensure the plans are consistent in presence of minor variations in the number of interceptors. We present computational results for several instances of a test case consisting of the airspace over a 360-by-360 nautical miles area. The computational time ranges from some seconds to ten minutes, which is acceptable for operational use of this model.
The future of urban energy systems relies on the transition to "smart energy networks" which incorporate energy storage with renewable energy sources such as wind and solar. Hydrogen provides a desirable ene...
详细信息
The future of urban energy systems relies on the transition to "smart energy networks" which incorporate energy storage with renewable energy sources such as wind and solar. Hydrogen provides a desirable energy vector for both energy storage and exchange of energy between energy hubs within a smart energy network. This paper aims to develop a generic mathematical model for the optimal energy management of future communities where hydrogen is used as an energy vector. An energy hub is a novel concept that systematically and holistically considers the energy requirements of both mobility and stationary loads. In order to perform optimization studies, the minimization of capital cost of hydrogen refueling stations and operation and maintenance cost of all energy hubs within the network are considered. The modeling and optimization are undertaken and carried out in the General Algebraic Modeling Software (GAMS). The case study considers four energy hubs consisting of a commercial building, school, residential complex, as well as hydrogen refueling stations. The study investigates the optimal operation of different energy conversion and storage technologies in order to meet the demand of energy. The results showed that the optimum size of electrolyser and hydrogen tank for supplying the hydrogen demand in the energy hub network is two 290-kW electrolysers and four 30-kg tanks, respectively. The average daily strike price of electricity by which the electrolyser operates is $0.036 per kWh and will not operate when the average hourly Ontario electricity price is higher than $0.13 per kWh. The levelized cost of hydrogen produced by hydrogen refueling station is estimated to be $6.74 per kg. Moreover, the optimal operation of energy conversion and energy storage technologies within each hub and the optimal interaction between energy hubs with in the network are also investigated. In addition, it is shown that distributed hydrogen generation is more preferable than H-2 delive
A one-minute delay in treating out-of-hospital cardiac arrest reduces a patient's chance of survival by 10%, making the treatment performance extremely time-sensitive. However, timely real-time access to automated...
详细信息
This paper proposes a multi-agent system for solving unit commitment problems. Multi-agent is a new paradigm for developing software applications. Coordinating the behavior of autonomous agents is a key issue in agent...
详细信息
ISBN:
(纸本)0780373227
This paper proposes a multi-agent system for solving unit commitment problems. Multi-agent is a new paradigm for developing software applications. Coordinating the behavior of autonomous agents is a key issue in agent oriented programming techniques today. In this paper, we develop a power system unit commitment application using multi-agent architecture. Our model has the following characteristics: (1) the system consists of a single facilitator agent, several generator-agents, and two kinds of mobile agent. (2) The facilitator agent is developed to act as a manager for the process by using the singleton design pattern. The mobile agent and generator agent have simple negotiation strategies. (3) Message object is developed to communicate between agents using KQML-like object. The proposed approach is applied to a simple system, and the results show that the multi-agent system is able to find optimal solutions for unit commitment problems.
This paper presents a method that uses designed experiments and statistical models to extract information about how solver parameter settings perform for classes of mixedinteger programs. The use of experimental desi...
详细信息
This paper presents a method that uses designed experiments and statistical models to extract information about how solver parameter settings perform for classes of mixedinteger programs. The use of experimental design facilitates fitting a model that describes the response surface across all combinations of parameter settings, even those not explicitly tested, allowing identification of both desirable and poor settings. Identifying parameter settings that give the best expected performance for a specific class of instances and a specific solver can be used to more efficiently solve a large set of similar instances, or to ensure solvers are being compared at their best.
This thesis describes a stochastic, network interdiction optimization model to guide defensive, counter-air (DCA) operations planning. We model a layered, integrated air-defense system, which consists of fighter and m...
详细信息
This thesis describes a stochastic, network interdiction optimization model to guide defensive, counter-air (DCA) operations planning. We model a layered, integrated air-defense system, which consists of fighter and missile engagement zones. We extend an existing two-stage, stochastic, generalized-network interdiction model by Pan, Charlton and Morton, and adapt it to DCA operations planning. The extension allows us to handle multiple-type interdiction assets, and constrain the attacker's flight path by the maximum allowable traveled distance. The defender selects the locations to install multiple interceptor types, with uncertainty in the attacker's origin and destination, in order to minimize the probability of evasion, or the expected target value collected by the evader. Then, the attacker reveals an origin-destination pair (independent of the defender's decision), and sends a strike package along a path (through the interdicted network) that maximizes his probability of evasion. By adding a small persistence penalty we ensure the plans are consistent in presence of minor variations in the number of interceptors. We present computational results for several instances of a test case consisting of the airspace over a 360-by-360 nautical miles area. The computational time ranges from some seconds to ten minutes, which is acceptable for operational use of this model.
This is a comparison of two state-of-the-art large-scale nonlinear optimization systems exhibiting unprecedented problem solution capabilities both in size of problem handled and method of solution. These codes are MI...
详细信息
This is a comparison of two state-of-the-art large-scale nonlinear optimization systems exhibiting unprecedented problem solution capabilities both in size of problem handled and method of solution. These codes are MINOS, developed by B. A. Murtagh and M. A. Saunders, and XS, developed by G. G. Brown and G. W. Graves. The codes are evaluated with respect to their problem solving capabilities and potential for practical applica- tion by analysts. Computational results are presented for thirteen nonlinear and nonlinear mixedinteger test problems with from two to 793 variables (12 to 100 integer variables) and one to 401 constraints. Portions of this work were presented at the CORS/ORSA/TIMS joint meeting in Toronto, May 1981.
The United States Army is transforming and at war. This transformation is enabled by the 2005 round of Base Realignment and Closure (BRAC). If approved, this BRAC round will require the Army to spend about $13 billion...
详细信息
The United States Army is transforming and at war. This transformation is enabled by the 2005 round of Base Realignment and Closure (BRAC). If approved, this BRAC round will require the Army to spend about $13 billion over six years, moving over 2,500 distinct units and undertaking military construction projects at about 180 locations. An anticipated savings of $24 billion over 20 years motivates this expense. During implementation of the last BRAC round in 1995, the Army used an integer linear program, the BRAC Action Scheduler (BRACAS), to prescribe BRAC implementation schedules. We modify BRACAS by adding unit-level resolution, including schedules and personnel strength to account for wartime deployments and transformation initiatives. The improved BRACAS produces realistic execution plans, and generates a schedule of feasibly timed unit moves. We conduct an extensive analysis using data provided by the Army. Our analysis shows the Army can synchronize BRAC implementation, transformation initiatives and wartime requirements. We find that including the deployment and transformation schedule limitations of major units does not significantly impact BRAC savings. We also find unlimited annual implementation budgets make additional savings approaching $900 million possible. Returning forces from Germany early in implementation may save more - up to $4 billion minus additional facilities costs.
This project considers railway timetable development where the expected passenger travel time is minimized. Buffers are placed in the network to absorb delays and an optimization model is formulated to choose these bu...
详细信息
This project considers railway timetable development where the expected passenger travel time is minimized. Buffers are placed in the network to absorb delays and an optimization model is formulated to choose these buffers optimally to minimize expected passenger travel time. A new way of modeling so called "excess journey time" has been proposed. Given this optimization model, a piecewise-linear approximation of the problem is formulated, where error bounds in terms of the objective function are given. In the model and literature regarding this subject a simplification of reality is made, by dividing the train network into independent parts, to get analytical expressions for the goal function. A model where this simplification is not made is developed and it is found that the simplification causes a severe decrease in solution quality. However, in this research a heuristic is proposed which results in solutions that are very close to optimality. The model is applied to the Dutch intercity network where it is concluded that the model is able to generate timetables meeting the demands necessary for the Dutch network.
This master thesis focuses on quantifying the value of flexibility in the FMCG customized supply chain. The customized supply chain considered in this research is referred to as an outsourced supply chain in which the...
详细信息
This master thesis focuses on quantifying the value of flexibility in the FMCG customized supply chain. The customized supply chain considered in this research is referred to as an outsourced supply chain in which the customization process is outsourced to so-called co-packing companies. We develop a realistic Aggregate Production Planning (APP) model that schedules production orders to co-packers with the objective of minimizing the total of all costs involved in the outsourced customized supply chain. The model is formulated as a discrete-time mixed integer programming (MIP) model, in which all relevant co-packer characteristics are mathematically included. Subsequently, the APP model is tested in the context of the Procter & Gamble (P&G) customized supply chain within a rolling horizon scheme, which enables the model to periodically update input parameters. At first, the model is tested using the maximum forecast as input. Additionally, the model is tested in the context of a repeated newsvendor problem since most P&G customized SKUs are low- demand products. Results show that the model which uses the maximum forecast as input performs best, even when the maximum forecast or newsvendor fractile of the second model is tuned. An important implication is that reconsidering the current P&G allocation policy and adjusting the current co-packing portfolio, including the capacity boundaries, leads to significant improvements in service and costs. Furthermore, results show that limited flexibility, configured in an appropriate way, yields many of the costs benefits of total flexibility.
暂无评论