A Survey of Evolutionary Continuous Dynamic Optimization Over Two Decades:Part B

Many real-world optimization problems are dynamic. The field of dynamic optimization deals with such problems where the search space changes over time. In this two-part paper, we present a comprehensive survey of the research in evolutionary dynamic optimization for single-objective unconstrained continuous problems over the last two decades. In Part A of this survey, we propose a new taxonomy for the components of dynamic optimization algorithms, namely, convergence detection, change detection, explicit archiving, diversity control, and population division and management. In comparison to the existing taxonomies, the proposed taxonomy covers some additional important components, such as convergence detection and computational resource allocation. Moreover, we significantly expand and improve the classifications of diversity control and multi-population methods, which are under-represented in the existing taxonomies. We then provide detailed technical descriptions and analysis of different components according to the suggested taxonomy. Part B of this survey provides an indepth analysis of the most commonly used benchmark problems, performance analysis methods, static optimization algorithms used as the optimization components in the dynamic optimization algorithms, and dynamic real-world applications. Finally, several opportunities for future work are pointed out

Reactive scheduling to treat disruptive events in the MRCPSP

Esta tesis se centra en diseñar y desarrollar una metodología para abordar el MRCPSP con diversas funciones objetivo y diferentes tipos de interrupciones. En esta tesis se exploran el MRCPSP con dos funciones objetivo, a saber: (1) minimizar la duración del proyecto y (2) maximizar el valor presente neto del proyecto. Luego, se tiene en cuenta dos tipos diferentes de interrupciones, (a) interrupción de duración, e (b) interrupción de recurso renovable. Para resolver el MRCPSP, en esta tesis se proponen tres estrategias metaheurísticas: (1) algoritmo memético para minimizar la duración del proyecto, (2) algoritmo adaptativo de forrajeo bacteriano para maximizar el valor presente neto del proyecto y (3) algoritmo de optimización multiobjetivo de forrajeo bacteriano (MBFO) para resolver el MRCPSP con eventos de interrupción. Para juzgar el rendimiento del algoritmo memético y de forrajeo bacteriano propuestos, se ha llevado a cabo un extenso análisis basado en diseño factorial y diseño Taguchi para controlar y optimizar los parámetros del algoritmo. Además se han puesto a prueba resolviendo las instancias de los conjuntos más importantes en la literatura: PSPLIB (10,12,14,16,18,20 y 30 actividades) y MMLIB (50 y 100 actividades). También se ha demostrado la superioridad de los algoritmos metaheurísticos propuestos sobre otros enfoques heurísticos y metaheurísticos del estado del arte. A partir de los estudios experimentales se ha ajustado la MBFO, utilizando un caso de estudio.DoctoradoDoctor en Ingeniería Industria

Evolutionary Algorithms in Engineering Design Optimization

Evolutionary algorithms (EAs) are population-based global optimizers, which, due to their characteristics, have allowed us to solve, in a straightforward way, many real world optimization problems in the last three decades, particularly in engineering fields. Their main advantages are the following: they do not require any requisite to the objective/fitness evaluation function (continuity, derivability, convexity, etc.); they are not limited by the appearance of discrete and/or mixed variables or by the requirement of uncertainty quantification in the search. Moreover, they can deal with more than one objective function simultaneously through the use of evolutionary multi-objective optimization algorithms. This set of advantages, and the continuously increased computing capability of modern computers, has enhanced their application in research and industry. From the application point of view, in this Special Issue, all engineering fields are welcomed, such as aerospace and aeronautical, biomedical, civil, chemical and materials science, electronic and telecommunications, energy and electrical, manufacturing, logistics and transportation, mechanical, naval architecture, reliability, robotics, structural, etc. Within the EA field, the integration of innovative and improvement aspects in the algorithms for solving real world engineering design problems, in the abovementioned application fields, are welcomed and encouraged, such as the following: parallel EAs, surrogate modelling, hybridization with other optimization techniques, multi-objective and many-objective optimization, etc

