Optimal location of gas supply units in natural gas system network

Natural gas industry has been confronted with big challenges: great growth in demand, investments on new GSUs – gas supply units, and efficient technical system management. The right number of GSUs, their best location on networks and the optimal allocation to loads is a decision problem that can be formulated as a combinatorial programming problem, with the objective of minimizing system expenses. Our emphasis is on the formulation, interpretation and development of a solution algorithm that will analyze the trade-off between infrastructure investment expenditure and operating system costs. The location model was applied to a 12 node natural gas network, and its effectiveness was tested in five different operating scenarios.

Reconfiguração das colunas de separação de xilenos

Mestrado em Engenharia Química. Ramo optimização energética na indústria química

Produção de hidrogénio por fotoeletrólise da água – aproveitamento do subproduto oxigénio

A noção de Economia relativa ao Hidrogénio no vocabulário dos líderes políticos e empresariais tem vindo a mudar sobretudo pela preocupação da poluição global, segurança energética e mudanças climáticas, para além do crescente domínio técnico dos cientistas e engenheiros. O interesse neste composto, que é o elemento mais simples e abundante no universo, está a crescer, devido aos avanços tecnológicos das células de combustível – as potenciais sucessoras das baterias dos aparelhos portáteis eletrónicos, centrais elétricas e motores de combustão interna. Existem métodos já bem desenvolvidos para produzir o hidrogénio. Contudo, destacase a eletrólise da água, não só por ser um método simples mas porque pode utilizar recursos energéticos renováveis, tais como, o vento ou os painéis fotovoltaicos, e aumentar a sua eficiência. Os desafios para melhorar a utilização deste método consistem em reduzir o consumo, a manutenção e os custos energéticos e aumentar a confiança, a durabilidade e a segurança. Mais ainda, consistem em rentabilizar o subproduto oxigénio pois é um gás industrial e medicinal muito importante. Neste trabalho, estudou-se a viabilidade económica da instalação de uma unidade de produção de hidrogénio e oxigénio puros por eletrólise da água, utilizando como fonte energética a energia solar, na empresa Gasoxmed – Gases Medicinais S.A., pretendendo num futuro próximo, comercializar o hidrogénio como fonte de energia, e por outro lado, aproveitar o subproduto oxigénio para utilização industrial. Projetou-se assim uma unidade utilizando um eletrolisador da marca Proton, modelo C30, com capacidade de produção gasosa de 3 kg/h (30 m3/h) de hidrogénio e 20 kg/h (15 m3/h) de oxigénio. Os gases produzidos são comprimidos num compressor da marca RIX a 200 bares para posterior armazenamento em cilindros pressurizados. Dimensionou-se ainda um sistema de miniprodução fotovoltaico com potência 250 kW para alimentar eletricamente a instalação. A realização do projeto na nova área de produção necessitará de 1.713.963€, os quais serão adquiridos por empréstimo bancário. Definiram-se todos os custos fixos associados ao projeto que perfazem um total de 62.554€/mês para os primeiros 5 anos (duração do crédito bancário) findo o qual diminuirão para 21.204€/mês. Da comercialização do hidrogénio, do oxigénio industrial e da eletricidade produzida no sistema de miniprodução de 250 kW, prevê-se um lucro mensal de 117.925€, perfazendo assim um total líquido mensal positivo de 55.371€ durante os primeiros 5 anos e a partir daí de 96.721€/mês, resultando uma amortização do investimento inicial no final do 3º ano.

Análise de Soluções Construtivas no Âmbito do seu Desempenho Térmico

