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.

Using error bounds to compare aggregated generalized transportation models

A comparative study of aggregation error bounds for the generalized transportation problem is presented. A priori and a posteriori error bounds were derived and a computational study was performed to (a) test the correlation between the a priori, the a posteriori, and the actual error and (b) quantify the difference of the error bounds from the actual error. Based on the results we conclude that calculating the a priori error bound can be considered as a useful strategy to select the appropriate aggregation level. The a posteriori error bound provides a good quantitative measure of the actual error.

The benefits of ethanol use for hydrogen production in urban transportation

The purpose of this paper is to describe the benefits of sugar cane ethanol in Brazil, appointing the productivity of this type of fuel based on hectares of plantation, its carbon dioxide cycle and the contribution to reduce the greenhouse effect. In the following step the uses of ethanol for hydrogen production by steam reforming is analyzed and some comparison with natural gas steam reforming is performed. The sugar cane industry in Brazil, in a near future, in the hydrogen era, could be modified according to our purpose, since besides the production of sugar, and ethylic and anhydric alcohol, Brazilian sugar cane industry will also be able to produce biohydrogen.Fuel cells appear like a promising technology for energy generation. Among several technologies in the present, the PEMFC (proton exchange membrane fuel cell) is the most appropriate for vehicles application, because it combines durability, high power density, high efficiency, good response and it works at relatively low temperatures. Besides that it is easy to turn it on and off and it is able to support present vibration in vehicles. A PEMFC's problem is the need of noble catalysts like platinum. Another problem is that CO needs to be in low concentration, requiring a more clean hydrogen to avoid fuel cell deterioration.One part of this paper was developed in Stockholm, where there are some buses within the CUTE (clean urban transport for Europe) project that has been in operation with FC since January 2004. Another part was developed in Guaratingueta, Brazil. Brazil intends to start up a program of FC buses. As conclusion, this paper shows the economical analysis comparing buses moved by fuel cells using hydrogen by different kinds of production. Electrolyze with wind turbine, natural gas steam reforming and ethanol steam reforming. (C) 2009 Elsevier Ltd. All rights reserved.

An approach using Lagrangian/surrogate relaxation for lot-sizing with transportation costs

Neste trabalho estuda-se um problema de dimensionamento de lotes e distribuição que envolve além de custos de estoques, produção e preparação, custos de transportes para o armazém da empresa. Os custos logísticos estão associados aos contêineres necessários para empacotar os produtos produzidos. A empresa negocia um contrato de longo prazo onde um custo fixo por período é associado ao transporte dos itens, em contrapartida um limite de contêineres é disponibilizado com custo mais baixo que o custo padrão. Caso ocorra um aumento ocasional de demanda, novos contêineres podem ser utilizados, no entanto, seu custo é mais elevado. Um modelo matemático foi proposto na literatura e resolvido utilizando uma heurística Lagrangiana. No presente trabalho a resolução do problema por uma heurística Lagrangiana/surrogate é avaliada. Além disso, é considerada uma extensão do modelo da literatura adicionando restrições de capacidade e permitindo atraso no atendimento a demanda. Testes computacionais mostraram que a heurística Lagrangiana/surrogate é competitiva especialmente quando se têm restrições de capacidade apertada.

On an Optimal Linear Control Applied to a Non-Ideal Load Transportation System, Modeled with Periodic Coefficients

In this paper, a load transportation system in platforms or suspended by cables is considered. It is a monorail device and is modelled as an inverted pendulum built on a car driven by a DC motor. The governing equations of motion were derived via Lagrange's equations. In the mathematical model we consider the interaction between the DC motor and the dynamical system, that is, we have a so-called non-ideal periodic problem. The problem is analysed and we also developed an optimal linear control design to stabilize the problem.

Nonlinear Dynamics and Control of an Ideal/Nonideal Load Transportation System With Periodic Coefficients

In this paper, a loads transportation system in platforms or suspended by cables is considered. It is a monorail device and is modeled as an inverted pendulum built on a car driven by a dc motor the governing equations of motion were derived via Lagrange's equations. In the mathematical model we consider the interaction between the dc motor and the dynamical system, that is, we have a so called nonideal periodic problem. The problem is analyzed, qualitatively, through the comparison of the stability diagrams, numerically obtained, for several motor torque constants. Furthermore, we also analyze the problem quantitatively using the Floquet multipliers technique. Finally, we devise a control for the studied nonideal problem. The method that was used for analysis and control of this nonideal periodic system is based on the Chebyshev polynomial exponsion, the Picard iterative method, and the Lyapunov-Floquet transformation (L-F transformation). We call it Sinha's theory.

Branch and bound algorithm for transmission system expansion planning using a transportation model

A method for optimal transmission network expansion planning is presented. The transmission network is modelled as a transportation network. The problem is solved using hierarchical Benders decomposition in which the problem is decomposed into master and slave subproblems. The master subproblem models the investment decisions and is solved using a branch-and-bound algorithm. The slave subproblem models the network operation and is solved using a specialised linear program. Several alternative implementations of the branch-and-bound algorithm have been rested. Special characteristics of the transmission expansion problem have been taken into consideration in these implementations. The methods have been tested on various test systems available in the literature.

Analysis of heuristic algorithms for the transportation model in static and multistage planning in network expansion systems

The usefulness of the application of heuristic algorithms in the transportation model, first proposed by Garver, is analysed in relation to planning for the expansion of transmission systems. The formulation of the mathematical model and the solution techniques proposed in the specialised literature are analysed in detail. Starting with the constructive heuristic algorithm proposed by Garver, an extension is made to the problem of multistage planning for transmission systems. The quality of the solutions found by heuristic algorithms for the transportation model is analysed, as are applications in problems of planning transmission systems.

Domain reduction using GRASP construction phase for transmission expansion planning problem

This paper proposes a new strategy to reduce the combinatorial search space of a mixed integer linear programming (MILP) problem. The construction phase of greedy randomized adaptive search procedure (GRASP-CP) is employed to reduce the domain of the integer variables of the transportation model of the transmission expansion planning (TM-TEP) problem. This problem is a MILP and very difficult to solve specially for large scale systems. The branch and bound (BB) algorithm is used to solve the problem in both full and the reduced search space. The proposed method might be useful to reduce the search space of those kinds of MILP problems that a fast heuristic algorithm is available for finding local optimal solutions. The obtained results using some real test systems show the efficiency of the proposed method. © 2012 Springer-Verlag.