A busca de soluções para a mobilidade urbana que minimizem a agressão do setor de tráfego e transportes ao meio ambiente está cada vez maior. Os veículos elétricos se posicionam como uma alternativa interessante, pois reduzem a emissão de gases poluentes na atmosfera, a poluição sonora e o consumo de petróleo. No entanto, sua limitada autonomia e a escassez de postos de recarga intimidam sua adoção. Por conta disso, políticas governamentais de incentivo têm sido desenvolvidas para a oferta de benefícios a quem optar por um veículo elétrico. Estima-se que dentro de poucas décadas toda a frota urbana será substituída por veículos dessa natureza. Por isso, é importante entender as mudanças no tempo de viagem e no consumo de energia oriundos da inclusão de veículos elétricos em cenários de tráfego. Trabalhos anteriores estudaram as diferenças entre os mecanismos internos de veículos convencionais e elétricos na determinação destas mudanças. Porém, dadas as características destes últimos, motoristas de veículos elétricos se preocupam com a economia de energia e podem optar por rotas diferentes. Logo, uma análise completa destes impactos deve considerar uma nova distribuição de tráfego. Este trabalho propõe um método biobjetivo de alocação de tráfego que considera o tempo de viagem e o consumo de energia para determinar a distribuição de veículos elétricos em cenários de tráfego urbano. Duas estratégias de distribuição de fluxo são propostas como mecanismos de escolha de rotas. Como parte da alocação de tráfego, é proposto um algoritmo biobjetivo de caminhos mínimos para veículos elétricos. A abordagem apresentada foi aplicada a três cenários distintos, onde percebeu-se uma diminuição de até 80% no consumo total de energia. Em cenários com congestionamento, observou-se um aumento de 10% no tempo de viagem. Já em cenários sem congestionamento o tempo de viagem diminuiu cerca de 2%. A recuperação de energia representa quase 6% da economia total dos veículos elétricos. Além disso, experimentos mostraram que investimentos na eficiência dos veículos elétricos podem resultar em uma economia de até 15% de energia. / The search for urban mobility solutions that minimize the aggression to the environment is increasing. Electric vehicles are an attractive alternative because they reduce greenhouse gas emissions, noise pollution, and oil consumption. However, their limited autonomy and the lack of charging stations restrict their popularization. Therefore, government incentive policies have been developed in order to offer benefits to those who choose an electric vehicle. It is estimated that the entire urban fleet will be replaced by these vehicles in a few decades. Therefore, it is important to understand the changes in travel time and energy consumption from the inclusion of electric vehicles in traffic scenarios. Previous works determined these changes by studying the differences between the internal engine of conventional and electric vehicles. However, given the characteristics of the latter, drivers of electric vehicles care about saving energy and may want to choose different routes. Thus, a complete analysis of these impacts should consider a redistribution of traffic. This work proposes a bi-objective traffic assignment method that considers the travel time and the energy consumption to determine the distribution of electric vehicles in urban traffic scenarios. We introduce two strategies for flow distribution as models of route choice. As a procedure of the traffic assignment method, we propose a bi-objective shortest path algorithm for electric vehicles. Our approach was applied to three different scenarios, which resulted in a decrease of up to 80% in total energy consumption. In congested scenarios, we observe an increase of about 10% in average travel time. In uncongested scenarios, travel time decreases about 2%. Energy recovery is almost 6% of the total savings of electric vehicles. Moreover, experiments have shown that investments in the efficiency of electric vehicles can result in up to 15% of energy savings.

