The rapid escalation in plug-in electric vehicles (PEVs) and their uncoordinated charging patterns pose several challenges in distribution system operation. Some of the undesirable effects include overloading of transformers, rapid voltage fluctuations, and over/under voltages. While this compromises the consumer power quality, it also puts on extra stress on the local voltage control devices. These challenges demand a well-coordinated and power network-aware charging approach for PEVs in a community. This paper formulates a realtime electric vehicle charging scheduling problem as a mixed-integer linear program (MILP). The problem is to be solved by an aggregator that provides charging services in a residential community. The proposed formulation maximizes the profit of the aggregator, enhancing the utilization of available infrastructure. With prior knowledge of load demand and hourly electricity prices, the algorithm uses a moving time horizon optimization approach, allowing an unknown number of arriving vehicles. In this realistic setting, the proposed framework ensures that power system constraints are satisfied and guarantees the desired PEV charging level within the stipulated time. Numerical tests on an IEEE 13-node feeder system demonstrate the computational and performance superiority of the proposed MILP technique. / M.S. / There is an enhanced rate of global warming due to emissions and increased usage of fossil fuels in the transportation sector. As a feasible solution, electrification of transportation has become a necessary step towards an environment-friendly future. The escalation in plug-in electric vehicles (PEVs) has increased the impact on loading and voltage fluctuations in the distribution grid due to uncoordinated charging. This puts on extra stress on the grid system and compromises the system performance. As a measure to control the vehicle charging in a residential setup, a real-time optimal charging scheduling algorithm is developed which is implemented at the neighborhood level. To increase the charging performance with the limited available resources, an aggregator is introduced. The charging profit is maximized as the PEV charging problem is solved optimally by the aggregator. This facilitates the reduction in night-time grid congestion and maximization of number of PEVs getting charged with limited dependency on communication to avoid long delays in charging control. The proposed technique guarantees the complete charging of the selected PEVs in the stipulated time while considering the power grid operational constraints. It also reduces the impact of peak load demand by flattening the base load demand curve. To demonstrate the efficiency of the proposed mixed integer linear programming optimization algorithm, numerical tests for an IEEE 13 node feeder are performed. The results are discussed to give an outlook on the balance between system and user requirements by meeting the demand of the PEV users.

Portfolio optimization is a crucial practice in finance aimed at maximizing the return while minimizing the risk through strategic asset allocation. This paper explores two distinct approaches to modeling robust portfolio optimization, comparing their efficacy in balancing the return and the risk. The first approach focuses on diversifying the portfolio by varying the number of stocks and sector allocation, while the second approach emphasizes minimizing risk by selecting stocks with low correlation. Theoretical foundations and mathematical formulations underpinning these approaches are discussed, incorporating concepts from Modern Portfolio Theory and Mixed Integer Linear Programming. Practical implementation involves data collection from Yahoo Finance API and computational analysis using Python and the optimization tool Gurobi. The results of these methodologies are evaluated, considering factors such as budget constraints, maximum and minimum investment limits, binary constraints, and correlation thresholds. The study concludes by discussing the implications of these findings and their relevance in contemporary financial decision-making processes.

Χωροθέτηση μονάδας επεξεργασίας ΑΣΑ σε συνδιασμό με τον απαραίτητο ΧΥΤΥ, με μικτό ακέραιο γραμμικό προγραμματισμό, για τη βελτιστοποίηση των ακολουθούμενων διαδρομών των απορριμματοφόρων προς την μονάδα επεξεργασίας και απο την μονάδα προς τον ΧΥΤΥ.Εγινε με εφαρμογή GIS στη Μεσσηνία. / The current thesis is about optimum siting of a MSW treatment plant combined with a landfill for residues based on mixed integer linear programming (MILP) and GIS methodology.

