Day-ahead resource scheduling in smart grids considering Vehicle-to-Grid and network constraints

Energy resource scheduling becomes increasingly important, as the use of distributed resources is intensified and massive gridable vehicle use is envisaged. The present paper proposes a methodology for dayahead energy resource scheduling for smart grids considering the intensive use of distributed generation and of gridable vehicles, usually referred as Vehicle- o-Grid (V2G). This method considers that the energy resources are managed by a Virtual Power Player (VPP) which established contracts with V2G owners. It takes into account these contracts, the user´s requirements subjected to the VPP, and several discharge price steps. Full AC power flow calculation included in the model allows taking into account network constraints. The influence of the successive day requirements on the day-ahead optimal solution is discussed and considered in the proposed model. A case study with a 33 bus distribution network and V2G is used to illustrate the good performance of the proposed method.

Inexact restoration approaches to solve mathematical program with complementarity constraints

Mathematical Program with Complementarity Constraints (MPCC) finds applica- tion in many fields. As the complementarity constraints fail the standard Linear In- dependence Constraint Qualification (LICQ) or the Mangasarian-Fromovitz constraint qualification (MFCQ), at any feasible point, the nonlinear programming theory may not be directly applied to MPCC. However, the MPCC can be reformulated as NLP problem and solved by nonlinear programming techniques. One of them, the Inexact Restoration (IR) approach, performs two independent phases in each iteration - the feasibility and the optimality phases. This work presents two versions of an IR algorithm to solve MPCC. In the feasibility phase two strategies were implemented, depending on the constraints features. One gives more importance to the complementarity constraints, while the other considers the priority of equality and inequality constraints neglecting the complementarity ones. The optimality phase uses the same approach for both algorithm versions. The algorithms were implemented in MATLAB and the test problems are from MACMPEC collection.

Numerical experiments with a modified regularization scheme for mathematical programs with complementarity constraints

On this paper we present a modified regularization scheme for Mathematical Programs with Complementarity Constraints. In the regularized formulations the complementarity condition is replaced by a constraint involving a positive parameter that can be decreased to zero. In our approach both the complementarity condition and the nonnegativity constraints are relaxed. An iterative algorithm is implemented in MATLAB language and a set of AMPL problems from MacMPEC database were tested.

Scheduling sporadic tasks on multiprocessors with mutual exclusion constraints

Consider the problem of scheduling sporadic tasks on a multiprocessor platform under mutual exclusion constraints. We present an approach which appears promising for allowing large amounts of parallel task executions and still ensures low amounts of blocking.

Shared resources and precedence constraints with capacity sharing and stealing

This paper proposes a new strategy to integrate shared resources and precedence constraints among real-time tasks, assuming no precise information on critical sections and computation times is available. The concept of bandwidth inheritance is combined with a greedy capacity sharing and stealing policy to efficiently exchange bandwidth among tasks, minimising the degree of deviation from the ideal system's behaviour caused by inter-application blocking. The proposed capacity exchange protocol (CXP) focus on exchanging extra capacities as early, and not necessarily as fairly, as possible. This loss of optimality is worth the reduced complexity as the protocol's behaviour nevertheless tends to be fair in the long run and outperforms other solutions in highly dynamic scenarios, as demonstrated by extensive simulations.

Tornar-se adulto na Casa 5: promover a autonomia individual em Apartamento de Autonomização

Na ausência de uma retaguarda familiar capaz de se constituir como uma rede de segurança e apoio ao desenvolvimento integral de adolescentes com medida de promoção e proteção, o Apartamento de Autonomização oferece um espaço no qual os jovens podem treinar competências que lhes assegurem um futuro autónomo e minimizem os riscos de exclusão social. Esta resposta social propõe-se preparar adolescentes, em transição para a adultez juvenil, para a conquista da responsabilidade de se autoprotegerem, de cuidarem de si próprios e de assumirem a sua identidade perante os outros. Todavia, um projeto de Autonomização de Vida revela-se um desafio, não apenas para os jovens, como também para as famílias e para os profissionais que com eles trabalham. Foram, precisamente, as dificuldades inerentes à Autonomização de Vida em contexto institucional que motivaram o desenvolvimento de um projeto em educação e intervenção social promotor da eficiência dessa resposta social em termos de promoção da autonomia e da transição bem-sucedida para a vida adulta. O presente relatório constitui, assim, um olhar retrospetivo sobre o Projeto “Tornar-se Adulto na Casa 5”, o qual, através da metodologia de Investigação-Ação Participativa, visou alcançar a finalidade proposta pelos participantes: “Promover uma autonomia plena dos jovens da Casa 5, com vista à transição bem-sucedida para a vida adulta após o término da medida de promoção e proteção”. Ainda que os resultados obtidos tenham sido moderadamente satisfatórios, o Projeto terá contribuído para o desenvolvimento de uma consciencialização mais crítica acerca das oportunidades e dos constrangimentos ao desenvolvimento da Autonomia, favorecendo, desejavelmente, a transição para vida adulta após a desinstitucionalização.