The Optimal trigger speed of vehicle activated signs

The thesis aims to elaborate on the optimum trigger speed for Vehicle Activated Signs (VAS) and to study the effectiveness of VAS trigger speed on drivers’ behaviour. Vehicle activated signs (VAS) are speed warning signs that are activated by individual vehicle when the driver exceeds a speed threshold. The threshold, which triggers the VAS, is commonly based on a driver speed, and accordingly, is called a trigger speed. At present, the trigger speed activating the VAS is usually set to a constant value and does not consider the fact that an optimal trigger speed might exist. The optimal trigger speed significantly impacts driver behaviour. In order to be able to fulfil the aims of this thesis, systematic vehicle speed data were collected from field experiments that utilized Doppler radar. Further calibration methods for the radar used in the experiment have been developed and evaluated to provide accurate data for the experiment. The calibration method was bidirectional; consisting of data cleaning and data reconstruction. The data cleaning calibration had a superior performance than the calibration based on the reconstructed data. To study the effectiveness of trigger speed on driver behaviour, the collected data were analysed by both descriptive and inferential statistics. Both descriptive and inferential statistics showed that the change in trigger speed had an effect on vehicle mean speed and on vehicle standard deviation of the mean speed. When the trigger speed was set near the speed limit, the standard deviation was high. Therefore, the choice of trigger speed cannot be based solely on the speed limit at the proposed VAS location. The optimal trigger speeds for VAS were not considered in previous studies. As well, the relationship between the trigger value and its consequences under different conditions were not clearly stated. The finding from this thesis is that the optimal trigger speed should be primarily based on lowering the standard deviation rather than lowering the mean speed of vehicles. Furthermore, the optimal trigger speed should be set near the 85th percentile speed, with the goal of lowering the standard deviation.

Photovoltaic System Design for a Contaminated Area in Falun – Comparison of South and East- West Layout

In this thesis the solar part of a large grid-connected photovoltaic system design has been done. The main purpose was to size and optimize the system and to present figures helping to evaluate the prospective project rationality, which can potentially be constructed on a contaminated area in Falun. The methodology consisted in PV market study and component selection, site analysis and defining suitable area for solar installation; and system configuration optimization based on PVsyst simulations and Levelized Cost of Energy calculations. The procedure was mainly divided on two parts, preliminary and detailed sizing. In the first part the objective was complex, which included the investigation of the most profitable component combination and system optimization due to tilt and row distance. It was done by simulating systems with different components and orientations, which were sized for the same 100kW inverter in order to make a fair comparison. For each simulated result a simplified LCOE calculation procedure was applied. The main results of this part show that with the price of 0.43 €/Wp thin-film modules were the most cost effective solution for the case with a great advantage over crystalline type in terms of financial attractiveness. From the results of the preliminary study it was possible to select the optimal system configuration, which was used in the detailed sizing as a starting point. In this part the PVsyst simulations were run, which included full scale system design considering near shadings created by factory buildings. Additionally, more complex procedure of LCOE calculation has been used here considered insurances, maintenance, time value of money and possible cost reduction due to the system size. Two system options were proposed in final results; both cover the same area of 66000 m2. The first one represents an ordinary South faced design with 1.1 MW nominal power, which was optimized for the highest performance. According to PVsyst simulations, this system should produce 1108 MWh/year with the initial investment of 835,000 € and 0.056 €/kWh LCOE. The second option has an alternative East-West orientation, which allows to cover 80% of occupied ground and consequently have 6.6 MW PV nominal power. The system produces 5388 MWh/year costs about 4500,000 € and delivers electricity with the same price of 0.056 €/kWh. Even though the EW solution has 20% lower specific energy production, it benefits mainly from lower relative costs for inverters, mounting and annual maintenance expenses. After analyzing the performance results, among the two alternatives none of the systems showed a clear superiority so there was no optimal system proposed. Both, South and East-West solutions have own advantages and disadvantages in terms of energy production profile, configuration, installation and maintenance. Furthermore, the uncertainty due to cost figures assumptions restricted the results veracity.