High electricity prices have become the title of several news articles recently in Sweden and the prices have experienced large sudden fluctuations during certain periods. In this thesis work, a smart control model for the electricity usage in three different households has been developed with the main purpose to minimize the electricity cost. This has been implemented by using mixed-integer linear programming (MILP) to optimize the cost 24 hours ahead, and by forecasting two of the main inputs; the load and the electricity spot prices for bidding zone three (SE3) in Sweden. The units included in the model are the photovoltaic system, the batteries, the electricity consumption in the house and the electric vehicles. However, the main task of the smart control was to determine when and in which amount the energy should flow from one unit to another, or to/from the grid. In other words, it decides the charging/discharging of the batteries, the selling/buying of electricity and the charging of the electric vehicle (EV). Different amounts of cost savings/profits have been obtained when applying the smart control on the three houses, which have different annual consumption, capacities of the components, heating systems and more. The results showed that it is most optimal to run the model between the time interval 13.00-00.00, when the spot prices for the next day are known, in order to avoid the remarkable impact accompanied with the use of forecasted electricity prices as input to the model. The forecasting of the load is, on the other hand, required to run the model, but this thesis showed that the effect of the uncertainties in this forecast is relatively small. Three types of machine learning methods were implemented to perform the forecasts, namely linear regression (LR), decision tree regression and random forest regression. After measuring especially the mean absolute error (MAE) to validate the results, the random forest regression showed the least error and the other methods showed close results when looking at the electric load prognosis.

A crucial challenge introduced by the decentralized installations of photovoltaic (PV) systems in the residential sector, is the mismatch between PV electricity generation and the load curve for energy consumption. To overcome this incompatibility between production and consumption, energy storage and demand response are seen as effective solutions. Smart meters and the installation of intelligent smart appliances in homes have paved the way for efficient energy consumption monitoring and active household load control in the residential sector.  The aim of the thesis work is to develop a dynamic energy management algorithm tailored to optimize the energy consumption pattern of controllable household assets to maximize PV selfconsumption. A rolling horizon algorithm based dynamic model was designed using mixedinteger linear programming (MILP) and later compared with the baseline model to understand the real-time operational benefits of the rolling horizon approach.  Analyzing device scheduling patterns based on the feed-in-tariff showed considerable differences in the scheduling approach for both optimization models. A comparative analysis was conducted to understand the system benefits offered by both optimization models under different feed-in-tariff structures. Higher self-consumption rates were achieved through annual scheduling approach, but it does not reflect the real-time operation of the systems in the household. A rolling horizon optimization reflects the real-time operation of the energy system and has a lower self-consumption rate due to a limited optimization horizon. The method indicates the significant potential of self-consumption specially in lieu of decreasing feed-in tariffs. / En viktig utmaning som de decentraliserade installationerna av solcellssystem i bostadssektorn innebär är att elproduktionen från solcellerna inte stämmer överens med belastningskurvan för energiförbrukningen. För att komma till rätta med denna oförenlighet mellan produktion och konsumtion ses energilagring och efterfrågeflexibilitet som effektiva lösningar. Smarta mätare och installation av intelligenta smarta apparater i hemmen har banat väg för effektiv övervakning av energiförbrukningen och aktiv styrning av hushållens belastning i bostadssektorn.  Syftet med avhandlingen är att utveckla en dynamisk energihanteringsalgoritm som är skräddarsydd för att optimera energiförbrukningsmönstret för kontrollerbara hushållstillgångar för att maximera självförbrukningen av solceller. En dynamisk modell baserad på en algoritm med rullande horisont utformades med hjälp av blandad linjär programmering (MILP) och jämfördes senare med basmodellen för att förstå de operativa realtidsfördelarna med metoden med rullande horisont. Analysen av schemaläggningsmönster för enheter baserat på inmatningstariffen visade att det fanns betydande skillnader i schemaläggningsmetoden för båda optimeringsmodellerna. En jämförande analys genomfördes för att förstå de systemfördelar som erbjuds av de båda optimeringsmodellerna under olika strukturer för inmatningstariffer. Högre självförbrukningsnivåer uppnåddes genom den årliga schemaläggningsmetoden, men den återspeglar inte realtidsdriften av systemen i hushållet. En optimering med rullande horisont återspeglar energisystemets drift i realtid och har en lägre självförbrukningsgrad på grund av en begränsad optimeringshorisont. Metoden visar på den betydande potentialen för självförbrukning speciellt i stället för minskande inmatningstariffer.

