Matheuristics for robust optimization: application to real-world problems

In the field of optimization, the perspective that the problem data are subject to uncertainty is gaining more and more interest. The uncertainty in an optimization problem represents the measurement errors during the phase of collecting data, or unforeseen changes in the environment while implementing the optimal solution in practice. When the uncertainty is ignored, an optimal solution according to the mathematical model can turn out to be far from optimal, or even infeasible in reality. Robust optimization is an umbrella term for mathematical modelling methodologies focused on finding solutions that are reliable against the data perturbations caused by the uncertainty. Among the relatively more recent robust optimization methodologies, an important concept studied is the degree of conservativeness, which can be explained as the amount of targeted reliability against the uncertainty while looking for a solution. Because the reliability and solution cost usually end up being conflicting objectives, it is important for the decision maker to be able to configure the conservativeness degree, so that the desired balance between the cost and reliability can be obtained, and the most practical solution can be found for the problem at hand. The robust optimization methodologies are typically proposed within the framework of mathematical programming (i.e. linear programming, integer programming). Thanks to the nature of mathematical programming, these methodologies can find the exact optimum, according to the various solution evaluation perspectives they have. However, dependence on mathematical programming might also mean that such methodologies will require too much memory from the computer, and also too much execution time, when large-scale optimization problems are considered. A common strategy to avoid the big memory and execution time requirements of mathematical programming is to use metaheuristic optimization algorithms for solving large problem instances.In this research, we propose an approach for solving medium-to-large-sized robust optimization problem instances. The methodology we propose is a matheuristic (i.e. a hybridization of mathematical programming and metaheuristic). In the matheuristic approach we propose, the mathematical programming part handles the uncertainty, and the metaheuristic part handles the exploration of the solution space. Since the exploration of the solution space is entrusted onto the metaheuristic search, we can obtain practical near-optimal solutions while avoiding the big memory and time requirements that might be brought by pure mathematical programming methods. The mathematical programming part is used for making the metaheuristic favor the solutions which have more protections against the uncertainty. Another important characteristic of the methodology we propose is concurrency with information exchange: we concurrently execute multiple processes of the matheuristic algorithm, each process taking the uncertainty into account with a different degree of conservativeness. During the execution, these processes exchange their best solutions. So, if a process is stuck on a bad solution, it can realize that there is a better solution available thanks to the information exchange, and it can get unstuck. In the end, the solutions of these processes are collected into a solution pool. This solution pool provides the decision maker with alternative solutions with different costs and conservativeness degrees. Having a solution pool available at the end, the decision maker can make the most practical choice according to the problem at hand. In this thesis, we first discuss our studies in the field of robust optimization: a heuristic approach for solving a minimum power multicasting problem in wireless actuator networks under actuator distance uncertainty, and a linear programming approach for solving an aggregate blending problem in the construction industry, where the amounts of components found in aggregates are subject to uncertainty. These studies demonstrate the usage of mathematical programming for handling the uncertainty. We then discuss our studies in the field of matheuristics: a matheuristic approach for solving a large-scale energy management problem, and then a matheuristic approach for solving large instances of minimum power multicasting problem. In these studies, the usage of metaheuristics for handling the large problem instances is emphasized. In our study of solving minimum power multicasting problem, we also incorporate the mechanism of information exchange between different solvers. Later, we discuss the main matheuristic approach that we propose in this thesis. We first apply our matheuristic approach on a well-known combinatorial optimization problem: capacitated vehicle routing problem, by using an ant colony optimization as the metaheuristic part. Finally, we discuss the generality of the methodology that we propose: we suggest that it can be used as a general framework on various combinatorial optimization problems, by choosing the most appropriate metaheuristic algorithm according to the nature of the problem

Usage Driven Design of Power System and Multi-criteria Route Planning for Eco-Urban Electric Cars

