Optimization for Decision Making II

In the current context of the electronic governance of society, both administrations and citizens are demanding the greater participation of all the actors involved in the decision-making process relative to the governance of society. This book presents collective works published in the recent Special Issue (SI) entitled “Optimization for Decision Making II”. These works give an appropriate response to the new challenges raised, the decision-making process can be done by applying different methods and tools, as well as using different objectives. In real-life problems, the formulation of decision-making problems and the application of optimization techniques to support decisions are particularly complex and a wide range of optimization techniques and methodologies are used to minimize risks, improve quality in making decisions or, in general, to solve problems. In addition, a sensitivity or robustness analysis should be done to validate/analyze the influence of uncertainty regarding decision-making. This book brings together a collection of inter-/multi-disciplinary works applied to the optimization of decision making in a coherent manner

Metaheuristic Algorithms for Spatial Multi-Objective Decision Making

Spatial decision making is an everyday activity, common to individuals and organizations. However, recently there is an increasing interest in the importance of spatial decision-making systems, as more decision-makers with concerns about sustainability, social, economic, environmental, land use planning, and transportation issues discover the benefits of geographical information. Many spatial decision problems are regarded as optimization problems, which involve a large set of feasible alternatives, multiple conflicting objectives that are difficult and complex to solve. Hence, Multi-Objective Optimization methods (MOO)—metaheuristic algorithms integrated with Geographical Information Systems (GIS) are appealing to be powerful tools in these regards, yet their implementation in spatial context is still challenging. In this thesis, various metaheuristic algorithms are adopted and improved to solve complex spatial problems. Disaster management and urban planning are used as case studies of this thesis.These case studies are explored in the four papers that are part of this thesis. In paper I, four metaheuristic algorithms have been implemented on the same spatial multi-objective problem—evacuation planning, to investigate their performance and potential. The findings show that all tested algorithms were effective in solving the problem, although in general, some had higher performance, while others showed the potential of being flexible to be modified to fit better to the problem. In the same context, paper II identified the effectiveness of the Multi-objective Artificial Bee Colony (MOABC) algorithm when improved to solve the evacuation problem. In paper III, we proposed a multi-objective optimization approach for urban evacuation planning that considered three spatial objectives which were optimized using an improved Multi-Objective Cuckoo Search algorithm (MOCS). Both improved algorithms (MOABC and MOCS) proved to be efficient in solving evacuation planning when compared to their standard version and other algorithms. Moreover, Paper IV proposed an urban land-use allocation model that involved three spatial objectives and proposed an improved Non-dominated Sorting Biogeography-based Optimization algorithm (NSBBO) to solve the problem efficiently and effectively.Overall, the work in this thesis demonstrates that different metaheuristic algorithms have the potential to change the way spatial decision problems are structured and can improve the transparency and facilitate decision-makers to map solutions and interactively modify decision preferences through trade-offs between multiple objectives. Moreover, the obtained results can be used in a systematic way to develop policy recommendations. From the perspective of GIS - Multi-Criteria Decision Making (MCDM) research, the thesis contributes to spatial optimization modelling and extended knowledge on the application of metaheuristic algorithms. The insights from this thesis could also benefit the development and practical implementation of other Artificial Intelligence (AI) techniques to enhance the capabilities of GIS for tackling complex spatial multi-objective decision problems in the future

An Analysis Review: Optimal Trajectory for 6-DOF-based Intelligent Controller in Biomedical Application

With technological advancements and the development of robots have begun to be utilized in numerous sectors, including industrial, agricultural, and medical. Optimizing the path planning of robot manipulators is a fundamental aspect of robot research with promising future prospects. The precise robot manipulator tracks can enhance the efficacy of a variety of robot duties, such as workshop operations, crop harvesting, and medical procedures, among others. Trajectory planning for robot manipulators is one of the fundamental robot technologies, and manipulator trajectory accuracy can be enhanced by the design of their controllers. However, the majority of controllers devised up to this point were incapable of effectively resolving the nonlinearity and uncertainty issues of high-degree freedom manipulators in order to overcome these issues and enhance the track performance of high-degree freedom manipulators. Developing practical path-planning algorithms to efficiently complete robot functions in autonomous robotics is critical. In addition, designing a collision-free path in conjunction with the physical limitations of the robot is a very challenging challenge due to the complex environment surrounding the dynamics and kinetics of robots with different degrees of freedom (DoF) and/or multiple arms. The advantages and disadvantages of current robot motion planning methods, incompleteness, scalability, safety, stability, smoothness, accuracy, optimization, and efficiency are examined in this paper

