A Survey on Natural Inspired Computing (NIC): Algorithms and Challenges

Nature employs interactive images to incorporate end users2019; awareness and implication aptitude form inspirations into statistical/algorithmic information investigation procedures. Nature-inspired Computing (NIC) is an energetic research exploration field that has appliances in various areas, like as optimization, computational intelligence, evolutionary computation, multi-objective optimization, data mining, resource management, robotics, transportation and vehicle routing. The promising playing field of NIC focal point on managing substantial, assorted and self-motivated dimensions of information all the way through the incorporation of individual opinion by means of inspiration as well as communication methods in the study practices. In addition, it is the permutation of correlated study parts together with Bio-inspired computing, Artificial Intelligence and Machine learning that revolves efficient diagnostics interested in a competent pasture of study. This article intend at given that a summary of Nature-inspired Computing, its capacity and concepts and particulars the most significant scientific study algorithms in the field

A survey of swarm intelligence for dynamic optimization: algorithms and applications

Swarm intelligence (SI) algorithms, including ant colony optimization, particle swarm optimization, bee-inspired algorithms, bacterial foraging optimization, firefly algorithms, fish swarm optimization and many more, have been proven to be good methods to address difficult optimization problems under stationary environments. Most SI algorithms have been developed to address stationary optimization problems and hence, they can converge on the (near-) optimum solution efficiently. However, many real-world problems have a dynamic environment that changes over time. For such dynamic optimization problems (DOPs), it is difficult for a conventional SI algorithm to track the changing optimum once the algorithm has converged on a solution. In the last two decades, there has been a growing interest of addressing DOPs using SI algorithms due to their adaptation capabilities. This paper presents a broad review on SI dynamic optimization (SIDO) focused on several classes of problems, such as discrete, continuous, constrained, multi-objective and classification problems, and real-world applications. In addition, this paper focuses on the enhancement strategies integrated in SI algorithms to address dynamic changes, the performance measurements and benchmark generators used in SIDO. Finally, some considerations about future directions in the subject are given

A Parallel Meta-Heuristic Approach to Reduce Vehicle Travel Time in Smart Cities

The development of the smart city concept and inhabitants’ need to reduce travel time, in addition to society’s awareness of the importance of reducing fuel consumption and respecting the environment, have led to a new approach to the classic travelling salesman problem (TSP) applied to urban environments. This problem can be formulated as “Given a list of geographic points and the distances between each pair of points, what is the shortest possible route that visits each point and returns to the departure point?”. At present, with the development of Internet of Things (IoT) devices and increased capabilities of sensors, a large amount of data and measurements are available, allowing researchers to model accurately the routes to choose. In this work, the aim is to provide a solution to the TSP in smart city environments using a modified version of the metaheuristic optimization algorithm Teacher Learner Based Optimization (TLBO). In addition, to improve performance, the solution is implemented by means of a parallel graphics processing unit (GPU) architecture, specifically a Compute Unified Device Architecture (CUDA) implementation.This research was supported by the Spanish Ministry of Science, Innovation and Universities and the Research State Agency under Grant RTI2018-098156-B-C54 co-financed by FEDER funds, and by the Spanish Ministry of Economy and Competitiveness under Grant TIN2017-89266-R, co-financed by FEDER funds

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

Bio-inspired multi-agent systems for reconfigurable manufacturing systems

The current market’s demand for customization and responsiveness is a major challenge for producing intelligent, adaptive manufacturing systems. The Multi-Agent System (MAS) paradigm offers an alternative way to design this kind of system based on decentralized control using distributed, autonomous agents, thus replacing the traditional centralized control approach. The MAS solutions provide modularity, flexibility and robustness, thus addressing the responsiveness property, but usually do not consider true adaptation and re-configuration. Understanding how, in nature, complex things are performed in a simple and effective way allows us to mimic nature’s insights and develop powerful adaptive systems that able to evolve, thus dealing with the current challenges imposed on manufactur- ing systems. The paper provides an overview of some of the principles found in nature and biology and analyses the effectiveness of bio-inspired methods, which are used to enhance multi-agent systems to solve complex engineering problems, especially in the manufacturing field. An industrial automation case study is used to illustrate a bio-inspired method based on potential fields to dynamically route pallets