For many decisions validation of their outcomes is invariably problematic to objectively assess. Therefore to aid analysis and validation of decision outcomes, approaches which provide improved traceability and more semantically meaningful measurements of the decision process are required. Hence, this research investigates traceability, transparency, interactivity and auditability to improve the decision making process. Approaches and evaluation measures are proposed to facilitate a richer decision making experience. Multi-Criteria Decision Analysis (MCDA) seeks to determine the suitability of alternatives of a goal with respect to multiple criteria. A key component of prominent MCDA methods is the concept of pairwise comparison. For a set of elements, pairwise comparison enables an accurate and transparent extraction and codification of a decision maker’s preferences, though facilitating a separation of concerns. From a set of pairwise comparisons, a ranking of the elements under consideration can be calculated. There are scenarios when a set of pairwise comparisons undergo alteration, both for individual and multiple decision makers. A set of measures of compromise are proposed to quantify the alteration that a set of pairwise comparisons undergo in such scenarios. The measures seek to provide a decision maker with meaningful knowledge regarding how their views have altered. A set of pairwise comparisons may be inconsistent. When inconsistency is present it adversely affects a ranking of the elements derived from the comparisons. Moreover inconsistency within pairwise comparisons used for consideration of more than a handful of elements is almost inevitable. Existing approaches that seek to alter a set of comparisons to reduce inconsistency lack traceability, flexibility, and specific consideration of alteration to the judgments in a way that is meaningful to a decision maker. An approach to inconsistency reduction is proposed that seeks to address these issues. For many decisions the opinions of multiple decision makers are utilized, either to avail of their combined expertise or to incorporate conflicting views. Aggregation of multiple decision makers’ pairwise companions seek to combine the views of the group into a single representation of views. An approach to group aggregation of pairwise comparisons is proposed that models compromise between the decision makers, facilitates decision maker constraints, considers inconsistency reduction during aggregation and dynamically incorporates decision maker weights of importance. With internet access becoming widespread being able to garner the views of a large group of decision makers’ views has become feasible. An approach to the aggregation of a large group of decision makers’ preferences is proposed. The approach facilitates understanding regarding both the agreement and conflict within the group during calculation of an overall group consensus. A Multi-Objective Optimisation Decision Software (MOODS) prototype tool has been developed that implements both the new measures of compromise and the proposed approaches to inconsistency reduction and group aggregation.

Geometrical parameterisation has an important role in the aircraft design process due to its impact on the computational efficiency and accuracy in evaluating different configurations. In the early design stages, an aircraft geometrical model is normally described parametrically with a small number of design parameters which allows fast computation. However, this provides only a course approximation which is generally limited to conventional configurations, where the models have already been validated. An efficient parameterisation method is therefore required to allow rapid synthesis and analysis of novel configurations. Within this context, the main objectives of this research are: 1) Develop an economical geometrical parameterisation method which captures sufficient detail suitable for aerodynamic analysis and optimisation in early design stage, and2) Close the gap between conceptual and preliminary design stages by bringing more detailed information earlier in the design process. Research efforts were initially focused on the parameterisation of two-dimensional curves by evaluating five widely-cited methods for airfoil against five desirable properties. Several metrics have been proposed to measure these properties, based on airfoil fitting tests. The comparison suggested that the Class-Shape Functions Transformation (CST) method is most suitable and therefore was chosen as the two-dimensional curve generation method. A set of blending functions have been introduced and combined with the two-dimensional curves to generate a three-dimensional surface. These surfaces form wing or body sections which are assembled together through a proposed joining algorithm. An object-oriented structure for aircraft components has also been proposed. This allows modelling of the main aircraft surfaces which contain sufficient level of accuracy while utilising a parsimonious number of intuitive design parameters.

