Modular ESS with second life batteries operating in grid independent mode

This work is part of a bigger project which aims to research the potential development of commercial opportunities for the re-use of batteries after their use in low carbon vehicles on an electricity grid or microgrid system. There are three main revenue streams (peak load lopping on the distribution Network to allow for network re-enforcement deferral, National Grid primary/ secondary/ high frequency response, customer energy management optimization). These incomes streams are dependent on the grid system being present. However, there is additional opportunity to be gained from also using these batteries to provide UPS backup when the grid is no longer present. Most UPS or ESS on the market use new batteries in conjunction with a two level converter interface. This produces a reliable backup solution in the case of loss of mains power, but may be expensive to implement. This paper introduces a modular multilevel cascade converter (MMCC) based ESS using second-life batteries for use on a grid independent industrial plant without any additional onsite generator as a potentially cheaper alternative. The number of modules has been designed for a given reliability target and these modules could be used to minimize/eliminate the output filter. An appropriate strategy to provide voltage and frequency control in a grid independent system is described and simulated under different disturbance conditions such as load switching, fault conditions or a large motor starting. A comparison of the results from the modular topology against a traditional two level converter is provided to prove similar performance criteria. The proposed ESS and control strategy is an acceptable way of providing backup power in the event of loss of grid. Additional financial benefit to the customer may be obtained by using a second life battery in this way.

Pushing the Quality Level in Networked News Business: Semantic-Based Content Retrieval and Composition in International News Publishing

Electronic publishing exploits numerous possibilities to present or exchange information and to communicate via most current media like the Internet. By utilizing modern Web technologies like Web Services, loosely coupled services, and peer-to-peer networks we describe the integration of an intelligent business news presentation and distribution network. Employing semantics technologies enables the coupling of multinational and multilingual business news data on a scalable international level and thus introduce a service quality that is not achieved by alternative technologies in the news distribution area so far. Architecturally, we identified the loose coupling of existing services as the most feasible way to address multinational and multilingual news presentation and distribution networks. Furthermore we semantically enrich multinational news contents by relating them using AI techniques like the Vector Space Model. Summarizing our experiences we describe the technical integration of semantics and communication technologies in order to create a modern international news network.

Generalizing of Neural Nets: Functional Nets of Special Type

Special generalizing for the artificial neural nets: so called RFT – FN – is under discussion in the report. Such refinement touch upon the constituent elements for the conception of artificial neural network, namely, the choice of main primary functional elements in the net, the way to connect them(topology) and the structure of the net as a whole. As to the last, the structure of the functional net proposed is determined dynamically just in the constructing the net by itself by the special recurrent procedure. The number of newly joining primary functional elements, the topology of its connecting and tuning of the primary elements is the content of the each recurrent step. The procedure is terminated under fulfilling “natural” criteria relating residuals for example. The functional proposed can be used in solving the approximation problem for the functions, represented by its observations, for classifying and clustering, pattern recognition, etc. Recurrent procedure provide for the versatile optimizing possibilities: as on the each step of the procedure and wholly: by the choice of the newly joining elements, topology, by the affine transformations if input and intermediate coordinate as well as by its nonlinear coordinate wise transformations. All considerations are essentially based, constructively and evidently represented by the means of the Generalized Inverse.

Maximising the efficiency of logistics operations with radio frequency identification technology

Radio frequency identification (RFID) technology has gained increasing popularity in businesses to improve operational efficiency and maximise costs saving. However, there is a gap in the literature exploring the enhanced use of RFID to substantially add values to the supply chain operations, especially beyond what the RFID vendors could offer. This paper presents a multi-agent system, incorporating RFID technology, aimed at fulfilling the gap. The system is developed to model supply chain activities (in particular, logistics operations) and is comprised of autonomous and intelligent agents representing the key entities in the supply chain. With the advanced characteristics of RFID incorporated, the agent system examines ways logistics operations (i.e. distribution network) particular) can be efficiently reconfigured and optimised in response to dynamic changes in the market, production and at any stage in the supply chain. © 2012 IEEE.

Európai Unió: túlélés vagy távlati tervezés – az állam változó szerepei (European Union – survival or long term planning?)