How does the use of different road networks effect the optimal location of facilities in rural areas?

The p-median problem is often used to locate P service facilities in a geographically distributed population. Important for the performance of such a model is the distance measure. Distance measure can vary if the accuracy of the road network varies. The rst aim in this study is to analyze how the optimal location solutions vary, using the p-median model, when the road network is alternated. It is hard to nd an exact optimal solution for p-median problems. Therefore, in this study two heuristic solutions are applied, simulating annealing and a classic heuristic. The secondary aim is to compare the optimal location solutions using dierent algorithms for large p-median problem. The investigation is conducted by the means of a case study in a rural region with an asymmetrically distributed population, Dalecarlia. The study shows that the use of more accurate road networks gives better solutions for optimal location, regardless what algorithm that is used and regardless how many service facilities that is optimized for. It is also shown that the simulated annealing algorithm not just is much faster than the classic heuristic used here, but also in most cases gives better location solutions.

A modified Primal-Dual Logarithmic-Barrier Method for solving the Optimal Power Flow problem with discrete and continuous control variables

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

Security constrained optimal active power flow via network model and interior point method

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

Efficient heuristic algorithm used for optimal capacitor placement in distribution systems

An efficient heuristic algorithm is presented in this work in order to solve the optimal capacitor placement problem in radial distribution systems. The proposal uses the solution from the mathematical model after relaxing the integrality of the discrete variables as a strategy to identify the most attractive bus to add capacitors to each step of the heuristic algorithm. The relaxed mathematical model is a nonlinear programming problem and is solved using a specialized interior point method, The algorithm still incorporates an additional strategy of local search that enables the finding of a group of quality solutions after small alterations in the optimization strategy. Proposed solution methodology has been implemented and tested in known electric systems getting a satisfactory outcome compared with metaheuristic methods.The tests carried out in electric systems known in specialized literature reveal the satisfactory outcome of the proposed algorithm compared with metaheuristic methods. (C) 2009 Elsevier Ltd. All rights reserved.

A note about the appearance of non-hyperbolic solutions in a mechanical pendulum system

The investigation of the behavior of a nonlinear system consists in the analysis of different stages of its motion, where the complexity varies with the proximity of a resonance region. Near this region the stability domain of the system undergoes sudden changes due basically to competition and interaction between periodic and saddle solutions inside the phase portrait, leading to the occurrence of the most different phenomena. Depending of the domain of the chosen control parameter, these events can reveal interesting geometric features of the system so that the phase portrait is not capable to express all them, since the projection of these solutions on the two-dimensional surface can hide some aspects of these events. In this work we will investigate the numerical solutions of a particular pendulum system close to a secondary resonance region, where we vary the control parameter in a restrict domain in order to draw a preliminary identification about what happens with this system. This domain includes the appearance of non-hyperbolic solutions where the basin of attraction in the center of the phase portrait diminishes considerably, almost disappearing, and afterwards its size increases with the direction of motion inverted. This phenomenon delimits a boundary between low and high frequency of the external excitation.

Chaos control of a nonlinear oscillator with shape memory alloy using an optimal linear control: Part II: Nonideal energy source

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

An improved tabu-based vector optimal algorithm for design optimizations of electromagnetic devices

This paper introduces an improved tabu-based vector optimal algorithm for multiobjective optimal designs of electromagnetic devices. The improvements include a division of the entire search process, a new method for fitness assignment, a novel scheme for the generation and selection of neighborhood solutions, and so forth. Numerical results on a mathematical function and an engineering multiobjective design problem demonstrate that the proposed method can produce virtually the exact Pareto front, in both parameter and objective spaces, even though the iteration number used by it is only about 70% of that required by its ancestor.

On the value function for nonautonomous optimal control problems with infinite horizon

