There is an increasing number of natural disasters occurring worldwide, particularly in populated areas. These events affect a large number of people, causing injuries and fatalities. Providing rapid medical treatment...
详细信息
There is an increasing number of natural disasters occurring worldwide, particularly in populated areas. These events affect a large number of people, causing injuries and fatalities. Providing rapid medical treatment is of utmost importance in such circumstances. The problem of transporting patients to medical facilities has been studied to only a small extent. One of the challenges is to find a strategy that can simultaneously maximize the number of survivors and minimize the total evacuation cost under a given set of resource and geographic constraints. We propose a mathematical optimization model called Triage-Assignment-Transportation (TAT) model that decides on the tactical routing assignment of several classes of evacuation vehicles between staging areas and shelters in the nearby area. The model takes into account the level of injury to the evacuees, the capacities of vehicles, and available resources at each shelter. TAT is a mixed-integer linear programming and minimum-cost flow model. Comprehensive computational experiments are performed to examine the applicability of the TAT model. TAT can offer valuable insights for decision-makers about the number of staging areas, evacuation vehicles, and medical resources that are required to complete a large-scale evacuation based on the estimated number of evacuees.
The analysis of electricity market model plays a very important role in power system planning and market design. It is usually established based on economic deliberation and reliability requirement. This paper investi...
详细信息
ISBN:
(纸本)9781509025985
The analysis of electricity market model plays a very important role in power system planning and market design. It is usually established based on economic deliberation and reliability requirement. This paper investigates the electricity market clearing model (MCM) of Singapore as a representative of Southeast Asia countries. The MCM is formulated as an optimization framework, where the system network topology is properly incorporated. The market clearing policies for energy and ancillary services are explicitly included in the mathematical model. Case studies have been performed on a transmission test system based on local market data. The optimal dispatch for generation production, as well as the locational marginal prices are achieved, providing effective decision-making support for power system planners and operators.
Compared to legacy wavelength division multiplexing networks, elastic optical networks (EONs) have added flexibility to network deployment and management. EONs can include previously available functionality, such as s...
详细信息
Compared to legacy wavelength division multiplexing networks, elastic optical networks (EONs) have added flexibility to network deployment and management. EONs can include previously available functionality, such as signal regeneration and wavelength conversion, as well as new features such as finer-granularity spectrum assignment and modulation conversion. Yet each added feature adds to the cost of the network. In order to quantify the potential benefit of each functionality, we present a link-based mixed-integer linear programming (MILP) formulation to solve the optimal resource allocation problem. We then propose a recursive model in order to either augment existing network deployments (spectrum and regenerators) or speed up the resource allocation computation time for larger networks with higher traffic demand requirements than can be solved using an MILP. We show through simulation that systems equipped with signal regenerators or wavelength converters require a notably smaller total bandwidth, depending on the topology of the network. We also show that the suboptimal recursive solution speeds up the calculation and makes the running time more predictable, compared to the optimal MILP.
Teaching assistants (TAs), together with the senior academic staff, are the centerpiece of university education. TAs are primarily graduate students and they undertake many of the academic and administrative tasks. Th...
详细信息
Teaching assistants (TAs), together with the senior academic staff, are the centerpiece of university education. TAs are primarily graduate students and they undertake many of the academic and administrative tasks. These tasks are assigned at the beginning of each semester and the objective is to make fair assignments so that the loads are distributed evenly in accordance with requests of the professors and assistants. In this study, a goal programming (GP) model is developed for task assignment of the TAs in an industrial engineering department. While the rules that must be strictly met (e.g., assigning every task to an assistant) are formulated as hard constraints, fair distribution of the loads are modeled as soft constraints. Penalties for deviation from the soft constraints are determined by the Analytic Hierarchy Process (AHP). The proposed GP model avoids assigning the same TA to the same task in several consecutive academic years, i.e., sticking of a task to a TA. We show that the proposed formulation generates better schedules than the previously used ad hoc method with a much less effort. (C) 2014 Elsevier Ltd. All rights reserved.
In a market comprised of multiple price-maker firms, the payoff each firm receives depends not only on one's own actions but also on the actions of the other firms. This is the defining characteristic of a non-coo...
详细信息
In a market comprised of multiple price-maker firms, the payoff each firm receives depends not only on one's own actions but also on the actions of the other firms. This is the defining characteristic of a non-cooperative economic game. In this article, we ask: What is the revenue-maximizing production schedule for multiple price-maker hydroelectric producers competing in a deregulated, bid-based market? In every time stage, we seek a set of bids such that, given all other price-maker producers' bids, no price-maker can improve (increase) their revenue by changing their bid;i.e., a pure-strategy Nash-Cournot equilibrium. From a theoretical game theory perspective, the analysis on the underlying non-cooperative game is lacking. Specifically, existing approaches are not able to detect when multiple equilibria exist and consider any equilibrium found optimal. In our approach, we create interpolations for each price-maker's best response function using mixed-integer linear programming formulations within a dynamic programming framework. In the presence of multiple Nash equilibria, when one exists, our approach finds the equilibrium that is Pareto optimal. If a Pareto-optimal Nash equilibrium does not exist, we use a tailored bargaining algorithm to determine a unique solution. To illustrate some of the finer details of our method, we present three examples and a case study on an electricity market in Honduras.
To attain the highest performance of energy supply systems, it is necessary to rationally determine types, capacities, and numbers of equipment in consideration of their operational strategies corresponding to seasona...
详细信息
To attain the highest performance of energy supply systems, it is necessary to rationally determine types, capacities, and numbers of equipment in consideration of their operational strategies corresponding to seasonal and hourly variations in energy demands. In the combinatorial optimization method based on the mixed-integer linear programming (MILP), integer variables are used to express the selection, numbers, and on/off status of operation of equipment, and the number of these variables increases with those of equipment and periods for variations in energy demands, and affects the computation efficiency significantly. In this paper, a MILP method utilizing the hierarchical relationship between design and operation variables is proposed to solve the optimal design problem of energy supply systems efficiently: At the upper level, the optimal values of design variables are searched by the branch and bound method;At the lower level, the values of operation variables are optimized independently at each period by the branch and bound method under the values of design variables given tentatively during the search at the upper level;Lower bounds for the optimal value of the objective function to be minimized are evaluated, and are utilized for the bounding operations at both the levels. This method is implemented into open and commercial MILP solvers. Illustrative and practical case studies on the optimal design of co-generation systems are conducted, and the validity and effectiveness of the proposed method are clarified. (C) 2014 Elsevier Ltd. All rights reserved.
Finding an exact optimal solution of the Nonlinear Discrete Transportation Problem (NDTP) represents a challenging task in transportation science. Development of an adequate model formulation and selection of an appro...
详细信息
Finding an exact optimal solution of the Nonlinear Discrete Transportation Problem (NDTP) represents a challenging task in transportation science. Development of an adequate model formulation and selection of an appropriate optimization method are thus significant for attaining valuable solution of the NDTP. When nonlinearities appear within the criterion of optimization, the NDTP can be formulated directly as a mixed-integer Nonlinearprogramming (MINLP) task or it can be linearized and converted into a mixed-integer linear programming (MILP) problem. This paper presents a comparison between MILP and MINLP approaches to exact optimal solution of the NDTP. The comparison is based on obtained results of experiments executed on a set of reference test problems. The paper discusses advantages and limitations of both optimization approaches.
An integrated chemical site involves a complex network of chemical plants. Typically, these plants interact closely, are dependent on each other for raw materials and demand for their products, and have the provision ...
详细信息
An integrated chemical site involves a complex network of chemical plants. Typically, these plants interact closely, are dependent on each other for raw materials and demand for their products, and have the provision of intermediate storage tanks to help manage inventory at strategic points in the network. Disruptions in the operation of these plants can drastically affect flow of material in the site network. As a result, the choice of sequence and timing of planned periodic turnarounds, which are major disruptions, is important in order to minimize effects on profits and production. We investigate a discrete-time mixed-integer linear programming (MILP) model to perform turnaround optimization. The objective is to recommend potential schedules in order to minimize losses while satisfying network, resource, turnaround, demand, financial and other practical constraints. We propose general formulations to tackle this problem and study an industrial-size site network under various scenarios over a long-term horizon. (C) 2014 Elsevier Ltd. All rights reserved.
The increasing popularity of smart energy systems has led to a gradual increase in the importance of thermal energy storage (TES) technology. Thus, the control strategy employed to efficiently take advantage of TES is...
详细信息
The increasing popularity of smart energy systems has led to a gradual increase in the importance of thermal energy storage (TES) technology. Thus, the control strategy employed to efficiently take advantage of TES is expected to be very important. In other words, the time schedule, the particular components to be activated, and the amount of charging/discharging have to be appropriately determined. To date, a number of studies have investigated the optimization of TES operations by using optimization techniques. Current methods being used to achieve optimal TES operation are reviewed in this paper. (C) 2015 Elsevier B.V. All rights reserved.
This paper addresses the multi-objective optimization problem arising in the operation of heat integrated batch plants, where makespan and utility consumption are the two conflicting objectives. A new continuous-time ...
详细信息
This paper addresses the multi-objective optimization problem arising in the operation of heat integrated batch plants, where makespan and utility consumption are the two conflicting objectives. A new continuous-time MILP formulation with general precedence variables is proposed to simultaneously handle decisions related to timing, product sequencing, heat exchanger matches (selected from a two-stage superstructure) and their heat loads. It features a complex set of timing constraints to synchronize heating and cooling tasks, derived from Generalized Disjunctive programming. Through the solution of an industrial case study from a vegetable oil refinery, we show that major savings in utilities can be achieved while generating the set of Pareto optimal solutions through the 6-constraint method. (C) 2015 Elsevier Ltd. All rights reserved.
暂无评论