Made available in DSpace on 2016-06-02T19:53:34Z (GMT). No. of bitstreams: 1 STARK_Felipe_2015.pdf: 2619946 bytes, checksum: 296213b74067cc59aea0beae2cf8f165 (MD5) Previous issue date: 2015-03-20 / Universidade Federal de Minas Gerais / The increase in the municipal and industrial waste generation has caused enviromental and public health problems and as a consequence laws exist to address the issue. In Brazil, with the Federal Law No. 12,350 / 10 about the Política Nacional de Resíduos Sólidos reverse logistics (RL) of some products has become mandatory, including waste tires. However, RL of waste tires has been structured since environmental government agency resolutions propose treatment for tires disposal incorrectly in the environment and new generation of waste tires. Currently, the reverse network is managed by the tire manufacturers and importers associations, and destinations are commonly used are co-processing in cement kilns, and the recovery of rubber and steel as secondary products, by processes such as scrapping or lamination. Increasing transportation and operation costs in the logistics network make the network design critical for the full compliance with the legal goal. This network design is aligned with a planning that considers the financial issues like the minimization of costs or the maximization of profit, while meets the requirements of environmental government agencies. So it involves key strategic decisions, as the location of facilities and material flows, taking into account many parameters simultaneously. The objective of this study is to propose a model for waste tires reverse logistics considering: (i) flows from the output of the collection points (called ecopontos ) to the destination companies; (ii) the possibility of processes as the sorting of used tires in usable condition or not; (iii) the grinding process as an intermediate phase and for which type of destination the tire would be sent. Still are considered fixed costs for the installation of storage centers, for sorting used tires, and intermediary companies, for grinding and separation of components, in addition to the variable operating costs, transportation and potential revenues generated from the substitution of raw materials or fuel in destination companies. The model is a mixed integer linear problem (MILP) with multiple time periods. Experiments are done with a single and multiple periods, finally were present some sensitivity analysis. Other financial constraints as the annual budget and an approach that includes the carbon footprint (CO2) in the transport and processing are explored. The results showed configurations that meet the goal and have a small profit, indicating that storage centers are preferred in places far from destination points and low demand, while the pre-processing companies have opposite behavior. When using the carbon footprint, it was found that the sorting of used tires gain more importance in the view of reducing emissions, because there is less emission in the reuse or refurbishment compared to the manufacturing of new tires. / O aumento na geração de resíduos urbanos e industriais tem ocasionado problemas de ordem ambiental e de saúde pública, e, como consequência, legislações específicas surgiram para tratar do assunto. No Brasil, a Lei Federal nº 12.350/10, da Política Nacional de Resíduos Sólidos, tornou obrigatória a logística reversa (LR) de alguns produtos, entre os quais o pneu usado sem condição de rodagem (inservível). Entratanto, a LR de pneus inservíveis já se apresentava em fase de estruturação, uma vez que resoluções ambientais propunham o tratamento do passivo deixado por anos de descarte incorreto dos pneus no meio ambiente. Atualmente, a rede reversa de pneus é administrada por associações de fabricantes e importadores, e as destinações comumente utilizadas são o coprocessamento, em fornos de cimenteira, e a recuperação da borracha e do aço como subprodutos, por meio de processos como a granulação ou a laminação. Os crescentes custos do transporte terrestre e as proposições de melhorias na rede logística tornam a configuração da rede de logística reversa de pneus como uma proposta para o total cumprimento da meta, alinhados ao planejamento que considere as questões financeiras como a minimização de custos logísticos ou maximização do lucro, enquanto cumprem as exigências dos órgãos ambientais. Esta configuração envolve decisões estratégicas essenciais, como a localização de instalações e determinação dos fluxos de materiais, sendo que muitos parâmetros estão presentes simultaneamente. O objetivo deste estudo é propor um modelo de configuração de rede logística reversa de pneus inservíveis considerando: (i) fluxos a partir da saída dos pontos de coleta (ecopontos) até as empresas destinadoras; (ii) processos como a possibilidade da triagem dos pneus usados em servíveis e inservíveis; (iii) a trituração como fase intermediária e para qual tipo de destinação enviar. São considerados ainda custos fixos para instalação de centros de armazenamento, para triagem dos pneus usados, e empresas intermediárias, para trituração e separação de componentes, além dos custos variáveis de operação, transporte e as possíveis rendas geradas com a substituição da matéria-prima ou combustível nas empresas destinadoras. O modelo apresenta formulação linear inteira mista (MILP) com múltiplos períodos. São feitos experimentos com único período, e com a variação de parâmetros. Posteriormente são estudadas restrições financeiras como orçamento anual e uma abordagem que inclui a pegada de carbono (CO2) no transporte e processamento. Os resultados encontrados apresentaram configurações que cumprem a meta e apresentam um pequeno lucro, indicando que os centros de armazenamento são preferíveis em locais afastados das destinadoras e com baixa demanda, enquanto as empresas intermediárias apresentam comportamento oposto. Quando se utilizou a pegada de carbono, verificou-se que a triagem de pneus ganha mais importância, dada a redução nas emissões do reuso ou reforma dos pneus em relação à fabricação de novos pneus.

