Multi-objective optimization (MOO) has recently attracted an increasing interest in environmental engineering. One major limitation of the existing solution methods for MOO is that their computational burden tends to ...
详细信息
Multi-objective optimization (MOO) has recently attracted an increasing interest in environmental engineering. One major limitation of the existing solution methods for MOO is that their computational burden tends to grow rapidly in size with the number of environmental objectives. In this paper, we study the use of Principal Component Analysis (PCA) to identify redundant environmental metrics in MOO that can be omitted without disturbing the main features of the problem, thereby reducing the associated complexity. We show that, besides its numerical usefulness, the use of PCA coupled with MOO provides valuable insights on the relationships between environmental indicators of concern for decision-makers. The capabilities of the proposed approach are illustrated through its application to the design of environmentally conscious chemical supply chains (SCs). (C) 2011 Elsevier Ltd. All rights reserved.
In this paper, we study a variant of the resource-constrained project scheduling problem in which resources are flexible, i.e., each resource has several skills. Each activity in the project may need several resources...
详细信息
In this paper, we study a variant of the resource-constrained project scheduling problem in which resources are flexible, i.e., each resource has several skills. Each activity in the project may need several resources for each required skill. We present a mixed-integer linear programming formulation for this problem. Several sets of additional inequalities are also proposed. Due to the fact that some of the above-mentioned inequalities require a valid upper bound to the problem, a heuristic procedure is proposed. Computational experience is reported based on randomly generated data, showing that for instances of reasonable size the proposed model enlarged with the additional inequalities can be solved efficiently.
This paper addresses the design of joint source-channel variable-length codes with maximal free distance for given codeword lengths. While previous design methods are mainly based on bounds on the free distance of the...
详细信息
ISBN:
(纸本)9780769546568
This paper addresses the design of joint source-channel variable-length codes with maximal free distance for given codeword lengths. While previous design methods are mainly based on bounds on the free distance of the code, the proposed algorithm exploits an exact characterization of the free distance. The code optimization is cast in the framework of mixed-integer linear programming and allows to tackle practical alphabet sizes in reasonable computing time.
In the current study, the costs and benefits of deploying energy storage system (ESS) are discussed, and the role of ESS in transmission expansion planning (TEP) is investigated. Based on the classical formulation of ...
详细信息
ISBN:
(纸本)9781467327299
In the current study, the costs and benefits of deploying energy storage system (ESS) are discussed, and the role of ESS in transmission expansion planning (TEP) is investigated. Based on the classical formulation of TEP, a new formulation is developed considering the simultaneous addition of new circuits and installation of ESS. The fictitious costs of ESS are set instead of actual costs in the proposed model, which can be used to determine the site and size of ESS for transmission investment reduction. The whole formulation is a mixed-integer linear programming problem and can be solved by the well-developed algorithms. The proposed TEP method, which considers the optimal deployment of ESS, has been simulated on three test systems. Test results show the effectiveness of the proposed method and illustrate the potential of installing ESS to reduce network investment costs.
The generation maintenance scheduling problem faced by a power producer aims at defining the optimal time intervals for the maintenance of each generating unit. The planning horizon is typically mid-term (year-ahead)....
详细信息
ISBN:
(纸本)9781467308328;9781467308342
The generation maintenance scheduling problem faced by a power producer aims at defining the optimal time intervals for the maintenance of each generating unit. The planning horizon is typically mid-term (year-ahead). In this paper, the annual maintenance scheduling problem of a thermal producer is solved with respect to economic and technical security criteria. The aim is to maximize yearly profit, while simultaneously satisfying the operating constraints of the producer's generating units. Specific constraints regarding unit maintenance are also taken into consideration, such as avoiding the simultaneous planned outage of generating units that belong to the same power station, and maintenance intervals that must be scheduled whenever a specific number of operating hours is completed. The generation maintenance scheduling problem is formulated and solved as a mixed-integer linear programming problem using commercial software (GAMS/CPLEX).
This paper proposes a coexistence model for two independent companies both operating hydropower plants in the same river flow, based on a case study of the Cetina river basin in Croatia. Companies are participants of ...
详细信息
This paper proposes a coexistence model for two independent companies both operating hydropower plants in the same river flow, based on a case study of the Cetina river basin in Croatia. Companies are participants of the day-ahead electricity market. The incumbent company owns the existing hydropower plants and holds concessions for the water. The new company decides to build a pump storage hydropower plant that uses one of the existing reservoirs as its lower reservoir. Meeting reservoir water balance is affected by decisions by both companies which are independently seeking maximal profit. Methods for water use settlement and preventing of spillage are proposed. A mixed-integer linear programming approach is used. Head effects on output power levels are also considered. Existences of dispatches that satisfy both companies are shown.
A new problem called lot sizing with supplier selection problem in the multi-product multi-echelon defective supply chain network (MDSCN) is proposed in this study. We explain the problem by a case study. We take the ...
详细信息
A new problem called lot sizing with supplier selection problem in the multi-product multi-echelon defective supply chain network (MDSCN) is proposed in this study. We explain the problem by a case study. We take the multi-product MDSCN of X enterprise into account. Back and front engine blocks are products of X enterprise. The aim of this study is to identify how many components will be purchased from which supplier while meeting the demands of the customers for these two products. The supply chain (SC) network of X enterprise is formed by mixed-integer linear programming (MILP). The optimization of current SC network of X enterprise is carried out by using linear, INeractive, Discrete Optimizer (LINDO) program. The customer expectations of X enterprise are met at the highest level, and it gives the opportunity to have the knowledge, which reduces the total cost, of purchasing-production-distribution strategy with this work.
This article presents a new model for the short-term scheduling of multistage batch plants with a single unit per stage, mixed storage policies, and multiple shared resources for moving orders between stages. Automate...
详细信息
This article presents a new model for the short-term scheduling of multistage batch plants with a single unit per stage, mixed storage policies, and multiple shared resources for moving orders between stages. Automated wet-etching stations for wafer fabrication in semiconductor plants provide the industrial context. The uncommon feature of the continuous-time model is that it relies on time grids, as well as on global precedence sequencing variables, to find the optimal solution to the problem. Through the solution of a few test cases taken from the literature, we show that new model performs significantly better than a pure sequencing formulation and better than a closely related hybrid model with slightly different sequencing variables. We also propose a new efficient heuristic procedure for extending the range of problems that can effectively be solved, which essentially solves relaxed and constrained versions of the full-space model. (c) 2011 American Institute of Chemical Engineers AIChE J, 2012
A distribution case pack contains an assortment of varying quantities of different stock keeping units (SKUs) packed in a single box or pallet, with a goal of reducing handling requirements in the distribution chain. ...
详细信息
A distribution case pack contains an assortment of varying quantities of different stock keeping units (SKUs) packed in a single box or pallet, with a goal of reducing handling requirements in the distribution chain. This article studies case pack procurement planning problems that address the trade-off between reduced order handling costs and higher inventory-related costs under dynamic, deterministic demand. The properties of optimal solutions for special cases of the problem involving one and two case packs are first established and these properties are used to solve the problem via dynamic programming. For the general model with multiple predefined case packs, which is shown to be strongly NP-hard, the exact approach is generalized to solve the problem in pseudopolynomial time for a fixed number of case packs. In addition, for large-size problems, the problem formulation is strengthed using valid inequalities and a family of heuristic solutions is designed. Computational tests show that these heuristic approaches performvery well compared to the commercial mixed-integerprogramming solver CPLEX. In addition to providing detailed methods for solving problems with deterministic demand, strategies for addressing problems with uncertain demands are discussed.
Mathematical models of complex biological networks are valuable to make predictions on system properties and to identify therapeutic targets. However, development, validation and analysis of predictive models is often...
详细信息
Mathematical models of complex biological networks are valuable to make predictions on system properties and to identify therapeutic targets. However, development, validation and analysis of predictive models is often hampered as absolute and quantitative measurement data are rarely available. Instead, the data are typically uncertain with respect to the measured variable or time, relational due to normalization, or data are given as conditional if-then observations. Many common approaches for model development and validation cannot deal with such semi-quantitative data and qualitative information. We present a framework for the guaranteed invalidation and parameter estimation of dynamical models using such data. For this purpose, the data are formally expressed by sets of equalities and inequalities containing binary variables. Then a mixed-integer nonlinear feasibility problem is constructed, which is subsequently relaxed into a mixed-integerlinear program that can be solved efficiently. A model can be proved inconsistent, that is, invalid with the uncertain and semi-quantitative/qualitative data, if the solution set of the mixed-integerlinear program is empty. To exemplify the approach, we analyze different models whether they can show adaptation to a step-input. First, we invalidate all but one model and, second, derive outer-bounds for those regions in the parameter space of the non-invalidated model that contain parameterizations for which it is consistent with the data. Copyright (c) 2012 John Wiley & Sons, Ltd.
暂无评论