This paper deals with day-ahead security management with respect to a postulated set of contingencies, while taking into account uncertainties about the next day generation/load scenario. In order to help the system o...
详细信息
This paper deals with day-ahead security management with respect to a postulated set of contingencies, while taking into account uncertainties about the next day generation/load scenario. In order to help the system operator in decision making under uncertainty, we aim at ranking these contingencies into four clusters according to the type of control actions needed to cover the worst uncertainty pattern of each contingency with respect to branch overload. To this end we use a fixed point algorithm that loops over two main modules: a discrete bi-level program (BLV) that computes the worst-case scenario, and a special kind of security constrained optimal power flow (SCOPF) which computes optimal preventive/corrective actions to cover the worst-case. We rely on a DC grid model, as the large number of binary variables, the large size of the problem, and the stringent computational requirements preclude the use of existing mixedinteger nonlinearprogramming (MINLP) solvers. Consequently we solve the SCOPF using a mixed integer linear programming (MILP) solver while the BLV is decomposed into a series of MILPs. We provide numerical results with our approach on a very large European system model with 9241 buses and 5126 contingencies.
In many services, promise of specific response time is advertised as a commitment by the service providers for the customer satisfaction. Congestion on service facilities could delay the delivery of the services and h...
详细信息
In many services, promise of specific response time is advertised as a commitment by the service providers for the customer satisfaction. Congestion on service facilities could delay the delivery of the services and hurts the overall satisfaction. In this paper, congestion service facilities location problem with promise of response time is studied, and a mixedinteger nonlinearprogramming model is presented with budget constrained. The facilities are modeled as M/M/c queues. The decision variables of the model are the locations of the service facilities and the number of servers at each facility. The objective function is to maximize the demands served within specific response time promised by the service provider. To solve this problem, we propose an algorithm that combines greedy and genetic algorithms. In order to verify the proposed algorithm, a lot of computational experiments are tested. And the results demonstrate that response time has a significant impact on location decision.
This work presents an optimisation based approach for the integrated plan and evaluation of Distributed Energy Resources (DER) systems. The mathematical model takes into account site energy loads, local climate data, ...
详细信息
This work presents an optimisation based approach for the integrated plan and evaluation of Distributed Energy Resources (DER) systems. The mathematical model takes into account site energy loads, local climate data, utility tariff structure, characteristics of the candidate DER technologies (technical and financial) as well as geographical aspects. The optimal integrated DER system is selected by minimising the total energy cost while guaranteeing reliable system operation. As an illustrative example, we consider a neighbourhood in Athens (Greece), where several options for satisfying its electricity and heat demands are investigated. The adoption of DER technologies combined with a heating pipeline network and a microgrid is examined. (C) 2012 Elsevier Ltd. All rights reserved.
This paper deals with a particular version of the hybrid flow shop scheduling problem inspired from a real application in the automotive industry. Specific constraints such as pre-assigned jobs, non-identical parallel...
详细信息
This paper deals with a particular version of the hybrid flow shop scheduling problem inspired from a real application in the automotive industry. Specific constraints such as pre-assigned jobs, non-identical parallel machines and non-compatibility between certain jobs and machines are considered in order to minimise the total tardiness time. A mixed-integerprogramming model that incorporates these aspects is developed and solved using ILOG Cplex software. Thus, because of the computation time constraint, we propose approximate resolution methods based on genetic and particle swarm optimisation algorithms coupled or not with fuzzy logic control. The effectiveness of these methods is investigated via computational experiments based on theoretical and real case instances. The obtained results show that fuzzy logic control improves the performances of both genetic and particle swarm optimisation algorithms significantly.
We address the integration of scheduling and dynamic optimization for batch chemical processes. The processes can have complex network structures, allowing material splitting and mixing. The integrated problem is form...
详细信息
We address the integration of scheduling and dynamic optimization for batch chemical processes. The processes can have complex network structures, allowing material splitting and mixing. The integrated problem is formulated as a mixed-integer dynamic optimization problem where a continuous-time scheduling model is linked to the dynamic models via processing times, processing costs, and batch sizes. To reduce the computational complexity, we develop a tailored and efficient decomposition method based on the framework of generalized Benders decomposition by exploiting the special structure of the integrated problem. The decomposed master problem is a scheduling problem with variable processing times and processing costs, as well as the Benders cuts. The primal problem comprises a set of separable dynamic optimization problems for the processing units. By collaboratively optimizing the process scheduling and the process dynamics, the proposed method substantially improve the overall economic performance of the batch production compared with the conventional sequential method which solves the scheduling problem and the dynamic optimization problems separately. In comparison with the simultaneous method which solves the integrated problem by a general-purpose MINLP solver directly, the proposed method can reduce computational times by orders of magnitude.
Outbound logistics network (OLN) in the downstream supply chain of a firm plays a dominant role in the success or failure of that firm. This paper proposes the design of a hybrid and flexible OLN in multi objective co...
详细信息
Outbound logistics network (OLN) in the downstream supply chain of a firm plays a dominant role in the success or failure of that firm. This paper proposes the design of a hybrid and flexible OLN in multi objective context. The proposed distribution network for a manufacturing supply chain consists of a set of customer zones (CZs) at known locations with known demands being served by a set of potential manufacturing plants, a set of potential central distribution centers (CDCs), and a set of potential regional distribution centers (RDCs). Three variants of a single product classified based on nature of demand are supplied to CZs through three different distribution channels. The decision variables include number of plants, CDCs, RDCs, and quantities of each variant of product delivered to CZs through a designated distribution channel. The goal is to design the network with multiple objectives so as to minimize the total cost, maximize the unit fill rates, and maximize the resource utilization of the facilities in the network. The problem is formulated as a mixed integer linear programming problem and a multiobjective genetic algorithm (MOGA) called non-dominated sorting genetic algorithm-II (NSGA-II) is employed to solve the resulting NP-hard combinatorial optimization problem. Computational experiments conducted on randomly generated data sets are presented and analyzed showing the effectiveness of the solution algorithm for the proposed network.
In the paper a multi-objective optimization model for distributed energy supply systems optimization is presented. The superstructure of the system comprehends a district heating network that connects the users to eac...
详细信息
In the paper a multi-objective optimization model for distributed energy supply systems optimization is presented. The superstructure of the system comprehends a district heating network that connects the users to each other, small-scale CHP systems, large centralized solar plant and a thermal storage. The optimization has to determine the optimal structure of the system, the size of each component inside the optimal solution and the optimal operation strategy. The multi-objective optimization is based on a MILP (mixed integer linear programming) model and takes into account as objective function a linear combination of the annual cost for owning, maintaining and operating the whole system and the CO2 emissions associated to the system operation. The model allows to obtain different optimal solutions by varying the relative weight of the economic and the environmental objectives. In this way the Pareto Front is identified and the possible improvements in both economic and environmental terms can be highlighted. The model has been applied to a specific case study and it has been optimized for different superstructure configurations and for two different values of the electricity carbon intensity. The obtained results show that the solar plant, coupled with the optimal thermal storage, allows reaching both environmental and economic goals. (C) 2012 Elsevier Ltd. All rights reserved.
This work deals with the optimal short-term scheduling of general multipurpose batch plants, considering multiple operational characteristics such as sequence-dependent changeovers, temporary storage in the processing...
详细信息
This work deals with the optimal short-term scheduling of general multipurpose batch plants, considering multiple operational characteristics such as sequence-dependent changeovers, temporary storage in the processing units, lots blending, and material flows traceability. A novel mixed integer linear programming (MILP) discrete-time formulation based on the State-Task Network (STN) is proposed, with new types of constraints for modeling changeovers and storage. We also propose some model extensions for addressing changeovers start;nonpreemptive lots;lots start and sizes;alternative task-unit and task-unit-layout assignments. Computational tests have shown that the proposed model is more effective than a similar model based on the Resource-Task Network (RTN).
Due to the rapidly increasing design complexity in modern IC designs, metal-only engineering change order (ECO) becomes inevitable to achieve design closure with a low respin cost. Traditionally, preplaced redundant s...
详细信息
Due to the rapidly increasing design complexity in modern IC designs, metal-only engineering change order (ECO) becomes inevitable to achieve design closure with a low respin cost. Traditionally, preplaced redundant standard cells are regarded as spare cells. However, these cells are limited by predefined functionalities and locations, and they always consume leakage power despite their inputs being tied off. To overcome the inflexibility and power overhead, a new type of spare cells, called metal-configurable gate-array spare cells, are introduced. In this paper, we address a new ECO problem, which performs design changes using metal-configurable gate-array spare cells. We first study the properties of this new ECO problem and propose a new cost metric, aliveness, to model the capability of a spare gate array. Based on aliveness and routability, we then develop two ECO optimization frameworks, one for timing ECO and the other for functional ECO. Experimental results show that our approach delivers superior efficiency and effectiveness.
Systematic methods for prioritizing the repair and removal of fish passage barriers, while growing of late, have hitherto focused almost exclusively on meeting the needs of migratory fish species (e.g., anadromous sal...
详细信息
Systematic methods for prioritizing the repair and removal of fish passage barriers, while growing of late, have hitherto focused almost exclusively on meeting the needs of migratory fish species (e.g., anadromous salmonids). An important but as of yet unaddressed issue is the development of new modeling approaches which are applicable to resident fish species habitat restoration programs. In this paper, we develop a budget constrained optimization model for deciding which barriers to repair or remove in order to maximize habitat availability for stream resident fish. Habitat availability at the local stream reach is determined based on the recently proposed C metric, which accounts for the amount, quality, distance and level of connectivity to different stream habitat types. We assess the computational performance of our model using geospatial barrier and stream data collected from the Pine-Popple Watershed, located in northeast Wisconsin (USA). The optimization model is found to be an efficient and practical decision support tool. Optimal solutions, which are useful in informing basin-wide restoration planning efforts, can be generated on average in only a few minutes. (C) 2013 Elsevier Ltd. All rights reserved.
暂无评论