In this paper we consider nonautonomous optimal control problems of infinite horizon type, whose control actions are given by L-1-functions. We verify that the value function is locally Lipschitz. The equivalence between dynamic programming inequalities and Hamilton-Jacobi-Bellman (HJB) inequalities for proximal sub (super) gradients is proven. Using this result we show that the value function is a Dini solution of the HJB equation. We obtain a verification result for the class of Dini sub-solutions of the HJB equation and also prove a minimax property of the value function with respect to the sets of Dini semi-solutions of the HJB equation. We introduce the concept of viscosity solutions of the HJB equation in infinite horizon and prove the equivalence between this and the concept of Dini solutions. In the Appendix we provide an existence theorem. (c) 2006 Elsevier B.V. All rights reserved.

Optimal capacitor placement in radial distribution networks

The capacitor placement (replacement) problem for radial distribution networks determines capacitor types, sizes, locations and control schemes. Optimal capacitor placement is a hard combinatorial problem that can be formulated as a mixed integer nonlinear program. Since this is a NP complete problem (Non Polynomial time) the solution approach uses a combinatorial search algorithm. The paper proposes a hybrid method drawn upon the Tabu Search approach, extended with features taken from other combinatorial approaches such as genetic algorithms and simulated annealing, and from practical heuristic approaches. The proposed method has been tested in a range of networks available in the literature with superior results regarding both quality and cost of solutions.

TIME-OPTIMAL GEOMAGNETIC ATTITUDE MANEUVERS OF AN AXISYMMETRICAL SPINNING SATELLITE

A formulation used to determine the time-optimal geomagnetic attitude maneuvers subject to dynamic and geometric constraints is proposed in this paper. This was obtained by a direct search procedure based on a control function parametrization method, using linear programming to obtain numerical suboptimal solutions by linear perturbation. Due to its characteristics it can be used in small computers and to generate computer programs of general application. The dynamic modeling, the magnetic torque model and the suboptimal control procedure are presented. Simulation runs have verified the feasibility of the formulation thus derived and have shown a notable improvement in performance.

Multi-areas optimal reactive power flow

This paper describes a method for the decentralized solution of the optimal reactive power flow (ORPF) problem in interconnected power systems. The ORPF model is solved in a decentralized framework, consisting of regions, where the transmission system operator in each area operates its system independently of the other areas, obtaining an optimal coordinated but decentralized solution. The proposed scheme is based on an augmented Lagrangian approach using the auxiliary problem principle (APP). An implementation of an interior point method is described to solve the decoupled problem in each area. The described method is successfully implemented and tested using the IEEE two area RTS 96 test system. Numerical results comparing the solutions obtained by the traditional and the proposed decentralized methods are presented for validation. ©2008 IEEE.

Multiarea optimal power flow using multiobjective evolutionary algorithm

In this work the multiarea optimal power flow (OPF) problem is decoupled into areas creating a set of regional OPF subproblems. The objective is to solve the optimal dispatch of active and reactive power for a determined area, without interfering in the neighboring areas. The regional OPF subproblems are modeled as a large-scale nonlinear constrained optimization problem, with both continuous and discrete variables. Constraints violated are handled as objective functions of the problem. In this way the original problem is converted to a multiobjective optimization problem, and a specifically-designed multiobjective evolutionary algorithm is proposed for solving the regional OPF subproblems. The proposed approach has been examined and tested on the RTS-96 and IEEE 354-bus test systems. Good quality suboptimal solutions were obtained, proving the effectiveness and robustness of the proposed approach. ©2009 IEEE.

Optimal contract pricing of distributed generation under a competitive framework

A bilevel programming approach for the optimal contract pricing of distributed generation (DG) in distribution networks is presented. The outer optimization problem corresponds to the owner of the DG who must decide the contract price that would maximize his profits. The inner optimization problem corresponds to the distribution company (DisCo), which procures the minimization of the payments incurred in attending the expected demand while satisfying network constraints. The meet the expected demand the DisCo can purchase energy either form the transmission network through the substations or form the DG units within its network. The inner optimization problem is substituted by its Karush- Kuhn-Tucker optimality conditions, turning the bilevel programming problem into an equivalent single-level nonlinear programming problem which is solved using commercially available software. © 2010 IEEE.