No presente relatório de estágio académico é mencionado o trabalho desenvolvido na empresa Civigest – Gestão de Projetos, Lda. por um período de seis meses, entre Dezembro de 2012 e Junho de 2013. O relatório que se apresenta é, antes de mais, o reflexo do produtivo período passado na empresa, na qual se executou diversificadas tarefas, atribuindo-se maior ênfase ao estudo e elaboração de projetos e fiscalização de empreitadas em todas as suas componentes. Procura-se pois abordar áreas de conhecimento que têm relacionamento direto com os projetos de engenharia civil. No âmbito do planeamento em empresas de projeto de engenharia, as previsões assumem-se como uma ferramenta incontornável para o cumprimento dos objetivos. A calendarização dos projetos e o esforço dos técnicos para o seu cumprimento são fundamentais, visto que as despesas fixas desta atividade prendem-se sobretudo com o custo de mão-de-obra. Incontornavelmente ligado ao departamento de estudos e projetos encontra-se o departamento de orçamentação, auxiliando os técnicos projetistas a optar por soluções que não comprometam os valores alvo da empreitada. O relatório de estágio descreve as atividades desenvolvidas nos vários departamentos da organização, com destaque para o departamento de fiscalização de empreitadas, que tem como principais objetivos a coordenação e gestão de obras envolvendo a elaboração e aprovação de autos de medição e autos de pagamento, a verificação do estrito cumprimento dos projetos, a promoção de alterações de melhoria de projeto, a verificação das especificações técnicas dos materiais e sua correta aplicação, bem como promover um bom relacionamento e diálogo entre as partes interessadas da empreitada. A passagem pelo departamento de fiscalização de empreitadas é fulcral para uma melhor perceção das dificuldades encontradas em obra. Por outro lado, o relatório aborda outra atividade relativa à análise de soluções construtivas, visando o desempenho térmico dos edifícios. Este é o conceito do relatório de estágio onde serão apresentados alguns casos de obras iniciadas na Civigest e posteriormente acompanhadas em obra. Relativamente a este ponto serão analisadas soluções de melhoria térmica. Com menor ênfase no trabalho, mas não menos importante, referir-se-á a profissão de coordenação de segurança em obra.

An efficient method for optimal location and sizing of fixed and switched shunt capacitors in large distribution systems

This paper proposes a computationally efficient methodology for the optimal location and sizing of static and switched shunt capacitors in large distribution systems. The problem is formulated as the maximization of the savings produced by the reduction in energy losses and the avoided costs due to investment deferral in the expansion of the network. The proposed method selects the nodes to be compensated, as well as the optimal capacitor ratings and their operational characteristics, i.e. fixed or switched. After an appropriate linearization, the optimization problem was formulated as a large-scale mixed-integer linear problem, suitable for being solved by means of a widespread commercial package. Results of the proposed optimizing method are compared with another recent methodology reported in the literature using two test cases: a 15-bus and a 33-bus distribution network. For the both cases tested, the proposed methodology delivers better solutions indicated by higher loss savings, which are achieved with lower amounts of capacitive compensation. The proposed method has also been applied for compensating to an actual large distribution network served by AES-Venezuela in the metropolitan area of Caracas. A convergence time of about 4 seconds after 22298 iterations demonstrates the ability of the proposed methodology for efficiently handling large-scale compensation problems.

Transmission costs allocation based on optimal re-dispatch

Congestion management of transmission power systems has achieve high relevance in competitive environments, which require an adequate approach both in technical and economic terms. This paper proposes a new methodology for congestion management and transmission tariff determination in deregulated electricity markets. The congestion management methodology is based on a reformulated optimal power flow, whose main goal is to obtain a feasible solution for the re-dispatch minimizing the changes in the transactions resulting from market operation. The proposed transmission tariffs consider the physical impact caused by each market agents in the transmission network. The final tariff considers existing system costs and also costs due to the initial congestion situation and losses. This paper includes a case study for the 118 bus IEEE test case.

Evaluating P-NET message's response time with fixed priority queuing at application process level

P-NET is a multi-master fieldbus standard based on a virtual token passing scheme. In P-NET each master is allowed to transmit only one message per token visit. In the worst-case, the communication response time can be derived considering that, in each token cycle, all stations use the token to transmit a message. In this paper, we define a more sophisticated P-NET model, which considers the actual token utilisation. We then analyse the possibility of implementing a local priority-based scheduling policy to improve the real-time behaviour of P-NET.

Adding local priority-based dispatching mechanisms to P-NET networks: a fixed priority approach