A busca de soluções para a mobilidade urbana que minimizem a agressão do setor de tráfego e transportes ao meio ambiente está cada vez maior. Os veículos elétricos se posicionam como uma alternativa interessante, pois reduzem a emissão de gases poluentes na atmosfera, a poluição sonora e o consumo de petróleo. No entanto, sua limitada autonomia e a escassez de postos de recarga intimidam sua adoção. Por conta disso, políticas governamentais de incentivo têm sido desenvolvidas para a oferta de benefícios a quem optar por um veículo elétrico. Estima-se que dentro de poucas décadas toda a frota urbana será substituída por veículos dessa natureza. Por isso, é importante entender as mudanças no tempo de viagem e no consumo de energia oriundos da inclusão de veículos elétricos em cenários de tráfego. Trabalhos anteriores estudaram as diferenças entre os mecanismos internos de veículos convencionais e elétricos na determinação destas mudanças. Porém, dadas as características destes últimos, motoristas de veículos elétricos se preocupam com a economia de energia e podem optar por rotas diferentes. Logo, uma análise completa destes impactos deve considerar uma nova distribuição de tráfego. Este trabalho propõe um método biobjetivo de alocação de tráfego que considera o tempo de viagem e o consumo de energia para determinar a distribuição de veículos elétricos em cenários de tráfego urbano. Duas estratégias de distribuição de fluxo são propostas como mecanismos de escolha de rotas. Como parte da alocação de tráfego, é proposto um algoritmo biobjetivo de caminhos mínimos para veículos elétricos. A abordagem apresentada foi aplicada a três cenários distintos, onde percebeu-se uma diminuição de até 80% no consumo total de energia. Em cenários com congestionamento, observou-se um aumento de 10% no tempo de viagem. Já em cenários sem congestionamento o tempo de viagem diminuiu cerca de 2%. A recuperação de energia representa quase 6% da economia total dos veículos elétricos. Além disso, experimentos mostraram que investimentos na eficiência dos veículos elétricos podem resultar em uma economia de até 15% de energia. / The search for urban mobility solutions that minimize the aggression to the environment is increasing. Electric vehicles are an attractive alternative because they reduce greenhouse gas emissions, noise pollution, and oil consumption. However, their limited autonomy and the lack of charging stations restrict their popularization. Therefore, government incentive policies have been developed in order to offer benefits to those who choose an electric vehicle. It is estimated that the entire urban fleet will be replaced by these vehicles in a few decades. Therefore, it is important to understand the changes in travel time and energy consumption from the inclusion of electric vehicles in traffic scenarios. Previous works determined these changes by studying the differences between the internal engine of conventional and electric vehicles. However, given the characteristics of the latter, drivers of electric vehicles care about saving energy and may want to choose different routes. Thus, a complete analysis of these impacts should consider a redistribution of traffic. This work proposes a bi-objective traffic assignment method that considers the travel time and the energy consumption to determine the distribution of electric vehicles in urban traffic scenarios. We introduce two strategies for flow distribution as models of route choice. As a procedure of the traffic assignment method, we propose a bi-objective shortest path algorithm for electric vehicles. Our approach was applied to three different scenarios, which resulted in a decrease of up to 80% in total energy consumption. In congested scenarios, we observe an increase of about 10% in average travel time. In uncongested scenarios, travel time decreases about 2%. Energy recovery is almost 6% of the total savings of electric vehicles. Moreover, experiments have shown that investments in the efficiency of electric vehicles can result in up to 15% of energy savings.

Evolutionary Algorithms (EAs) have been widely used for the optimisation of both theoretical and real-world non-linear problems, although such optimisation methods have found reasonably limited utilisation in fields outside of the academic domain. While the causality of this limited uptake in non-academic fields falls outside the scope of this thesis, the core focus of this research remains strongly influenced by the notions of solution feasibility and making optimisation methods more accessible for engineers, both factors attributed to low EA adoption rates in the commercial space. This thesis focuses on the application of bespoke heuristic methods to the field of water distribution system optimisation. Water distribution systems are complex entities that are difficult to model and optimise as they consist of many interacting components each with a set of considerations to address, hence it is important for the engineer to understand and assess the behaviour of the system to enable its effective design and optimisation. The primary goal of this research is to assess the impact that incorporating water systems knowledge into an evolution algorithm has on algorithm performance when applied to water distribution network optimisation problems. This thesis describes the development of two heuristics influenced by the practices of water systems engineers when designing water distribution networks with the view to increasing an algorithm’s performance and resultant solution feasibility. By utilising heuristics based on engineering design principles and integrating them into existing EAs, it is found that both engineering feasibility and general algorithmic performance can be notably improved. Firstly the heuristics are applied to a standard single-objective EA and then to a multi-objective genetic algorithm. The algorithms are assessed on a number of water distribution network benchmarks from the literature including real-world based, large scale systems and compared to the standard variants of the algorithms. Following this, a set of extensive experiments are conducted to explore how the inclusion of water systems knowledge impacts the sensitivity of an evolutionary algorithm to parameter variance. It was found that the performance of both engineering inspired algorithms were less sensitive to parameter change than the standard genetic algorithm variant meaning that non-experts in the field of meta-heuristics will potentially be able to get much better performance out of the engineering heuristic based algorithms without the need for specialist evolutionary algorithm knowledge. In addition this research explores the notion that visualisation techniques can provide water system engineers with a greater insight into the operation and behaviour of an evolutionary algorithm. The final section of this thesis presents a novel three-dimensional representation of pipe based water systems and demonstrates a range of innovative methods to convey information to the user. The interactive visualisation system presented not only allows the engineer to visualise the various parameters of a network but also allows the user to observe the behaviour and progress of an iterative optimisation method. Examples of the combination of the interactive visualisation system and the EAs developed in this work are shown to enable the user to track and visualise the actions of the algorithm. The visualisation aggregates changes to the network over an EA run and grants significant insight into the operations of an EA as it is optimising a network. The research presented in this thesis demonstrates the effectiveness of integrating water system engineering expertise into evolutionary based optimisation methods. Not only is solution quality improved over standard methods utilising these new heuristic techniques, but the potential for greater interaction between engineer, problem and optimiser has been established.