Az EU-ban, a mai állapotok szerint, csak „transzferunióról” beszélhetünk és nem egységes piacról. Az eurós pénzfolyamatok eltorzítva közvetítik a versenyképességet is: mind az árukban és vagyontárgyakban, mind – főleg – a pénzügyi eszközökben megtestesült munkákat/teljesítményeket rosszul árazzák. Egy ilyen keretben különösen könnyen alakul ki az, amit potyautas-problémának nevezünk, vagyis ahol tényleges vagy mérhető teljesítményleadás, vagy éppen fizetés nélkül lehet fogyasztani, és túl olcsón lehet szabad forrásokhoz jutni. Az eurózóna számos közvetítő mechanizmusában is tökéletlen. A sok, szuverénadósság-présbe került tagország között van kicsi, közepes és nagy is. Ez a tény, valamint az általános növekedési és munkapiaci problémák, egyértelműen „rendszerszintű zavarokat” jeleznek, amelyeket ebben a dolgozatban teljesítmény közvetítési-átviteli problémának hívunk, és ezért egy szokatlan, ám annál beszédesebb, elektromosenergia-átviteli rendszeranalógiával segítünk értelmezni. Megmutatjuk, hogy egy jó nagyvállalat miért jobb pénzügyi tervező, mint egy azonos méretű állam. _____ Why are ill-defined transfer mechanisms diverting valuable assets and resources to the wrong destination within the EU? Why do we witness ongoing pressure in the EU banking sector and in government finances? We offer an unusual answer to these questions: we apply an analogy from physics (from an electric generation and distribution network) to show the transmission inefficiency and waste, respectively, of the EU distribution mechanisms. We demonstrate that there are inherent flaws in both the measurement and in the distribution of assets and resources amongst the key EU markets: goods, money and factor markets. In addition, we find that when international equalizer mechanism is at work (cohesion funds allocated), many of these equity functions are at risk with respect to their reliable measurement. Especially are at risk the metered load factors, likewise the loss/waste factors. The map of desired outcomes does not match the real outcome, since EUtransfers in general are put to work with low efficiency.

Resource management and optimization in wireless mesh networks

A wireless mesh network is a mesh network implemented over a wireless network system such as wireless LANs. Wireless Mesh Networks(WMNs) are promising for numerous applications such as broadband home networking, enterprise networking, transportation systems, health and medical systems, security surveillance systems, etc. Therefore, it has received considerable attention from both industrial and academic researchers. This dissertation explores schemes for resource management and optimization in WMNs by means of network routing and network coding.^ In this dissertation, we propose three optimization schemes. (1) First, a triple-tier optimization scheme is proposed for load balancing objective. The first tier mechanism achieves long-term routing optimization, and the second tier mechanism, using the optimization results obtained from the first tier mechanism, performs the short-term adaptation to deal with the impact of dynamic channel conditions. A greedy sub-channel allocation algorithm is developed as the third tier optimization scheme to further reduce the congestion level in the network. We conduct thorough theoretical analysis to show the correctness of our design and give the properties of our scheme. (2) Then, a Relay-Aided Network Coding scheme called RANC is proposed to improve the performance gain of network coding by exploiting the physical layer multi-rate capability in WMNs. We conduct rigorous analysis to find the design principles and study the tradeoff in the performance gain of RANC. Based on the analytical results, we provide a practical solution by decomposing the original design problem into two sub-problems, flow partition problem and scheduling problem. (3) Lastly, a joint optimization scheme of the routing in the network layer and network coding-aware scheduling in the MAC layer is introduced. We formulate the network optimization problem and exploit the structure of the problem via dual decomposition. We find that the original problem is composed of two problems, routing problem in the network layer and scheduling problem in the MAC layer. These two sub-problems are coupled through the link capacities. We solve the routing problem by two different adaptive routing algorithms. We then provide a distributed coding-aware scheduling algorithm. According to corresponding experiment results, the proposed schemes can significantly improve network performance.^

Algorithme de branch-and-price-and-cut pour le problème de conception de réseaux avec coûts fixes, capacités et un seul produit

De nombreux problèmes liés aux domaines du transport, des télécommunications et de la logistique peuvent être modélisés comme des problèmes de conception de réseaux. Le problème classique consiste à transporter un flot (données, personnes, produits, etc.) sur un réseau sous un certain nombre de contraintes dans le but de satisfaire la demande, tout en minimisant les coûts. Dans ce mémoire, on se propose d'étudier le problème de conception de réseaux avec coûts fixes, capacités et un seul produit, qu'on transforme en un problème équivalent à plusieurs produits de façon à améliorer la valeur de la borne inférieure provenant de la relaxation continue du modèle. La méthode que nous présentons pour la résolution de ce problème est une méthode exacte de branch-and-price-and-cut avec une condition d'arrêt, dans laquelle nous exploitons à la fois la méthode de génération de colonnes, la méthode de génération de coupes et l'algorithme de branch-and-bound. Ces méthodes figurent parmi les techniques les plus utilisées en programmation linéaire en nombres entiers. Nous testons notre méthode sur deux groupes d'instances de tailles différentes (gran-des et très grandes), et nous la comparons avec les résultats donnés par CPLEX, un des meilleurs logiciels permettant de résoudre des problèmes d'optimisation mathématique, ainsi qu’avec une méthode de branch-and-cut. Il s'est avéré que notre méthode est prometteuse et peut donner de bons résultats, en particulier pour les instances de très grandes tailles.