In this paper we address the real-time capabilities of P-NET, which is a multi-master fieldbus standard based on a virtual token passing scheme. We show how P-NET’s medium access control (MAC) protocol is able to guarantee a bounded access time to message requests. We then propose a model for implementing fixed prioritybased dispatching mechanisms at each master’s application level. In this way, we diminish the impact of the first-come-first-served (FCFS) policy that P-NET uses at the data link layer. The proposed model rises several issues well known within the real-time systems community: message release jitter; pre-run-time schedulability analysis in non pre-emptive contexts; non-independence of tasks at the application level. We identify these issues in the proposed model and show how results available for priority-based task dispatching can be adapted to encompass priority-based message dispatching in P-NET networks.

Extending fixed task-priority schedulability by interference limitation

While the earliest deadline first algorithm is known to be optimal as a uniprocessor scheduling policy, the implementation comes at a cost in terms of complexity. Fixed taskpriority algorithms on the other hand have lower complexity but higher likelihood of task sets being declared unschedulable, when compared to earliest deadline first (EDF). Various attempts have been undertaken to increase the chances of proving a task set schedulable with similar low complexity. In some cases, this was achieved by modifying applications to limit preemptions, at the cost of flexibility. In this work, we explore several variants of a concept to limit interference by locking down the ready queue at certain instances. The aim is to increase the prospects of schedulability of a given task system, without compromising on complexity or flexibility, when compared to the regular fixed task-priority algorithm. As a final contribution, a new preemption threshold assignment algorithm is provided which is less complex and more straightforward than the previous method available in the literature.

Resource sharing in global fixed-priority preemptive multiprocessor scheduling

In this paper we consider global fixed-priority preemptive multiprocessor scheduling of constrained-deadline sporadic tasks that share resources in a non-nested manner. We develop a novel resource-sharing protocol and a corresponding schedulability test for this system. We also develop the first schedulability analysis of priority inheritance protocol for the aforementioned system. Finally, we show that these protocols are efficient (based on the developed schedulability tests) for a class of priority-assignments called reasonable priority-assignments.

Conjecture about global fixed-priority preemptive multiprocessor scheduling of implicit-deadline sporadic tasks: the utilization bound of SM-US(sqrt(2)-1) is sqrt(2)-1

Consider global fixed-priority preemptive multiprocessor scheduling of implicit-deadline sporadic tasks. I conjecture that the utilization bound of SM-US(√2−1) is √2-1.

A framework for the response time analysis of fixed-priority tasks with stochastic inter-arrival times

Real-time scheduling usually considers worst-case values for the parameters of task (or message stream) sets, in order to provide safe schedulability tests for hard real-time systems. However, worst-case conditions introduce a level of pessimism that is often inadequate for a certain class of (soft) real-time systems. In this paper we provide an approach for computing the stochastic response time of tasks where tasks have inter-arrival times described by discrete probabilistic distribution functions, instead of minimum inter-arrival (MIT) values.

Fixed point transformations in the adaptive control of fractional-order MIMO systems

Though the formal mathematical idea of introducing noninteger order derivatives can be traced from the 17th century in a letter by L’Hospital in which he asked Leibniz what the meaning of D n y if n = 1/2 would be in 1695 [1], it was better outlined only in the 19th century [2, 3, 4]. Due to the lack of clear physical interpretation their first applications in physics appeared only later, in the 20th century, in connection with visco-elastic phenomena [5, 6]. The topic later obtained quite general attention [7, 8, 9], and also found new applications in material science [10], analysis of earth-quake signals [11], control of robots [12], and in the description of diffusion [13], etc.

Application of robust fixed point transformations for technological operation of robots

A robot’s drive has to exert appropriate driving forces that can keep its arm and end effector at the proper position, velocity and acceleration, and simultaneously has to compensate for the effects of the contact forces arising between the tool and the workpiece depending on the needs of the actual technological operation. Balancing the effects of a priori unknown external disturbance forces and the inaccuracies of the available dynamic model of the robot is also important. Technological tasks requiring well prescribed end effector trajectories and contact forces simultaneously are challenging control problems that can be tackled in various manners.

Bertrand oligopoly when rivals' costs are unknown

We study a Bertrand oligopoly model with incomplete information about rivals' costs, where the uncertainty is given by a uniform distribution. We compute the Bayesian-Nash equilibrium of this game, the ex-ante expected profit and the ex-post profit of each firm. We see that, even though only one firm produces in equilibrium, all firms have a positive ex-ante expected profit.