Eco-urban electric cars (EC) are superior to conventional cars in terms of the operation cost and carbon footprint. However, the performance of EC in terms of their maximum speed and power, initial and maintenance cost and reliability in the available power is lower than conventional cars. The reliability in available energy can be viewed as the main concerns when comparing EC to conventional cars. Reliability in available energy is highly dependent upon the efficiency of the power system as well as the type and size of batteries. Type and size of batteries have a significant effect on the maintenance cost as well as the initial cost. This thesis is focused on two aspects of the research in electric cars, namely, (i) selection and size optimisation of components, and (ii) improving the reliability of the available energy. Traditionally, a robust design approach is adopted in design of the power system of cars. This is mainly aimed at providing the user with the luxury of using the car wherever there is a suitable road and whenever they want to use the car. This flexibility, however, comes with the price of heavier and more expensive power systems. By incorporating data on the dominant usage of an EC and adopting a deterministic design and optimisation method more cost-effective power systems, more compatible with the usage can be obtained. In this study, a power system simulation tool is developed. Using the simulation tool, the performance of the power system components can be analysed for different usage scenarios. Case studies are conducted. Each case is based on a dominant usage defined for a two-person EC driven in Kayseri city in Turkey. For each case, the best power system configuration is obtained. Another original contribution of this thesis is in the context of the reliability of the available energy, by providing a decision support system - a route planning advisor - that helps the user to select the most suitable route in terms of a variety of criteria both conventional, such as travelling time and travelling distance, as well as EC-related such as, available power, vicinity to a charging station. The optimiser of the developed multi criteria route planning advisor (MCRPA) tool is based on a robust hybrid Dijkstra - A* - NSGA-II algorithm. MCRPA incorporates information on EC characteristics (such as power system, aerodynamic shape, weight), city characteristics (current traffic flows, road types, speed limits, altitude, whether conditions), and city charging stations characteristics (capacity, charging level, crowding density). Carrying out case studies, the efficiency and performance of the MCRPA is evaluated

Data-driven flight path rerouting during adverse weather: Design and development of a passenger-centric model and framework for alternative flight path generation using nature inspired techniques

A major factor that negatively impacts flight operations globally is adverse weather. To reduce the impact of adverse weather, avoidance procedures such as finding an alternative flight path can usually be carried out. However, such procedures usually introduce extra costs such as flight delay. Hence, there exists a need for alternative flight paths that efficiently avoid adverse weather regions while minimising costs. Existing weather avoidance methods used techniques, such as Dijkstra’s and artificial potential field algorithms that do not scale adequately and have poor real time performance. They do not adequately consider the impact of weather and its avoidance on passengers. The contributions of this work include a new development of an improved integrated model for weather avoidance, that addressed the impact of weather on passengers by defining a corresponding cost metric. The model simultaneously considered other costs such as flight delay and fuel burn costs. A genetic algorithm (GA)-based rerouting technique that generates optimised alternative flight paths was proposed. The technique used a modified mutation strategy to improve global search. A discrete firefly algorithm-based rerouting method was also developed to improve rerouting efficiency. A data framework and simulation platform that integrated aeronautical, weather and flight data into the avoidance process was developed. Results show that the developed algorithms and model produced flight paths that had lower total costs compared with existing techniques. The proposed algorithms had adequate rerouting performance in complex airspace scenarios. The developed system also adequately avoided the paths of multiple aircraft in the considered airspace

Predição da estrutura de proteínas off-lattice usando evolução diferencial multiobjetivo adaptativa

