Aggregation in the generalized transportation problem

Aggregation disaggregation is used to reduce the analysis of a large generalized transportation problem to a smaller one. Bounds for the actual difference between the aggregated objective and the original optimal value are used to quantify the error due to aggregation and estimate the quality of the aggregation. The bounds can be calculated either before optimization of the aggregated problem (a priori) or after (a posteriori). Both types of the bounds are derived and numerically compared. A computational experiment was designed to (a) study the correlation between the bounds and the actual error and (b) quantify the difference of the error bounds from the actual error. The experiment shows a significant correlation between some a priori bounds, the a posteriori bounds and the actual error. These preliminary results indicate that calculating the a priori error bound is a useful strategy to select the appropriate aggregation level, since the a priori bound varies in the same way that the actual error does. After the aggregated problem has been selected and optimized, the a posteriori bound provides a good quantitative measure for the error due to aggregation.

Logarithmic barrier-augmented Lagrangian function to the optimal power flow problem

This paper presents a new approach to solve the Optimal Power Flow problem. This approach considers the application of logarithmic barrier method to voltage magnitude and tap-changing transformer variables and the other constraints are treated by augmented Lagrangian method. Numerical test results are presented, showing the effective performance of this algorithm. (C) 2005 Elsevier Ltd. All rights reserved.

Comparative studies on non-convex optimization methods for transmission network expansion planning

We have investigated and extensively tested three families of non-convex optimization approaches for solving the transmission network expansion planning problem: simulated annealing (SA), genetic algorithms (GA), and tabu search algorithms (TS). The paper compares the main features of the three approaches and presents an integrated view of these methodologies. A hybrid approach is then proposed which presents performances which are far better than the ones obtained with any of these approaches individually. Results obtained in tests performed with large scale real-life networks are summarized.

Multivariate analysis of photo-Fenton degradation of the herbicides tebuthiuron, diuron and 2,4-D

The degradation of herbicides in aqueous solution by photo-Fenton process using ferrioxalate complex (FeOx) as source of Fe2+ was evaluated under blacklight irradiation. The commercial products of the herbicides tebuthiuron, diuron and 2,4-D were used. The multivariate analysis, more precisely, the response surface methodology was applied to evaluate the role of FeOx and hydrogen peroxide concentrations as variables in the degradation process, and in particular, to define the concentration ranges that result in the most efficient degradation of the herbicides. The degradation process was evaluated by the determination of the remaining total organic carbon content (TOC), by monitoring the decrease of the concentrations of the original compounds using HPLC and by the chloride ion release in the case of diuron and 2,4-D. Under optimized conditions, 20min were sufficient to mineralize 93% of TOC from 2,4-D and 90% of diuron, including oxalate. Complete dechlorination of these compounds was achieved after 10 min reaction. It was found that the most recalcitrant herbicide is tebuthiuron, while diuron shows the highest degradability. However, under optimized conditions the initial concentration of tebuthiuron was reduced to less than 15%, while diuron and 2,4-D were reduced to around 2% after only 1 min reaction. Furthermore, it was observed that the ferrioxalate complex plays a more important role than H2O2 in the photodegradation of these herbicides in the ranges of concentrations investigated. (C) 2004 Elsevier Ltd. All rights reserved.

A new approach to the solution of the optimal power flow problem based on the modified Newton's method associated to an augmented Lagrangian function

This paper presents a new algorithm for optimal power flow problem. The algorithm is based on Newton's method which it works with an Augmented Lagrangian function associated with the original problem. The function aggregates all the equality and inequality constraints and is solved using the modified-Newton method. The test results have shown the effectiveness of the approach using the IEEE 30 and 638 bus systems.

Neural approach for solving several types of optimization problems

Neural networks consist of highly interconnected and parallel nonlinear processing elements that are shown to be extremely effective in computation. This paper presents an architecture of recurrent neural net-works that can be used to solve several classes of optimization problems. More specifically, a modified Hopfield network is developed and its inter-nal parameters are computed explicitly using the valid-subspace technique. These parameters guarantee the convergence of the network to the equilibrium points, which represent a solution of the problem considered. The problems that can be treated by the proposed approach include combinatorial optimiza-tion problems, dynamic programming problems, and nonlinear optimization problems.

A linear optimization approach to the combined production planning model