Cooperative transport in swarm robotics. Multi object transportation

Swarm robotics is a research field inspired from the natural behavior of ants, bees or fish in their natural habitat. Each group display swarm behavior in different ways. For example, ants use pheromones to trace one another in order to find a nest, reach a food source or do any operation, while bees use dance moves to attract one another to the desired place. In swarm robotics, small robots attempt to mimic insect behavior. The robotic swarm group collaborate to perform a task and collectively solve a given problem. In the process, the robots use the sensors they are equipped with to move, communicate or avoid obstacles until they collectively do the desired functionality. In this thesis, we propose a modification to the Robotic Darwinian Particle Swarm Optimization (RDPSO) algorithm. In the RDPSO, robots deployed in a rescue operation, transport one object at a time to a desired safe place. In our algorithm, we simultaneously transport multiple objects to safety. We call our algorithm Multi Robotics Darwinian Particle Swarm Optimization (MRDPSO). Our algorithm is developed and implemented on a VREP simulator using ePuck robots as swarm members. We test our algorithm using two different environment sizes complete with obstacles. First implementation is for two simultaneous object transported but can be extended to more than two. We compare our new algorithm to the results of single RDPSO and found our algorithm to be 35 to 41 % faster. We also compared our results to those obtained from three selected papers that are Ghosh, Konar, and Janarthanan [1], TORABI [2], and Kube and Bonabeau [3]. The performance measures we compare to are the accuracy of transporting all objects to desired location, and the time efficiency of transporting all the objects in our new system

The Prediction of Douyin Live Sales based on Neural Network Algorithms

This paper aims to optimize neural network algorithms in order to improve their predictive performance and meet the demand for Douyin live sales forecasting. The Douyin live data of Florasis between January 2022 and June 2022 were collected from Huitun data and preprocessed. Using the Pearson correlation coefficient, six factors that are highly correlated with live sales were selected for subsequent prediction. This paper briefly introduces the back-propagation neural network (BPNN) algorithm and analyzes its parameter optimization methods, including particle swarm optimization (PSO), the artificial bee colony (ABC) algorithm, and the beetle antler search (BAS) algorithm. Then, an improved beetle antennae search (IBAS) algorithm was developed by introducing inertia weight and used to construct an IBAS-BPNN model for predicting sales volume in Douyin live streaming. The results showed that compared with the BPNN, PSO-BPNN, and ABC-BPNN algorithms, the IBAS-BPNN algorithm had better prediction performance, with a root-mean-square error of 335.6694, a mean absolute percentage error of 0.0532%, an equilibrium coefficient of 0.9889, and a shorter training time of 90.07 s. The experimental results demonstrate the reliability of the IBAS-BPNN algorithm for predicting sales volume in Douyin live streaming, providing new insights into parameter optimization of BPNN and offering references for further research on BPNN parameter optimization. It also provides an effective method with both timeliness and high accuracy for predicting sales volume in Douyin live streaming in practical applications. Doi: 10.28991/HIJ-2023-04-02-09 Full Text: PD

Rough-Cut Capacity Planning in Multimodal Freight Transportation Networks

A main challenge in transporting cargo for United States Transportation Command (USTRANSCOM) is in mode selection or integration. Demand for cargo is time sensitive and must be fulfilled by an established due date. Since these due dates are often inflexible, commercial carriers are used at an enormous expense, in order to fill the gap in organic transportation asset capacity. This dissertation develops a new methodology for transportation capacity assignment to routes based on the Resource Constrained Shortest Path Problem (RCSP). Routes can be single or multimodal depending on the characteristics of the network, delivery timeline, modal capacities, and costs. The difficulty of the RCSP requires use of metaheuristics to produce solutions. An Ant Colony System to solve the RCSP is developed in this dissertation. Finally, a method for generating near Pareto optimal solutions with respect to the objectives of cost and time is developed