HEDCOS: High Efficiency Dynamic Combinatorial Optimization System using Ant Colony Optimization algorithm

This thesis was submitted for the award of Doctor of Philosophy and was awarded by Brunel University LondonDynamic combinatorial optimization is gaining popularity among industrial practitioners due to the ever-increasing scale of their optimization problems and efforts to solve them to remain competitive. Larger optimization problems are not only more computationally intense to optimize but also have more uncertainty within problem inputs. If some aspects of the problem are subject to dynamic change, it becomes a Dynamic Optimization Problem (DOP). In this thesis, a High Efficiency Dynamic Combinatorial Optimization System is built to solve challenging DOPs with high-quality solutions. The system is created using Ant Colony Optimization (ACO) baseline algorithm with three novel developments. First, introduced an extension method for ACO algorithm called Dynamic Impact. Dynamic Impact is designed to improve convergence and solution quality by solving challenging optimization problems with a non-linear relationship between resource consumption and fitness. This proposed method is tested against the real-world Microchip Manufacturing Plant Production Floor Optimization (MMPPFO) problem and the theoretical benchmark Multidimensional Knapsack Problem (MKP). Second, a non-stochastic dataset generation method was introduced to solve the dynamic optimization research replicability problem. This method uses a static benchmark dataset as a starting point and source of entropy to generate a sequence of dynamic states. Then using this method, 1405 Dynamic Multidimensional Knapsack Problem (DMKP) benchmark datasets were generated and published using famous static MKP benchmark instances as the initial state. Third, introduced a nature-inspired discrete dynamic optimization strategy for ACO by modelling real-world ants’ symbiotic relationship with aphids. ACO with Aphids strategy is designed to solve discrete domain DOPs with event-triggered discrete dynamism. The strategy improved inter-state convergence by allowing better solution recovery after dynamic environment changes. Aphids mediate the information from previous dynamic optimization states to maximize initial results performance and minimize the impact on convergence speed. This strategy is tested for DMKP and against identical ACO implementations using Full-Restart and Pheromone-Sharing strategies, with all other variables isolated. Overall, Dynamic Impact and ACO with Aphids developments are compounding. Using Dynamic Impact on single objective optimization of MMPPFO, the fitness value was improved by 33.2% over the ACO algorithm without Dynamic Impact. MKP benchmark instances of low complexity have been solved to a 100% success rate even when a high degree of solution sparseness is observed, and large complexity instances have shown the average gap improved by 4.26 times. ACO with Aphids has also demonstrated superior performance over the Pheromone-Sharing strategy in every test on average gap reduced by 29.2% for a total compounded dynamic optimization performance improvement of 6.02 times. Also, ACO with Aphids has outperformed the Full-Restart strategy for large datasets groups, and the overall average gap is reduced by 52.5% for a total compounded dynamic optimization performance improvement of 8.99 times

自然に学ぶ知的アルゴリズムによる最適化及び予測問題に関する研究

富山大学・富理工博甲第147号・劉燕婷・2018/09/28富山大学201

Bio-inspired Computing and Smart Mobility