La plupart des systèmes ferroviaires subissent une demande croissante de capacité. Pour y faire face, il faut construire de nouvelles infrastructures ou exploiter plus efficacement celles existantes, notamment en définissant des grilles horaires optimisées. Dans la littérature, la plupart des approches de construction des grilles sont basées sur des représentations macroscopiques de l'infrastructure, ce qui peut conduireà des solutions infaisables ou inefficaces. En revanche, les approches microscopiques reposent sur une modélisation réaliste du système ferroviaire, ce qui garantit la faisabilité et l'efficacité des résultats. Néanmoins, en raison de leur complexité, l'utilisation de ces approches est généralement limitée à une seule gare. Malgré l'optimisation de la grille horaire, les travaux de maintenance peuvent avoir un fort impact sur les circulations des trains. En présence de maintenances, il peut donc être nécessaire de redéfinir la grille horaire pour assurer une exploitation efficace de la capacité. Nous présentons deux contributions principales sous forme de deux approches microscopiques : une pour la conception de grilles horaires et l'autre pour leur redéfinition en cas de maintenance. La deuxième est la première approche microscopique qui apparaît dans la littérature pour aborder ce problème tout en considérant des aspects comme les limitations temporaires de vitesse. Nous démontrons la validité de nos approches et leur applicabilité dans des scénarios réels. De plus, nous montrons que les approches microscopiques peuvent être utilisées pour traiter des zones de l'infrastructure contenant plusieurs gares. / Most railway systems experience a growing demand of railway capacity. To face this demand, either new infrastructure must be built or a more efficient exploitation of the existing one must be attained. Timetables play a determinant role in the efficient capacity exploitation. Most timetabling approaches in the literature are based on macroscopic representations of the infrastructure. This may lead to inefficient and in some cases, impractical solutions. Instead, microscopic approaches are based on more realistic modelling of the elements of the railway system. This guarantees the feasibility of the timetables while promoting an efficient capacity exploitation. However, due to their complexity, the scope of microscopic approaches is typically restricted to main stations. Despite the optimization of timetables, the performance of infrastructure maintenance may severely impact the trains' circulations in the network. Therefore, the timetable may have to be rearranged to ensure an efficient capacity exploitation. We present two main contributions in this thesis: first, a microscopic approach for timetable design. Second, a microscopic approach for timetable rearrangement to cope with maintenance. This is the first microscopic approach in the literature to tackle this problem while also considering specific aspects as temporary speed limitations. After a thorough experimental analysis, we demonstrate the validity of our approaches and their practical applicability in real life scenarios. In particular, we show that microscopic approaches can be used to tackle large areas of the infrastructure, including several stations.

The purpose of this thesis is to investigate how tractor swapping can be implemented in Vehicle Routing Problems (VRP) with electric heavy goods vehicles, and to evaluate how a model that allows for tractor swapping performs, in terms of schedule cost, against a model that does not. Hence, this thesis introduces a new rich VRP variant which includes tractor swapping, as well as time windows, pickup and delivery, and electric vehicles. The model is named Electric Tractor Swap Vehicle Routing Problem (E-TSVRP) and is formulated as a mixed integer linear program. As for the solver, Gurobi is used. The results show that utilizing tractor swapping can reduce the total cost of serving customers significantly by reducing en-route charging and utilizing drivers more efficiently. Specifically, it is shown that the cost reduction comes mainly from reducing driver work time. By demonstrating how tractor swapping works and how the results can be visualized on smaller cases, this thesis aims to serve as a foundation for future research within the field. To be able to fully implement the model for large logistics problem instances however, alternative solution methods such as heuristics or metaheuristics should be developed so that the problems can be solved in a reasonable amount of time. / Syftet med denna uppsats är att undersöka hur traktorbyten kan implementeras i "Vehicle Routing Problem" (VRP) med tunga, elektriska lastfordon, och att utvärdera hur en modell som tillåter traktorbyten presterar mot en modell som inte tillåter det, med avseende på den totala schemakostnaden. I uppsatsen introduceras därför en ny och generell VRP som har stöd för traktorbyten, men som också modellerar energikonsumtion och laddning av elektriska lastbilar, samt tillåter tidsfönster för när leveranser kan levereras och hämtas upp på godtyckliga platser. Modellen kallas för "Electric Tractor Swap Vehicle Routing Problem" (E-TSVRP) och formuleras som ett linjärt, blandat heltalsprogram. Programmet löses sedan med lösaren Gurobi. Resultaten visar att utnyttjandet av traktorbyten kan märkbart minska den totala kostnaden av att leverera varor till kunder genom att minska tiden som föraren väntar på att traktorn laddar. Mer specifikt tillåts möjligheten att byta till en ny traktor när den tidigare får slut på energi, vilket möjliggör en högre utnyttjandegrad av förarna, och den fakturerade tiden associerad till förarna kan minskas. Detta sker genom en avvägning mellan å ena sidan högre hårdvarukostnader för fler traktorer och å andra sidan lägre förarkostnader. Genom att demonstrera hur traktorbyten fungerar och hur resultaten kan visualiseras på mindre transportproblem, strävar denna uppsats efter att verka som en grund för framtida forskning. För att modellen ska kunna användas för stora logistikproblem bör dock alternativa lösningsmetoder som till exempel lösningsheuristiker eller metaheuristiker utvecklas så att problemen kan lösas inom en rimlig tid.