Optimal day-ahead scheduling of integrated urban energy systems

An optimal day-ahead scheduling method (ODSM) for the integrated urban energy system (IUES) is introduced, which considers the reconfigurable capability of an electric distribution network. The hourly topology of a distribution network, a natural gas network, the energy centers including the combined heat and power (CHP) units, different energy conversion devices and demand responsive loads (DRLs), are optimized to minimize the day-ahead operation cost of the IUES. The hourly reconfigurable capability of the electric distribution network utilizing remotely controlled switches (RCSs) is explored and discussed. The operational constraints from the unbalanced three-phase electric distribution network, the natural gas network, and the energy centers are considered. The interactions between the electric distribution network and the natural gas network take place through conversion of energy among different energy vectors in the energy centers. An energy conversion analysis model for the energy center was developed based on the energy hub model. A hybrid optimization method based on genetic algorithm (GA) and a nonlinear interior point method (IPM) is utilized to solve the ODSM model. Numerical studies demonstrate that the proposed ODSM is able to provide the IUES with an effective and economical day-ahead scheduling scheme and reduce the operational cost of the IUES.

GRASP and statistical bounds for heuristic solutions to combinatorial problems

The quality of a heuristic solution to a NP-hard combinatorial problem is hard to assess. A few studies have advocated and tested statistical bounds as a method for assessment. These studies indicate that statistical bounds are superior to the more widely known and used deterministic bounds. However, the previous studies have been limited to a few metaheuristics and combinatorial problems and, hence, the general performance of statistical bounds in combinatorial optimization remains an open question. This work complements the existing literature on statistical bounds by testing them on the metaheuristic Greedy Randomized Adaptive Search Procedures (GRASP) and four combinatorial problems. Our findings confirm previous results that statistical bounds are reliable for the p-median problem, while we note that they also seem reliable for the set covering problem. For the quadratic assignment problem, the statistical bounds has previously been found reliable when obtained from the Genetic algorithm whereas in this work they found less reliable. Finally, we provide statistical bounds to four 2-path network design problem instances for which the optimum is currently unknown.

Tietokantaratkaisuehdotus pientasajännitesähköverkoston mittausdatavarastoksi

Lappeenrannan teknillinen yliopisto tutkii pientasajännitesähkön käyttöä. Yliopisto on rakennuttanut Järvi-Suomen Energia Oy:n ja Suur-Savon Sähkö Oy:n kanssa yhteistyössä kokeellisen pientasajännitesähköverkon, jolla pystytään tarjoamaan kenttäolosuhteet pienjännitetutkimukselle todellisilla asiakkailla ja todentaa LVDC-teknologiaa ja muita älykkään sähköverkon toimintoja kenttäolosuhteissa. Verkon tasajänniteyhteys on rakennettu 20 kV sähkönjakeluverkon ja neljän kuluttajan välille. 20 kV keskijännite suunnataan tasamuuntamolla ±750 V pientasajännitteeksi ja uudestaan 400/230 V vaihtojännitteeksi kuluttajien läheisyydessä. Tämän kandidaatintyön tarkoituksena on luoda yliopistolle tietokanta pientasajännitesähköverkosta kertyvälle tiedolle ja mittaustuloksille. Tietokanta nähtiin tarpeelliseksi luoda, jotta pienjänniteverkon mittaustuloksia pystytään myöhemmin tarkastelemaan yhdessä ja yhtenäisessä muodossa. Yhdeksi tutkimuskysymykseksi muodostui, kuinka järjestää ja visualisoida kaikki verkosta palvelimille kertyvä mittausdata. Työssä on huomioitu myös kolme tietokantaa mahdollisesti hyödyntävää käyttäjäryhmää: kotitalousasiakkaat, sähköverkkoyhtiöt ja tutkimuslaboratorio, sekä pohdittu tietokannan hyötyä ja merkitystä näille käyttäjille. Toiseksi tutkimuskysymykseksi muodostuikin, mikä kaikesta tietokantaan talletetusta datasta olisi oleellisen tärkeää ottaa talteen näiden asiakkaiden kannalta, ja kuinka nämä voisivat hakea tietoa tietokannasta. Työn tutkimusmenetelmät perustuvat jo valmiiksi olemassa olevaan mittausdataan. Työtä varten on käytetty sekä painettua että sähköisessä muodossa olevaa kirjallisuutta. Työn tuloksena on saatu luotua tietokanta MySQL Workbench -ohjelmistolla, sekä mittausdatan keräys- ja käsittelyohjelmat Python-ohjelmointikielellä. Lisäksi on luotu erillinen MATLAB-rajapinta tiedon visualisoimista varten, jolla havainnollistetaan kolmen asiakasryhmän mittausdataa. Tietokanta ja sen tiedon visualisointi antavat kuluttajalle mahdollisuuden ymmärtää paremmin omaa sähkönkäyttöään, sekä sähköverkkoyhtiöille ja tutkimuslaboratorioille muun muassa tietoa sähkön laadusta ja verkon kuormituksesta.