Por último, se aborda la predicción de plazas libres de aparcamiento utilizando técnicas de aprendizaje automático, tales como series temporales, agrupamiento, etc., incluyendo un prototipo de aplicación web. La tercera parte de esta tesis doctoral se enfoca en el diseño y evaluación de un nuevo algoritmo inspirado en la epigénesis, el Algoritmo Epigenético. Luego de la descripción del modelo en el que se basa y de sus partes, se utiliza este nuevo algoritmo para la resolución del problema de la mochila multidimensional y se comparan sus resultados con los de otros algoritmos del estado de arte. Por último se emplea también el Algoritmo Epigenético para la optimización de la arquitectura Yellow Swarm, un problema de movilidad inteligente resuelto por un nuevo algoritmo bioinspirado. A lo largo de esta tesis doctoral se han descrito los problemas de movilidad inteligente y propuesto nuevas herramientas para su optimización. A partir de los experimentos realizados se concluye que estas herramientas, basadas en algoritmos bioinspirados, son eficientes para abordar estos problemas, obteniendo resultados competitivos comparados con los del estado del arte, los cuales han sido validados estadísticamente. Esto representa un aporte científico pero también una serie de mejoras para la sociedad toda, tanto en su salud como en el aprovechamiento de su tiempo libre. Fecha de lectura de Tesis: 01 octubre 2018.Esta tesis doctoral propone soluciones a problemas de movilidad inteligente, concretamente la reducción de los tiempos de viajes en las vías urbanas, las emisiones de gases de efecto invernadero y el consumo de combustible, mediante el diseño y uso de nuevos algoritmos bioinspirados. Estos algoritmos se utilizan para la optimización de escenarios realistas, cuyo trazado urbano se obtiene desde OpenStreetMap, y que son luego evaluados en el microsimulador SUMO. Primero se describen las bases científicas y tecnológicas, incluyendo la definición y estado del arte de los problemas a abordar, las metaheurísticas que se utilizarán durante el desarrollo de los experimentos, así como las correspondientes validaciones estadísticas. A continuación se describen los simuladores de movilidad como principal herramienta para construir y evaluar los escenarios urbanos. Por último se presenta una propuesta para generar tráfico vehicular realista a partir de datos de sensores que cuentan el número de vehículos en la ciudad, utilizando herramientas incluidas en SUMO combinadas con algoritmos evolutivos. En la segunda parte se modelan y resuelven problemas de movilidad inteligente utilizando las nuevas arquitecturas Red Swarm y Green Swarm para sugerir nuevas rutas a los vehículos utilizando nodos con conectividad Wi-Fi. Red Swarm se centra en la reducción de tiempos de viajes evitando la congestión de las calles, mientras que Green Swarm está enfocado en la reducción de emisiones y consumo de combustible. Luego se propone la arquitectura Yellow Swarm que utiliza una serie de paneles LED para indicar desvíos que los vehículos pueden seguir en lugar de nodos Wi-Fi haciendo esta propuesta más accesible. Además se propone un método para genera rutas alternativas para los navegadores GPS de modo que se aprovechen mejor las calles secundarias de las ciudades, reduciendo los atascos

Macroscopic Traffic Model Validation of Large Networks and the Introduction of a Gradient Based Solver

Traffic models are important for the evaluation of various Intelligent Transport Systems and the development of new traffic infrastructure. In order for this to be done accurately and with confidence the correct parameter values of the model must be identified. The focus of this thesis is the identification and confirmation of these parameters, which is model validation. Validation is performed on two different models; the first-order CTM and the second-order METANET model. The CTM is validated for two UK sites of 7.8 and 21.9 km and METANET for the same two sites using a variety of meta-heuristic algorithms. This is done using a newly developed method to allow for the optimisation method to determine the number of parameters to be used and the spatial extent of their application. This allows for the removal of expert engineering knowledge and ad-hoc decomposition of networks. This thesis also develops a methodology by use of Automatic Differentiation to allow gradient based optimisation to be used. This approach successfully validated the METANET model for the 21.9 km site and also a large network surrounding the city of Manchester of 186.9 km. This proves that gradient based optimisation can be used for the macroscopic traffic model validation problem. In fact the performance of the developed gradient method is superior to the meta-heuristics tested for the same sites. The methodology defined also allows for more data to be obtained from the model such as its Jacobian and the sensitivity of the objective function being used relative to the individual parameters. Space-Time contour plots of this newly acquired data show structures and shock waves that are not visible in the mean speed contour diagrams