Natural computing for vehicular networks

La presente tesis aborda el diseño inteligente de soluciones para el despliegue de redes vehiculares ad-hoc (vehicular ad hoc networks, VANETs). Estas son redes de comunicación inalámbrica formada principalmente por vehículos y elementos de infraestructura vial. Las VANETs ofrecen la oportunidad para desarrollar aplicaciones revolucionarias en el ámbito de la seguridad y eficiencia vial. Al ser un dominio tan novedoso, existe una serie de cuestiones abiertas, como el diseño de la infraestructura de estaciones base necesaria y el encaminamiento (routing) y difusión (broadcasting) de paquetes de datos, que todavía no han podido resolverse empleando estrategias clásicas. Es por tanto necesario crear y estudiar nuevas técnicas que permitan de forma eficiente, eficaz, robusta y flexible resolver dichos problemas. Este trabajo de tesis doctoral propone el uso de computación inspirada en la naturaleza o Computación Natural (CN) para tratar algunos de los problemas más importantes en el ámbito de las VANETs, porque representan una serie de algoritmos versátiles, flexibles y eficientes para resolver problemas complejos. Además de resolver los problemas VANET en los que nos enfocamos, se han realizado avances en el uso de estas técnicas para que traten estos problemas de forma más eficiente y eficaz. Por último, se han llevado a cabo pruebas reales de concepto empleando vehículos y dispositivos de comunicación reales en la ciudad de Málaga (España). La tesis se ha estructurado en cuatro grandes fases. En la primera fase, se han estudiado los principales fundamentos en los que se basa esta tesis. Para ello se hizo un estudio exhaustivo sobre las tecnologías que emplean las redes vehiculares, para así, identificar sus principales debilidades. A su vez, se ha profundizado en el análisis de la CN como herramienta eficiente para resolver problemas de optimización complejos, y de cómo utilizarla en la resolución de los problemas en VANETs. En la segunda fase, se han abordado cuatro problemas de optimización en redes vehiculares: la transferencia de archivos, el encaminamiento (routing) de paquetes, la difusión (broadcasting) de mensajes y el diseño de la infraestructura de estaciones base necesaria para desplegar redes vehiculares. Para la resolución de dichos problemas se han propuesto diferentes algoritmos CN que se clasifican en algoritmos evolutivos (evolutionary algorithms, EAs), métodos de inteligencia de enjambre (swarm intelligence, SI) y enfriamiento simulado (simulated annealing, SA). Los resultados obtenidos han proporcionado protocolos de han mejorado de forma significativa las comunicaciones en VANETs. En la tercera y última fase, se han realizado experimentos empleando vehículos reales circulando por las carreteras de Málaga y que se comunicaban entre sí. El principal objetivo de estas pruebas ha sido el validar las mejoras que presentan los protocolos que se han optimizado empleando CN. Los resultados obtenidos de las fases segunda y tercera confirman la hipótesis de trabajo, que la CN es una herramienta eficiente para tratar el diseño inteligente en redes vehiculares

A Survey on Natural Inspired Computing (NIC): Algorithms and Challenges

Nature employs interactive images to incorporate end users’ awareness and implication aptitude form inspirations into statistical/algorithmic information investigation procedures. Nature-inspired Computing (NIC) is an energetic research exploration field that has appliances in various areas, like as optimization, computational intelligence, evolutionary computation, multi-objective optimization, data mining, resource management, robotics, transportation and vehicle routing. The promising playing field of NIC focal point on managing substantial, assorted and self-motivated dimensions of information all the way through the incorporation of individual opinion by means of inspiration as well as communication methods in the study practices. In addition, it is the permutation of correlated study parts together with Bio-inspired computing, Artificial Intelligence and Machine learning that revolves efficient diagnostics interested in a competent pasture of study. This article intend at given that a summary of Nature-inspired Computing, its capacity and concepts and particulars the most significant scientific study algorithms in the field