General Purpose computing on Graphic Processing Unit (GPGPU) gained atten- tion in 2006 with NVIDIA’s first Tesla Graphic Processing Unit (GPU) which could perform high performance computing. Ever since, researchers have been working on software and hardware techniques to improve the efficiency of running general purpose applications on GPUs. The efficiency can be evaluated using metrics such as energy consumption and throughput and is defined based on the requirements of the system. I define it as obtaining high throughput by consuming minimum energy. GPUs are equipped with a large number of processing units, a high memory bandwidth, and different types of on-chip memory and caches. To run efficiently, an application should maximize the utilization of GPU resources. Therefore, a good correspondence between the computing and memory resources of the GPU and those of application is critical. Since an application’s requirements are fixed, the GPU’s configuration should be tuned to these requirements. Having models to study and predict the power consumption and throughput of running a GPGPU application on a given GPU configuration can help achieve high efficiency. The main purpose of this dissertation is to find a GPU configuration that best matches the requirements of a given application. I propose three models that predict a GPU configuration that runs an application with maximum throughput while consuming minimum energy. The first model is a fast, low-cost and effective approach to optimize resource allocation in future GPUs. The model finds the optimal GPU configuration for different available chip real-estate budgets . The second model considers the power consumption and throughput of a GPGPU application as functions of the GPU configuration parameters. The proposed model accurately predicts the power consumption and throughput of the modeled GPGPU application. I then propose to accelerate the process of building the model using optimization techniques and quantum annealing. I use the proposed model to explore the GPU configuration space of different applications. I apply multiobjective optimization technique to find the configurations that offer minimum power consumption and maximum throughput. Finally, using clustering and classification techniques, I develop models to re- late the power consumption and throughput of GPGPU applications to the code attributes. Both models could accurately predict the optimum configuration for any given GPGPU application. To build these models I have used different machine learning techniques and optimization methods such as Pareto Front and Knapsack optimization problem. I validated the model produced results with simulation results and showed that the models make accurate predictions. These models could be used by GPGPU programmers to identify the architectural parameters that most affect an application’s power consumption and throughput. This information could be translated into software optimization opportunities. Also, these models can be implemented as part of a compiler to help it to make the best optimization decisions. Moreover, GPU manufacturers could gain insight on architectural parameters which would profit GPGPU applications the most in terms of power and performance and hence invest on these. / Graduate

Orientador: José Roberto Sanches Mantovani / Resumo: O planejamento de sistemas de distribuição consiste em encontrar uma configuração otimizada, a um baixo custo, que permita manter a qualidade e confiabilidade do fornecimento de energia. Fontes de Geração Distribuída (GD) quando inseridas na rede alteram as suas características físicas e operacionais e tornam o problema de planejamento de curto prazo mais complexo para ser resolvido. Portanto, é importante desenvolver ferramentas computacionais eficientes para reduzir custos e o tempo na tomada de decisão para o setor de planejamento das empresas, indicando onde, quando e quais os tipos de componentes devem ser instalados e/ou substituídos nas redes de distribuição na presença de fontes de GD. Neste trabalho propõe-se uma metodologia para o planejamento de curto prazo para alocação das fontes de GD do tipo eólica (considerando as incertezas presentes neste tipo de fonte primária de energia), alocação de bancos de capacitores, dispositivos de proteção e controle, bem como a possibilidade de recondutoramento e troca de estruturas da rede de distribuição, mantendo-se os índices de qualidade para o fornecimento de energia dentro dos padrões estabelecidos pela agência reguladora. O problema de planejamento de curto prazo é formulado como um modelo de programação inteira multiobjetivo, o qual consiste em minimizar os custos de investimento e perdas técnicas na rede (energia não suprida e perdas ôhmicas nos condutores) e está sujeito a restrições físicas, econômicas e operacionais. ... (Resumo completo, clicar acesso eletrônico abaixo) / Doutor