ROBUST RADIOTHERAPY APPOINTMENT SCHEDULING

Optimal scheduling of patients waiting for radiation treatments is a quite challenging operational problem in radiotherapy clinics. Long waiting times for radiotherapy treatments is mainly due to imbalanced supply and demand of radiotherapy services, which negatively affects the effectiveness and efficiency of the healthcare delivered. On the other hand, variations in the time required to set-up machines for each individual patient as well as patient treatment times make this problem even more involved. Efficient scheduling of patients on the waiting list is essential to reduce the waiting time and its possible adverse direct and indirect impacts on the patient. This research is focused on the problem of scheduling patients on a prioritized radiotherapy waiting list while the rescheduling of already booked patients is also possible. The aforementioned problem is formulated as a mixed-integer program that aims for maximizing the number of newly scheduled patients such that treatment time restrictions, scheduling of patients on consecutive days on the same machine, covering all required treatment sessions, as well as the capacity restriction of machines are satisfied. Afterwards, with the goal of protecting the schedule against treatment time perturbations, the problem is reformulated as a cardinality-constrained robust optimization model. This approach provides some insights into the adjustment of the level of robustness of the patients schedule over the planning horizon and protection against uncertainty. Further, three metaheuristics, namely Whale Optimization Algorithm, Particle Swarm Optimization, and Firefly Algorithm are proposed as alternative solution methods. Our numerical experiments are designed based on a case study inspired from a real radiotherapy clinic. The first goal of experiments is to analyze the performance of proposed robust radiotherapy appointment scheduling (ASP) model in terms of feasibility of schedule and the number of scheduled patients by the aid of Monte-Carlo simulation. Our second goal is to compare the solution quality and CPU time of the proposed metaheuristics with a commercial solver. Our experimental results indicate that by only considering half of patients treatment times as worst-case scenario, the schedule proposed by the robust RAS model is feasible in the presence of all randomly generated scenarios for this uncertain parameter. On the other hand, protecting the schedule against uncertainty at the aforementioned level would not significantly reduce the number of scheduled patients. Finally, our numerical results on the three metaheuristics indicate the high quality of their converged solution as well as the reduced CPU time comparing to a commercial solver

Models and algorithms for trauma network design.

