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.

A mass-transportation approach to a one dimensional fluid mechanics model with nonlocal velocity

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

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.

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.