Orientador: Antonio Roberto Balbo / Banca: Aparecido Nilceu Marana / Banca: Helenice de Oliveira F. Silva / Resumo: O Brasil é o maior produtor de cana-de-açúcar do mundo. Mas, existe uma grande preocupação com o sistema de colheita utilizado nesta cultura, pois é prática comum a colheita manual com a pré-queima do palhiço. Autoridades brasileiras têm aprovado leis proibindo a queimada nos canaviais. Entretanto, a colheita mecanizada, com cana-de-açúcar crua, cria novos problemas com a permanência do resíduo no solo. Assim, muitos estudos têm sido propostos para o uso deste resíduo para geração de energia. A maior dificuldade no uso desta biomassa está no custo de coletar e transferir o resíduo, do campo para o centro de processamento. Para análise da viabilidade deste sistema há a necessidade de um estudo do balanço de energia envolvido, devido ao grande número de maquinário utilizado no processo. O objetivo deste trabalho é investigar modelos matemáticos que auxiliem na escolha das variedades de cana-de-açúcar a serem implantadas, de forma a minimizar o custo de coleta da biomassa residual e avaliar o balanço de energia gerado, adicionado restrições sobre a produção de sacarose e limitações da área para plantio e considerando as distâncias entre os talhões e o centro de processamento. Para isto, técnicas de programação linear e inteira 0-1 foram utilizadas. A busca de soluções para problemas de programação inteira com grande número de variáveis e restrições é de difícil resolução, mas os resultados apresentados mostram que a utilização d eum procedimento híbrido envolvendo o método Primal-Dual de Pontos Interiores e o método Branch and Bound promove uma boa performance computacional, apresentando soluções confiáveis. Assim, o uso deste procedimento é viável para o auxílio na seleção de variedades, otimizando o custo do uso da biomassa residual de colheita ou o balanço de geração de energia / Abstract: It is that Brazil is the world's largest sugar cane producer. But there is great concern about the harvesting system used in this culture, because it is a common practice to burn the straw before the barvest. Brazilian authorities have approved laws prohibiting the burning in the sugar cane fields. However, with mechanized harvesting of sugar cane raw creates new problems with the accumulation of the waste biomass in the ground. Many studies have been proposed to use this waste for energy generation. The greatest difficulty to use this biomass is in the cost of collect and transfer the residues from the field to the the processing center. To analyze the feasibility of this system, it is necessary a study of the involved energy balance, because of the large number of machines in the process. The aim of this study is to investigate mathematical models that help on choosing varieties of sugar cane to be planted, to minimize the cost of collect of residual biomass and to analyze the balance of power generated, adding restrictions on the production on the production of sucrose and limitations on the area for planting and considering the distances among the plots the processing center. To this, techniques of 0-1 integer linear programming were used. The search for solutions to integer programming problems with many variables and constraints its very hard, but the results show that the use of a hybrid procedure involving the Primal-Dual Interior Point method and Branch and Bound method promotes good performance computing, with reliable solutions. Thus, the use of this procedure is feasible to help on select of varieties, optimizing the cost of collect of the waste biomass or the the balance of power generation / Mestre

Resumo: Este trabalho apresenta uma metodologia composta de duas fases para resolver problemas de otimização com restrições usando uma estratégia multiobjetivo. Na primeira fase, o esforço concentra-se em encontrar, pelo menos, uma solução factível, descartando completamente a função objetivo. Na segunda fase, aborda-se o problema como biobjetivo, onde se busca a otimização da função objetivo original e maximizar o cumprimento das restrições. Na fase um propõe-se uma estratégia baseada na diminuição progressiva da tolerância de aceitação das restrições complexas para encontrar soluções factíveis. O desempenho do algoritmo é validado através de 11 casos testes bastantes conhecidos na literatura especializada. / Abstract: This work presents a two-phase framework for solving constrained optimization problems using a multi-objective strategy. In the first phase, the objective function is completely disregarded and entire search effort is directed toward finding a single feasible solution. In the second phase, the problem is treated as a bi-objective optimization problem, where the technique converts constrained optimization to a two-objective optimization: one is the original objective function; the other is the degree function violating the constraints. In the first phase a methodology based on progressive decrease of the tolerance of acceptance of complex constrains is proposed in order to find feasible solutions. The approach is tested on 11 well-know benchmark functions. / Orientador: Rubén Augusto Romero Lázaro / Coorientador: José Roberto Sanches Mantovani / Banca: Antonio Padilha Feltrin / Banca: Marcos Julio Rider Flores / Mestre