Two fundamental processes usually arise in the production planning of many industries. The first one consists of deciding how many final products of each type have to be produced in each period of a planning horizon, the well-known lot sizing problem. The other process consists of cutting raw materials in stock in order to produce smaller parts used in the assembly of final products, the well-studied cutting stock problem. In this paper the decision variables of these two problems are dependent of each other in order to obtain a global optimum solution. Setups that are typically present in lot sizing problems are relaxed together with integer frequencies of cutting patterns in the cutting problem. Therefore, a large scale linear optimizations problem arises, which is exactly solved by a column generated technique. It is worth noting that this new combined problem still takes the trade-off between storage costs (for final products and the parts) and trim losses (in the cutting process). We present some sets of computational tests, analyzed over three different scenarios. These results show that, by combining the problems and using an exact method, it is possible to obtain significant gains when compared to the usual industrial practice, which solve them in sequence. (C) 2010 The Franklin Institute. Published by Elsevier Ltd. All rights reserved.

An evolutionary algorithm for the one-dimensional cutting stock problem

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Analytical optimization of spread and change of exponential decay of generalized Wannier functions in one dimension

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Cogeneration system design optimization

Cogeneration system design deals with several parameters in the synthesis phase, where not only a thermal cycle must be indicated but the general arrangement, type, capacity and number of machines need to be defined. This problem is not trivial because many parameters are considered as goals in the project. An optimization technique that considers costs and revenues, reliability, pollutant emissions and exergetic efficiency as goals to be reached in the synthesis phase of a cogeneration system design process is presented. A discussion of appropriated values and the results for a pulp and paper plant integration to a cogeneration system are shown in order to illustrate the proposed methodology.

Cogeneration system design optimization

Cogeneration system design deals with several parameters in the synthesis phase, where not only a thermal cycle must be indicated but the general arrangement, type, capacity and number of machines need to be defined. This problem is not trivial because many parameters are considered as goals in the project. An optimization technique that considers costs and revenues, reliability, pollutant emissions and exergetic efficiency as goals to be reached in the synthesis phase of a cogeneration system design process is presented. A discussion of appropriated values and the results for a pulp and paper plant integration to a cogeneration system are shown in order to illustrate the proposed methodology.

Comparative studies on non-convex optimization methods for transmission network expansion planning

We have investigated and extensively tested three families of non-convex optimization approaches for solving the transmission network expansion planning problem: simulated annealing (SA), genetic algorithms (GA), and tabu search algorithms (TS). The paper compares the main features of the three approaches and presents an integrated view of these methodologies. A hybrid approach is then proposed which presents performances which are far better than the ones obtained with any of these approaches individually. Results obtained in tests performed with large scale real-life networks are summarized.

A new solution to the optimal power flow problem

A new approach to solving the Optimal Power Flow problem is described, making use of some recent findings, especially in the area of primal-dual methods for complex programming. In this approach, equality constraints are handled by Newton's method inequality constraints for voltage and transformer taps by the logarithmic barrier method and the other inequality constraints by the augmented Lagrangian method. Numerical test results are presented, showing the effective performance of this algorithm. © 2001 IEEE.

On the resolution of the generalized nonlinear complementarity problem

Minimization of a differentiable function subject to box constraints is proposed as a strategy to solve the generalized nonlinear complementarity problem (GNCP) defined on a polyhedral cone. It is not necessary to calculate projections that complicate and sometimes even disable the implementation of algorithms for solving these kinds of problems. Theoretical results that relate stationary points of the function that is minimized to the solutions of the GNCP are presented. Perturbations of the GNCP are also considered, and results are obtained related to the resolution of GNCPs with very general assumptions on the data. These theoretical results show that local methods for box-constrained optimization applied to the associated problem are efficient tools for solving the GNCP. Numerical experiments are presented that encourage the use of this approach.

Tuning of fuzzy inference systems through unconstrained optimization techniques

This paper presents a new methodology for the adjustment of fuzzy inference systems. A novel approach, which uses unconstrained optimization techniques, is developed in order to adjust the free parameters of the fuzzy inference system, such as its intrinsic parameters of the membership function and the weights of the inference rules. This methodology is interesting, not only for the results presented and obtained through computer simulations, but also for its generality concerning to the kind of fuzzy inference system used. Therefore, this methodology is expandable either to the Mandani architecture or also to that suggested by Takagi-Sugeno. The validation of the presented methodology is accomplished through an estimation of time series. More specifically, the Mackey-Glass chaotic time series estimation is used for the validation of the proposed methodology.