Combined cycle gas turbine power plants (CCGT), as part of the electricity generation fleet, are required to improve their flexibility to help balance the power system under new scenarios with high shares of variable renewable sources. Among the different possibilities to enhance the power plant performance, an inlet air conditioning unit offers the benefit of power augmentation and “minimum environmental load” reduction by controlling the gas turbine intake temperature using cold thermal energy storage and a heat pump. In this thesis, an evaluation of the conditioning unit impact over a power-oriented CCGT under a day-ahead optimized operation strategy is presented. To establish the hourly dispatch of the power plant and the right operation mode of the inlet condition unit bringing the desired benefits, a mixed-integer linear optimization was formulated aiming to maximize the operational profit of the plant within a 24 hours horizon. To assess the impact of the proposed unit operating under this control strategy, annual simulations of a reference power plant were developed with and without the unit, allowing to a comparison of their performance by means of technical and economic indicators. Furthermore, a case study changing equipment sizes was performed in order to identify trends of the power plant performance related to such parameters; and lastly, a sensitivity analysis on market conditions to test the control strategy response was included. The results indicate that the inlet conditioning unit together with the dispatch optimization increase the power plant operational profit trough the gain of power variation over peak and off-peak periods. For the specific case study in northern Italy, it is shown that a power plant integrated with the conditioning unit is more profitable in terms of net present value based on the undertaken investment figures. Related to the technical performance, it also shows that the unit reduces by 1,34% the minimal environmental load when part-load operations are required and that it can increase the net power output by 0.17% annually. All in all, this study presents the benefits of a dispatch optimization strategy when couple to a novel solution to increase CCGT flexibility. / Elproducerande kombikraftverk (CCGT) förväntas förbättra sin flexibilitet för att kunna bidra till stabilisering av elnätet i framtida scenarier med ökande andel variabla, förnybara energikällor. Av de diverse metoder som finns att tillgå för att förbättra ett kraftverks prestanda, erbjuder en inluftsbehandlingsenhet både fördelar med kraftförbättring samt minskning av “minimun environmental load”; genom att med hjälp av kall termisk energilagring och en värmepump kontrollera gasens inluftstemperatur till gasturbinen. I den här uppsatsen undersöks hur en sådan inluftsbehandlingsenhet påverkar prestandan hos en kraftproduktionsfokuserad CCGT när en optimerad driftsstrategi introduceras. För att bestämma kraftverkets elproduktion vid varje timme och det korrekta driftläget för luftbehandlingsenheten (för att uppnå tidigare nämnda eftersökta fördelar) formulerades ett linjärt optimeringsproblem med syfte att maximera kraftverkets driftsförtjänst under ett 24-timmars tidsspann. För att bedöma den föreslagna inluftsbehandlingsenhetens inverkan under den optimerade driftsstrategin genomfördes simuleringar av ett referenskraftverk med och utan nämnda enhet, varpå en jämförelse med avseende på teknisk prestanda och ekonomi genomfördes. Vidare genomfördes en fallstudie där storlek på diverse utrustning varierades för att kunna identifiera trender i kraftverksprestanda baserat på dessa parametrar; slutligen genomfördes en känslighetsanalys rörande hur luftbehandlingsenheten och kontrollstrategin reagerar vid olika marknader.. Resultaten indikerar att en inluftsbehandlingsenhet tillsammans med en optimerad driftsstrategi ökar kraftverkets driftsvinning genom en ökad variation i kraftuttag över peak och off-peak timmar. För fallstudien i norra Italien fanns att ett kraftverk med integrerad luftbehandlingsenhet är mer lönsamt sett till nuvärdesanalys. Gällande teknisk prestanda visade resultaten att enheten minskar den minsta miljöbelastningen med 1,34 % när delbelastningsdrift fordras, och att det kan öka nettokraftuttag med 0,17% årligen. Sammanfattningsvis presenterar denna studie fördelarna med ett driftsoptimerat kraftverk kopplat till en ny lösning för att öka flexibilitet hos CCGT:er.