Application of the latency insertion method (LIM) to the analysis of large circuit interconnect networks

The focus of this research is to explore the applications of the finite difference formulation based on the latency insertion method (LIM) to the analysis of circuit interconnects. Special attention is devoted to addressing the issues that arise in very large networks such as on-chip signal and power distribution networks. We demonstrate that the LIM has the power and flexibility to handle various types of analysis required at different stages of circuit design. The LIM is particularly suitable for simulations of very large scale linear networks and can significantly outperform conventional circuit solvers (such as SPICE).

Algorithme de branch-and-price-and-cut pour le problème de conception de réseaux avec coûts fixes, capacités et un seul produit

De nombreux problèmes liés aux domaines du transport, des télécommunications et de la logistique peuvent être modélisés comme des problèmes de conception de réseaux. Le problème classique consiste à transporter un flot (données, personnes, produits, etc.) sur un réseau sous un certain nombre de contraintes dans le but de satisfaire la demande, tout en minimisant les coûts. Dans ce mémoire, on se propose d'étudier le problème de conception de réseaux avec coûts fixes, capacités et un seul produit, qu'on transforme en un problème équivalent à plusieurs produits de façon à améliorer la valeur de la borne inférieure provenant de la relaxation continue du modèle. La méthode que nous présentons pour la résolution de ce problème est une méthode exacte de branch-and-price-and-cut avec une condition d'arrêt, dans laquelle nous exploitons à la fois la méthode de génération de colonnes, la méthode de génération de coupes et l'algorithme de branch-and-bound. Ces méthodes figurent parmi les techniques les plus utilisées en programmation linéaire en nombres entiers. Nous testons notre méthode sur deux groupes d'instances de tailles différentes (gran-des et très grandes), et nous la comparons avec les résultats donnés par CPLEX, un des meilleurs logiciels permettant de résoudre des problèmes d'optimisation mathématique, ainsi qu’avec une méthode de branch-and-cut. Il s'est avéré que notre méthode est prometteuse et peut donner de bons résultats, en particulier pour les instances de très grandes tailles.

Alueellinen sähkökuormien kehitysennuste Rovaniemen Verkko Oy:n jakelualueella

Tämän työn tavoitteena on skenaarioiden avulla luoda pitkän aikavälin alueellinen sähkökuormien kehitysennuste Rovaniemen Verkko Oy:lle. Pitkän aikavälin kuormitusennusteet ovat välttämättömiä verkon kehittämisen pohjalle, jotta verkko voidaan mitoittaa vastaamaan kuormitusta pitkälle tulevaisuuteen tekniset ja taloudelliset vaatimukset huomioiden. Kuormitusennusteen onkin jatkossa tarkoitus toimia apuvälineenä verkon strategisessa kehittämisessä. Pohjana kuormitusennusteissa on tilastokeskuksen ja Rovaniemen kaupungin väestö- ja työpaikkaennusteet. Väestöennusteiden ja erilaisten rakentamistilastoiden avulla arvioidaan uudisrakentamisen määrä tulevaisuudessa. Uudisrakentamisen kuormitusvaikutuksiin päästään työssä määritettyjen paikallisten ja rakennustyyppikohtaisten sähkön ominaiskulutuksien avulla. Kuormituksien alueellinen sijoittautuminen arvioidaan kaavoituksen ja kaupungin maankäytön toteuttamisohjelman avulla. Työssä tutkitaan myös tulevaisuudessa sähkönkäytössä tapahtuvien useiden muutosten vaikutusta alueelliseen kuormitukseen. Näitä muutoksia ovat muun muassa sähköautojen, hajautetun tuotannon, lämpöpumppujen ja kysynnän jouston lisääntyminen. Myös rakennusten jatkuvasti parantuva energiatehokkuus aiheuttaa muutoksia sähkön kulutukseen.

Train scheduling in high speed railways: considering competitive effects

The railway planning problem is usually studied from two different points of view: macroscopic and microscopic. We propose a macroscopic approach for the high-speed rail scheduling problem where competitive effects are introduced. We study train frequency planning, timetable planning and rolling stock assignment problems and model the problem as a multi-commodity network flow problem considering competitive transport markets. The aim of the presented model is to maximize the total operator profit. We solve the optimization model using realistic probleminstances obtained from the network of the Spanish railwa operator RENFE, including other transport modes in Spain

Comunidades energéticas sustentáveis: estudo de Implementação de uma comunidade eólica no Algarve

Tese de Doutoramento, Gestão da Inovação e do Território, Faculdade de Economia, Universidade do Algarve, 2016