Trauma continues to be the leading cause of death and disability in the US for people aged 44 and under, making it a major public health problem. The geographical maldistribution of Trauma Centers (TCs), and the resulting higher access time to the nearest TC, has been shown to impact trauma patient safety and increase disability or mortality. State governments often design a trauma network to provide prompt and definitive care to their citizens. However, this process is mainly manual and experience-based and often leads to a suboptimal network in terms of patient safety and resource utilization. This dissertation fills important voids in this domain and adds much-needed realism to develop insights that trauma decision-makers can use to design their trauma network. In this dissertation, we develop multiple optimization-based trauma network design approaches focusing minimizing mistriages and, in some cases, ensuring equity in care among regions. To mimic trauma care in practice, several realistic features are considered in our approach, which include the consideration of: (i) both severely and non-severely injured trauma patients and associated mistriages, (ii) intermediate trauma centers (ITCs) along with major trauma centers (MTCs), (iii) three dominant criteria for destination determination, and (iv) mistriages in on-scene clinical assessment of injuries. Our first contribution (Chapter 2) proposes the Trauma Center Location Problem (TCLP) that determines the optimal number and location of major trauma centers (MTCs) to improve patient safety. The bi-objective optimization model for TCLP explicitly considers both types of patients (severe and non-severe) and associated mistriages (specifically, system-related under- and over-triages) as a surrogate for patient safety. These mistriages are estimated using our proposed notional tasking algorithm that attempts to mimic the EMS on-scene decision of destination hospital and transportation mode. We develop a heuristic based on Particle Swarm Optimization framework to efficiently solve realistic problem sizes. We illustrate our approach using 2012 data from the state of OH and show that an optimized network for the state could achieve 31.5% improvement in patient safety compared to the 2012 network with the addition of just one MTC; redistribution of the 21 MTCs in the 2012 network led to a 30.4% improvement. Our second contribution (Chapter 3) introduces a Nested Trauma Network Design Problem (NTNDP), which is a nested multi-level, multi-customer, multi-transportation, multi-criteria, capacitated model. The NTNDP model has a bi-objective of maximizing the weighted sum of equity and effectiveness in patient safety. The proposed model includes intermediate trauma centers (TCs) that have been established in many US states to serve as feeder centers to major TCs. The model also incorporates three criteria used by EMS for destination determination; i.e., patient/family choice, closest facility, and protocol. Our proposed ‘3-phase’ approach efficiently solves the resulting MIP model by first solving a relaxed version of the model, then a Constraint Satisfaction Problem, and a modified version of the original optimization problem (if needed). A comprehensive experimental study is conducted to determine the sensitivity of the solutions to various system parameters. A case study is presented using 2019 data from the state of OH that shows more than 30% improvement in the patient safety objective. In our third contribution (Chapter 4), we introduce Trauma Network Design Problem considering Assessment-related Mistriages (TNDP-AM), where we explicitly consider mistriages in on-scene assessment of patient injuries by the EMS. The TNDP-AM model determines the number and location of major trauma centers to maximize patient safety. We model assessment-related mistriages using the Bernoulli random variable and propose a Simheuristic approach that integrates Monte Carlo Simulation with a genetic algorithm (GA) to solve the problem efficiently. Our findings indicate that the trauma network is susceptible to assessment-related mistriages; specifically, higher mistriages in assessing severe patients may lead to a 799% decrease in patient safety and potential clustering of MTCs near high trauma incidence rates. There are several implications of our findings to practice. State trauma decision-makers can use our approaches to not only better manage limited financial resources, but also understand the impact of changes in operational parameters on network performance. The design of training programs for EMS providers to build standardization in decision-making is another advantage

Evolutionary Computation 2020

Intelligent optimization is based on the mechanism of computational intelligence to refine a suitable feature model, design an effective optimization algorithm, and then to obtain an optimal or satisfactory solution to a complex problem. Intelligent algorithms are key tools to ensure global optimization quality, fast optimization efficiency and robust optimization performance. Intelligent optimization algorithms have been studied by many researchers, leading to improvements in the performance of algorithms such as the evolutionary algorithm, whale optimization algorithm, differential evolution algorithm, and particle swarm optimization. Studies in this arena have also resulted in breakthroughs in solving complex problems including the green shop scheduling problem, the severe nonlinear problem in one-dimensional geodesic electromagnetic inversion, error and bug finding problem in software, the 0-1 backpack problem, traveler problem, and logistics distribution center siting problem. The editors are confident that this book can open a new avenue for further improvement and discoveries in the area of intelligent algorithms. The book is a valuable resource for researchers interested in understanding the principles and design of intelligent algorithms

Bio-inspired computation: where we stand and what's next

In recent years, the research community has witnessed an explosion of literature dealing with the adaptation of behavioral patterns and social phenomena observed in nature towards efficiently solving complex computational tasks. This trend has been especially dramatic in what relates to optimization problems, mainly due to the unprecedented complexity of problem instances, arising from a diverse spectrum of domains such as transportation, logistics, energy, climate, social networks, health and industry 4.0, among many others. Notwithstanding this upsurge of activity, research in this vibrant topic should be steered towards certain areas that, despite their eventual value and impact on the field of bio-inspired computation, still remain insufficiently explored to date. The main purpose of this paper is to outline the state of the art and to identify open challenges concerning the most relevant areas within bio-inspired optimization. An analysis and discussion are also carried out over the general trajectory followed in recent years by the community working in this field, thereby highlighting the need for reaching a consensus and joining forces towards achieving valuable insights into the understanding of this family of optimization techniques