Protein Structure Prediction (PSP) can be considered one of the most challenging problems in Bioinformatics nowadays. When a protein is in its conformation state, the free energy is minimized. Evaluation of protein conformation is generally performed based on two values of the estimated free energy, i.e., those provided by intra and intermolecular interactions among atoms. Some recent experimental studies show that these interactions are in conflit, justifying the use of multiobjective optimization approaches to solve PSP. In this case, the energy optimization is performed separately, different from the mono-objective optimization which considers the sum of free energy. Differential Evolution (DE) is a technique based on Evolutionary Computation and represents an interesting alternative to solve multiobjective PSP. In this work, an optimizer based on DE is proposed to solve the PSP problem. Due to the great number of parameters, typical for evolutionary algorithms, this work also investigates adaptive parameters strategies. In experiments, a simple approach based on ED is evaluated for PSP. An evolution for this method, which incorporates concepts of the MOEA/D algorithm and parameter adaptation techniques is tested for a set of benchmarks in the multiobjective optimization context. The preliminary results for PSP (for six real proteins) are promising and those obtained for the benchmark set stands the proposed approach as a candidate to the state-of-art for multiobjective optimization.Fundação AraucáriaA Predição da Estrutura das Proteínas, conhecida como PSP (Protein Structure Prediction) pode ser considerada um dos problemas mais desafiadores da Bioinformática atualmente. Quando uma proteína está em seu estado de conformação nativa, a energia livre tende para um valor mínimo. Em geral, a predição da conformação de uma proteína por métodos computacionais é feita pela estimativa de dois valores de energia livre que são provenientes das interações intra e intermoleculares entre os átomos. Alguns estudos recentes indicam que estas interações estão em conflito, justificando o uso de abordagens baseadas em otimização multiobjetivo para a solução do PSP. Neste caso, a otimização destas energias é realizada separadamente, diferente da formulação mono-objetivo que considera a soma das energias. A Evolução Diferencial (ED) é uma técnica baseada em Computação Evolucionária e representa uma alternativa interessante para abordar o PSP. Este trabalho busca desenvolver um otimizador baseado no algoritmo de ED para o problema da Predição da Estrutura de Proteínas multiobjetivo. Este trabalho investiga ainda estratégias baseadas em parâmetros adaptativos para a evolução diferencial. Nicialmente avalia-se uma abordagem simples baseada em ED proposta para a solução do PSP. Uma evolução deste método que incorpora conceitos do algoritmo MOEA/D e adaptação de parâmetros é testada em um conjunto de problemas benchmark de otimização multiobjetivo. Os resultados preliminares obtidos para o PSP (para seis proteínas reais) são promissores e aqueles obtidos para o conjunto benchmark colocam a abordagem proposta como candidata para otimização multiobjetivo

Predição da estrutura de proteínas off-lattice usando evolução diferencial multiobjetivo adaptativa

Protein Structure Prediction (PSP) can be considered one of the most challenging problems in Bioinformatics nowadays. When a protein is in its conformation state, the free energy is minimized. Evaluation of protein conformation is generally performed based on two values of the estimated free energy, i.e., those provided by intra and intermolecular interactions among atoms. Some recent experimental studies show that these interactions are in conflit, justifying the use of multiobjective optimization approaches to solve PSP. In this case, the energy optimization is performed separately, different from the mono-objective optimization which considers the sum of free energy. Differential Evolution (DE) is a technique based on Evolutionary Computation and represents an interesting alternative to solve multiobjective PSP. In this work, an optimizer based on DE is proposed to solve the PSP problem. Due to the great number of parameters, typical for evolutionary algorithms, this work also investigates adaptive parameters strategies. In experiments, a simple approach based on ED is evaluated for PSP. An evolution for this method, which incorporates concepts of the MOEA/D algorithm and parameter adaptation techniques is tested for a set of benchmarks in the multiobjective optimization context. The preliminary results for PSP (for six real proteins) are promising and those obtained for the benchmark set stands the proposed approach as a candidate to the state-of-art for multiobjective optimization.Fundação AraucáriaA Predição da Estrutura das Proteínas, conhecida como PSP (Protein Structure Prediction) pode ser considerada um dos problemas mais desafiadores da Bioinformática atualmente. Quando uma proteína está em seu estado de conformação nativa, a energia livre tende para um valor mínimo. Em geral, a predição da conformação de uma proteína por métodos computacionais é feita pela estimativa de dois valores de energia livre que são provenientes das interações intra e intermoleculares entre os átomos. Alguns estudos recentes indicam que estas interações estão em conflito, justificando o uso de abordagens baseadas em otimização multiobjetivo para a solução do PSP. Neste caso, a otimização destas energias é realizada separadamente, diferente da formulação mono-objetivo que considera a soma das energias. A Evolução Diferencial (ED) é uma técnica baseada em Computação Evolucionária e representa uma alternativa interessante para abordar o PSP. Este trabalho busca desenvolver um otimizador baseado no algoritmo de ED para o problema da Predição da Estrutura de Proteínas multiobjetivo. Este trabalho investiga ainda estratégias baseadas em parâmetros adaptativos para a evolução diferencial. Nicialmente avalia-se uma abordagem simples baseada em ED proposta para a solução do PSP. Uma evolução deste método que incorpora conceitos do algoritmo MOEA/D e adaptação de parâmetros é testada em um conjunto de problemas benchmark de otimização multiobjetivo. Os resultados preliminares obtidos para o PSP (para seis proteínas reais) são promissores e aqueles obtidos para o conjunto benchmark colocam a abordagem proposta como candidata para otimização multiobjetivo