Tesis por compendio / [ES] Los sistemas de tiempo real se caracterizan por exigir el cumplimento de unos requisitos temporales que garanticen el funcionamiento aceptable de un sistema. Especialmente, en los sistemas de tiempo real estricto estos requisitos temporales deben ser inviolables. Estos sistemas suelen aplicarse en áreas como la aviación, la seguridad ferroviaria, satélites y control de procesos, entre otros. Por tanto, el incumplimiento de un requisito temporal en un sistema de tiempo real estricto puede ocasionar un fallo catastrófico. La planificación de sistemas de tiempo real es una área en la que se estudian y aplican diversas metodologías, heurísticas y algoritmos que intentan asignar el recurso de la CPU sin pérdidas de plazo. El uso de sistemas de computación multinúcleo es una opción cada vez más recurrente en los sistemas de tiempo real estrictos. Esto se debe, entre otras causas, a su alto rendimiento a nivel de computación gracias a su capacidad de ejecutar varios procesos en paralelo. Por otro lado, los sistemas multinúcleo presentan un nuevo problema, la contención que ocurre debido a la compartición de los recursos de hardware. El origen de esta contención es la interferencia que en ocasiones ocurre entre tareas asignadas en distintos núcleos que pretenden acceder al mismo recurso compartido simultáneamente, típicamente acceso a memoria compartida. Esta interferencia añadida puede suponer un incumplimiento de los requisitos temporales, y por tanto, la planificación no sería viable. En este trabajo se proponen nuevas metodologías y estrategias de planificación no convencionales para aportar soluciones al problema de la interferencia en sistemas multinúcleo. Estas metodologías y estrategias abarcan algoritmos de planificación, algoritmos de asignación de tareas a núcleos, modelos temporales y análisis de planificabilidad. El resultado del trabajo realizado se ha publicado en diversos artículos en revistas del área. En ellos se presentan estas nuevas propuestas que afrontan los retos de la planificación de tareas. En la mayoría de los artículos presentados la estructura es similar: se introduce el contexto en el que nos situamos, se plantea la problemática existente, se expone una propuesta para solventar o mejorar los resultados de la planificación, después se realiza una experimentación para evaluar de forma práctica la metodología propuesta, se analizan los resultados obtenidos y finalmente se exponen unas conclusiones sobre la propuesta. Los resultados de las metodologías no convencionales propuestas en los artículos que conforman esta tesis muestran una mejora del rendimiento de las planificaciones en comparación con algoritmos clásicos del área. Especialmente la mejora se produce en términos de disminución de la interferencia producida y mejora de la tasa de planificabilidad. / [CA] Els sistemes de temps real es caracteritzen per exigir el compliment d'uns requisits temporals que garantisquen el funcionament acceptable d'un sistema. Especialment, en els sistemes de temps real estricte aquests requisits temporals han de ser inviolables. Aquests sistemes solen aplicar-se en àrees com l'aviació, la seguretat ferroviària, satèl·lits i control de processos, entre altres. Per tant, l'incompliment d'un requisit temporal en un sistema de temps real estricte pot ocasionar un error catastròfic. La planificació de sistemes de temps real és una àrea en la qual s'estudien i apliquen diverses metodologies, heurístiques i algorismes que intenten assignar el recurs de la CPU sense pèrdues de termini. L'ús de sistemes de computació multinucli és una opció cada vegada més recurrent en els sistemes de temps real estrictes. Això es deu, entre altres causes, al seu alt rendiment a nivell de computació gràcies a la seua capacitat d'executar diversos processos en paral·lel. D'altra banda, els sistemes multinucli presenten un nou problema, la contenció que ocorre a causa de la compartició dels recursos de hardware. L'origen d'aquesta contenció és la interferència que a vegades ocorre entre tasques assignades en diferents nuclis que pretenen accedir al mateix recurs compartit simultàniament, típicament accés a memòria compartida. Aquesta interferència afegida pot suposar un incompliment dels requisits temporals, i per tant, la planificació no seria viable. En aquest treball es proposen noves metodologies i estratègies de planificació no convencionals per aportar solucions al problema de la interferència en sistemes multinucli. Aquestes metodologies i estratègies comprenen algorismes de planificació, algorismes d'assignació de tasques a nuclis, models temporals i anàlisis de planificabilitat. El resultat del treball realitzat s'ha publicat en diversos articles en revistes de l'àrea. En ells es presenten aquestes noves propostes que afronten els reptes de la planificació de tasques. En la majoria dels articles presentats l'estructura és similar: s'introdueix el context en el qual ens situem, es planteja la problemàtica existent, s'exposa una proposta per a solucionar o millorar els resultats de la planificació, després es realitza una experimentació per a avaluar de manera pràctica la metodologia proposada, s'analitzen els resultats obtinguts i finalment s'exposen unes conclusions sobre la proposta. Els resultats de les metodologies no convencionals proposades en els articles que conformen aquesta tesi mostren una millora del rendiment de les planificacions en comparació amb algorismes clàssics de l'àrea. Especialment, la millora es produeix en termes de disminució de la interferència produïda i millora de la taxa de planificabilitat. / [EN] Real-time systems are characterised by the demand for temporal constraints that guarantee acceptable operation and feasibility of a system. Especially, in hard real-time systems these temporal constraints must be respected. These systems are typically applied in areas such as aviation, railway safety, satellites and process control, among others. Therefore, a missed deadline in a hard-real time system can lead to a catastrophic failure. The scheduling of real-time systems is an area where various methodologies, heuristics and algorithms are studied and applied in an attempt to allocate the CPU resources without missing any deadline. The use of multicore computing systems is an increasingly recurrent option in hard real-time systems. This is due, among other reasons, to its high computational performance thanks to the ability to run multiple processes in parallel. On the other hand, multicore systems present a new problem, the contention that occurs due to the sharing of hardware resources. The source of this contention is the interference that sometimes happens between tasks allocated in different cores that try to access the same shared resource simultaneously, typically shared memory access. This added interference can lead to miss a deadline, and therefore, the scheduling would not be feasible. This paper proposes new non-conventional scheduling methodologies and strategies to provide solutions to the interference problem in multicore systems. These methodologies and strategies include scheduling algorithms, task allocation algorithms, temporal models and schedulability analysis. The results of this work have been published in several journal articles in the field. In these articles the new proposals are presented, they face the challenges of task scheduling. In the majority of these articles the structure is similar: the context is introduced, the existing problem is identified, a proposal to solve or improve the results of the scheduling is presented, then the proposed methodology is experimented in order to evaluate it in practical terms, the results obtained are analysed and finally conclusions about the proposal are expressed. The results of the non-conventional methodologies proposed in the articles that comprise this thesis show an improvement in the performance of the scheduling compared to classical algorithms in the area. In particular, the improvement is produced in terms of reducing the interference and a higher schedulability rate. / Esta tesis se ha realizado en el marco de dos proyectos de investigación de carácter nacional. Uno de ellos es el proyecto es PRECON-I4. Consiste en la búsqueda de sistemas informáticos predecibles y confiables para la industria 4.0. El otro proyecto es PRESECREL, que consiste en la búsqueda de modelos y plataformas para sistemas informáticos industriales predecibles, seguros y confiables. Tanto PRECON-I4 como PRESECREL son proyectos coordinados financiados por el Ministerio de Ciencia, Innovación y Universidades y los fondos FEDER (AEI/FEDER, UE). En ambos proyectos participa la Universidad Politécnica de Valencia, la Universidad de Cantabria y la Universidad Politécnica de Madrid. Además, en PRESECREL también participa IKERLAN S. COOP I.P. Además, parte de los resultados de esta tesis también han servido para validar la asignación de recursos temporales en sistemas críticos en el marco del proyecto METROPOLIS (PLEC2021-007609). / Aceituno Peinado, JM. (2024). Investigación de nuevas metodologías para la planificación de sistemas de tiempo real multinúcleo mediante técnicas no convencionales [Tesis doctoral]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/203212 / Compendio