Submitted by RODRIGO RODRIGUES DA CUNHA PAIVA null (rodrigorcp@hotmail.com) on 2017-01-27T17:19:53Z No. of bitstreams: 1 Tese_Rodrigo_Paiva.pdf: 2424828 bytes, checksum: 304f20862a283a2556f7f0f3576eb60e (MD5) / Approved for entry into archive by LUIZA DE MENEZES ROMANETTO (luizamenezes@reitoria.unesp.br) on 2017-01-31T15:33:23Z (GMT) No. of bitstreams: 1 paiva_rrc_dr_ilha.pdf: 2424828 bytes, checksum: 304f20862a283a2556f7f0f3576eb60e (MD5) / Made available in DSpace on 2017-01-31T15:33:24Z (GMT). No. of bitstreams: 1 paiva_rrc_dr_ilha.pdf: 2424828 bytes, checksum: 304f20862a283a2556f7f0f3576eb60e (MD5) Previous issue date: 2016-12-09 / O planejamento de sistemas de distribuição consiste em encontrar uma configuração otimizada, a um baixo custo, que permita manter a qualidade e confiabilidade do fornecimento de energia. Fontes de Geração Distribuída (GD) quando inseridas na rede alteram as suas características físicas e operacionais e tornam o problema de planejamento de curto prazo mais complexo para ser resolvido. Portanto, é importante desenvolver ferramentas computacionais eficientes para reduzir custos e o tempo na tomada de decisão para o setor de planejamento das empresas, indicando onde, quando e quais os tipos de componentes devem ser instalados e/ou substituídos nas redes de distribuição na presença de fontes de GD. Neste trabalho propõe-se uma metodologia para o planejamento de curto prazo para alocação das fontes de GD do tipo eólica (considerando as incertezas presentes neste tipo de fonte primária de energia), alocação de bancos de capacitores, dispositivos de proteção e controle, bem como a possibilidade de recondutoramento e troca de estruturas da rede de distribuição, mantendo-se os índices de qualidade para o fornecimento de energia dentro dos padrões estabelecidos pela agência reguladora. O problema de planejamento de curto prazo é formulado como um modelo de programação inteira multiobjetivo, o qual consiste em minimizar os custos de investimento e perdas técnicas na rede (energia não suprida e perdas ôhmicas nos condutores) e está sujeito a restrições físicas, econômicas e operacionais. Este problema é resolvido através de um algoritmo genético multiobjetivo baseado no Non-dominated Sorting Genetic Algorithm (NSGA-II), e a metodologia proposta e implementada foi testada em um sistema de distribuição real de 135 barras, e os resultados obtidos mostram eficácia e robustez da metodologia proposta. / The planning of distribution systems consists of finding an optimized configuration, at a low cost, which allows to maintain the quality and reliability of the power supply. Distributed Generation (DG) sources, when inserted into the network, change their physical and operational characteristics and make the short-term planning problem more complex to be solved. Hence, it is important to develop efficient computational tools aiming to reduce costs and the impact of time limits on decision making for the utility planning sector, indicating where, when and what types of components should be installed and / or replaced in distribution networks in the presence of sources. Accordingly, this work proposes a new methodology for the short-term planning which considers the allocation of wind-type DG sources (considering the uncertainties present in this type of primary energy source capacitor banks, protection and control devices, as well as the possibility of reconnecting and exchanging structures of the distribution network, maintaining the quality indices for the supply of energy within the standards established by the regulatory agency. The short-term planning problem is formulated as an integer multiobjective programming model, which consists of minimizing the investment costs and technical losses in the network (energy not supplied and ohmic losses in the conductors) by subjecting to physical, economic and operational constraints. Thus, this problem is solved here by using a multiobjective genetic algorithm based on the Non-dominated Sorting Genetic Algorithm (NSGA-II). In order to testthe proposed methodology, a real distribution system, containing 135-buses, is implemented and analyzed. In short, the obtained results demonstrate its efficacy and robustness in light of the proposed methodology.