Systematic Approaches for Telemedicine and Data Coordination for COVID-19 in Baja California, Mexico

Conference proceedings info: ICICT 2023: 2023 The 6th International Conference on Information and Computer Technologies Raleigh, HI, United States, March 24-26, 2023 Pages 529-542We provide a model for systematic implementation of telemedicine within a large evaluation center for COVID-19 in the area of Baja California, Mexico. Our model is based on human-centric design factors and cross disciplinary collaborations for scalable data-driven enablement of smartphone, cellular, and video Teleconsul-tation technologies to link hospitals, clinics, and emergency medical services for point-of-care assessments of COVID testing, and for subsequent treatment and quar-antine decisions. A multidisciplinary team was rapidly created, in cooperation with different institutions, including: the Autonomous University of Baja California, the Ministry of Health, the Command, Communication and Computer Control Center of the Ministry of the State of Baja California (C4), Colleges of Medicine, and the College of Psychologists. Our objective is to provide information to the public and to evaluate COVID-19 in real time and to track, regional, municipal, and state-wide data in real time that informs supply chains and resource allocation with the anticipation of a surge in COVID-19 cases. RESUMEN Proporcionamos un modelo para la implementación sistemática de la telemedicina dentro de un gran centro de evaluación de COVID-19 en el área de Baja California, México. Nuestro modelo se basa en factores de diseño centrados en el ser humano y colaboraciones interdisciplinarias para la habilitación escalable basada en datos de tecnologías de teleconsulta de teléfonos inteligentes, celulares y video para vincular hospitales, clínicas y servicios médicos de emergencia para evaluaciones de COVID en el punto de atención. pruebas, y para el tratamiento posterior y decisiones de cuarentena. Rápidamente se creó un equipo multidisciplinario, en cooperación con diferentes instituciones, entre ellas: la Universidad Autónoma de Baja California, la Secretaría de Salud, el Centro de Comando, Comunicaciones y Control Informático. de la Secretaría del Estado de Baja California (C4), Facultades de Medicina y Colegio de Psicólogos. Nuestro objetivo es proporcionar información al público y evaluar COVID-19 en tiempo real y rastrear datos regionales, municipales y estatales en tiempo real que informan las cadenas de suministro y la asignación de recursos con la anticipación de un aumento de COVID-19. 19 casos.ICICT 2023: 2023 The 6th International Conference on Information and Computer Technologieshttps://doi.org/10.1007/978-981-99-3236-

MS FT-2-2 7 Orthogonal polynomials and quadrature: Theory, computation, and applications

Quadrature rules find many applications in science and engineering. Their analysis is a classical area of applied mathematics and continues to attract considerable attention. This seminar brings together speakers with expertise in a large variety of quadrature rules. It is the aim of the seminar to provide an overview of recent developments in the analysis of quadrature rules. The computation of error estimates and novel applications also are described

Generalized averaged Gaussian quadrature and applications

A simple numerical method for constructing the optimal generalized averaged Gaussian quadrature formulas will be presented. These formulas exist in many cases in which real positive GaussKronrod formulas do not exist, and can be used as an adequate alternative in order to estimate the error of a Gaussian rule. We also investigate the conditions under which the optimal averaged Gaussian quadrature formulas and their truncated variants are internal