Although several optimization models have been proposed for chemical production scheduling, there is still a need for effective solution methods. Accordingly, the goal of this work is to present different reformulatio...
详细信息
Although several optimization models have been proposed for chemical production scheduling, there is still a need for effective solution methods. Accordingly, the goal of this work is to present different reformulations of representative continuous-time models by introducing an explicit variable for the number of batches of a given task. This idea, which has been successfully applied to discrete-time models, results in significant computational enhancement. We discuss how different objective functions benefit from particular reformulations and show significant improvements by means of an extensive computational study that includes several instances containing different process networks and scheduling horizons.
The climate change emergency calls for a reduction in energy consumption in all human activities and production processes. The radio broadcasting industry is no exception. However, reducing energy requirements by unif...
详细信息
The climate change emergency calls for a reduction in energy consumption in all human activities and production processes. The radio broadcasting industry is no exception. However, reducing energy requirements by uniformly cutting the radiated power at every transmitter can potentially impair the quality of service. A careful evaluation and optimization study are in order. In this paper, by analyzing the Italian frequency modulation analog broadcasting service, we show that it is indeed possible to significantly reduce the energy consumption of the broadcasters without sacrificing the quality of the service, rather, even getting improvements.
Production planning and scheduling in the pulp and paper industry can be very challenging. In most cases, practitioners address the production planning process manually, which is time-consuming and sub-optimal. This s...
详细信息
Production planning and scheduling in the pulp and paper industry can be very challenging. In most cases, practitioners address the production planning process manually, which is time-consuming and sub-optimal. This study deals with production planning encountered in a pulp mill company involving different wood species, parallel heterogeneous lines, inventory limits, sequence-independent setup times and preventive maintenance. To tackle the problem, an efficient mixed-integer formulation is proposed that optimizes when, where and how much to produce of different wood species and schedules preventive maintenance to minimize the total setup times. Several computational experiments are conducted to solve a case study in a pulp mill company in Chile. The results show the capability of the model to support the decision-making process in the pulp and paper industry, providing an efficient tool for practitioners to solve the problem in a reasonable amount of time.
One of the functions that characterize modern management systems of electric power distribution networks is the periodical short-term optimization of the operating conditions. Such a function is typically designated a...
详细信息
One of the functions that characterize modern management systems of electric power distribution networks is the periodical short-term optimization of the operating conditions. Such a function is typically designated as volt/var optimization (VVO). The usual objective is the minimization of network loss or demand. The main constraints are the maximum current values in lines or transformers and a few percentage point deviation of bus voltages from the rated value. WO exploits the availability of two-way communication and the possibility to control transformer load tap changers, switchable capacitor banks, and reactive outputs of specific embedded generators (being active outputs often fixed by market decisions or by energy resource characteristics). The use of mixed integer linear programming (MILP) appears to have been less explored than other approaches for the solution of WO problems. This paper presents a MILP model that includes the approximate representation of the main characteristics and constraints of short-term distribution system operation. The quality of the results obtained for different test feeders in various operating conditions and the corresponding performances of the solver appear promising for online applications. (C) 2013 Elsevier B.V. All rights reserved.
In the operation of heavy-load railways, the setting of temporary windows has a significant impact on the train operation plan. How to effectively adjust the train operation diagram during and after the windows are li...
详细信息
This paper addresses a production planning problem in a multistage production system consisting of continuous processing resources separated by finite-capacity storage tanks, stimulated by a particular case study in t...
详细信息
This paper addresses a production planning problem in a multistage production system consisting of continuous processing resources separated by finite-capacity storage tanks, stimulated by a particular case study in the dairy industry. The problem is formulated as a mixed-integerlinearprogramming (MILP) model that incorporates several distinguishing characteristics of dairy production, such as multistage bulk production, shelf-life requirements, intermediate storage, setups, resource speeds, limitations on minimum and maximum lot sizes, and the conservation of flow among various tanks. The objective is to maximize the total profit while determining the quantity of intermediate products and SKUs processed on various resources, the assignment of products to various resources and intermediate storage tanks, the quantity of each SKU sold, lost sales of each SKU, and waiting times. The determinations often reveal production bottlenecks. The efficiency of the proposed model is illustrated through its application to the milk production plant of a leading dairy company. Special features of the proposed model are highlighted through several examples. The computational performance of the MILP model is examined in several test scenarios.
This paper proposes a method for short term security-constrained unit commitment (SCUC) for hydro and thermal generation units. The SCUC problem is modeled as a multi-objective problem to concurrently minimize the ISO...
详细信息
This paper proposes a method for short term security-constrained unit commitment (SCUC) for hydro and thermal generation units. The SCUC problem is modeled as a multi-objective problem to concurrently minimize the ISO's cost as well as minimizing the emissions caused by thermal units. The non-linearity of valve loading effects is linearized in the presented problem. In order to model the SCUC problem more realistically, this paper considers the dynamic ramp rate of thermal units instead of the fixed rate. Moreover, multi-performance curves pertaining to hydro units are developed and the proposed SCUC problem includes the prohibited operating zones (POZs). Besides, the model of SCUC is transformed into mixed integer linear programming (MILP) instead of using mixedinteger non-linearprogramming (MINLP) which has the capability to be solved efficiently using optimization software even for real size power systems. Pareto optimal solutions are generated by employing lexicographic optimization as well as hybrid augmented-weighted epsilon-constraint technique. Furthermore, a Fuzzy decision maker is utilized in this paper to determine the most preferred solution among Pareto optimal solutions derived through solving the proposed multi-objective SCUC problem. Eventually, the proposed model is implemented on modified IEEE 118-bus system comprising 54 thermal units and 8 hydro units. The simulation results reveal that the solutions obtained from the proposed technique in comparison with other methods established recently are superior in terms of total cost and emission output. (C) 2013 Elsevier Ltd. All rights reserved.
A mixedintegerlinear problem is called symmetric if the variables can be permuted without changing the structure of the problem. Generally, these problems are difficult to solve due to the redundant solutions which ...
详细信息
A mixedintegerlinear problem is called symmetric if the variables can be permuted without changing the structure of the problem. Generally, these problems are difficult to solve due to the redundant solutions which populate the enumeration tree. In Unit Commitment problems the symmetry is present when identical generators have to be scheduled. This article presents a way to reduce the computational burden of the Branch and Cut algorithm by adding appropriate inequalities into the mixed-linear formulation of the Unit Commitment problem. In the examples considered, this approach leads to a substantial reduction in computational effort, without affecting the objective value. (C) 2013 Elsevier Ltd. All rights reserved.
The sizing and placement of the lines between the offshore substation (OS) and the wind turbines (WTs) are optimized using the mixed integer linear programming-based approach to large-scale offshore wind farm collecto...
详细信息
To satisfy component concentration constraints in crude oil operations, it is necessary to blend different oil types, resulting in a mixedinteger nonlinearprogramming (MINLP) formulation for the scheduling problem o...
详细信息
To satisfy component concentration constraints in crude oil operations, it is necessary to blend different oil types, resulting in a mixedinteger nonlinearprogramming (MINLP) formulation for the scheduling problem of crude oil operations. Because of the intractability of such a nonlinear problem, approximate methods were proposed in the literature. However, by the existing methods, a composition concentration dicrepancy may occur, leading to an infeasible solution;or a feasible solution cannot be found even if such a solution exists for some cases. Based on a priority-slot modeling method, this paper copes with the crude-oil scheduling problem suffering from composition concentration discrepancy. To find a solution without composition concentration discrepancy, a valid inequality is added to the MINLP model. Also, the model size is significantly reduced by properly determining the number of slots. Then, a novel solution method is proposed. By this method, the problem is iteratively solved and, at each iteration step, only a reduced MILP problem is solved. Consequently, a solution can be found such that the composition concentration discrepancy is completely eliminated and it is computationally more efficient than the existing ones. Experiments are done to test the performance of the proposed method. Results show that the proposed method outperforms the existing ones.
暂无评论