Study of Optimization of Tourists' Travel Paths by Several Algorithms

The purpose of this paper is to optimize the tourism path to make the distance shorter. The article first constructed a model for tourism route planning and then used particle swarm optimization (PSO), genetic algorithm (GA), and ant colony algorithms to solve the model separately. Finally, a simulation experiment was conducted on tourist attractions in the suburbs of Taiyuan City to compare the path optimization performance of the three algorithms. The three path optimization algorithms all converged during the process of finding the optimal path. Among them, the ant colony algorithm exhibited the fastest and most stable convergence, resulting in the smallest model fitness value. The travel route obtained through the ant colony algorithm had the shortest distance, and this algorithm required minimal time for optimization. The novelty of this article lies in the enumeration and description of various algorithms used for optimizing travel paths, as well as the comparison of three different travel route optimization algorithms through simulation experiments. Doi: 10.28991/HIJ-2023-04-02-012 Full Text: PD

Applying ant colony algorithm to identify ecological security patterns in megacities

Ecological security patterns composed of ecological sources and corridors provide an effective approach to conserving natural ecosystems. Although the direction of ecological corridors has been identified in previous studies, the precise range remains unknown. To address this crucial gap, ant colony algorithm and kernel density estimation were applied to identify the range and restoration points of ecological corridors, which is important for natural conservation and ecological restoration. In this case study of Beijing City, ecological sources were identified based on habitat importance and landscape connectivity. The results showed that, in total 3119.65 km2 of ecological land had been extracted as ecological sources, which were mainly located in the northern, northwestern and northeastern mountainous areas. The identified key ecological corridor covered an area of 198.86 km2, with 567.30 km2 for potential ecological corridors, both connecting the ecological sources. 34 key points were also identified with priority in restoring ecological corridors

Mobile Robot Path Planning Based on Ant Colony Algorithm With A* Heuristic Method

This paper proposes an improved ant colony algorithm to achieve efficient searching capabilities of path planning in complicated maps for mobile robot. The improved ant colony algorithm uses the characteristics of A* algorithm and MAX-MIN Ant system. Firstly, the grid environment model is constructed. The evaluation function of A* algorithm and the bending suppression operator are introduced to improve the heuristic information of the Ant colony algorithm, which can accelerate the convergence speed and increase the smoothness of the global path. Secondly, the retraction mechanism is introduced to solve the deadlock problem. Then the MAX-MIN ant system is transformed into local diffusion pheromone and only the best solution from iteration trials can be added to pheromone update. And, strengths of the pheromone trails are effectively limited for avoiding premature convergence of search. This gives an effective improvement and high performance to ACO in complex tunnel, trough and baffle maps and gives a better result as compare to traditional versions of ACO. The simulation results show that the improved ant colony algorithm is more effective and faster

Robot navigation and target capturing using nature-inspired approaches in a dynamic environment

Path Planning and target searching in a three-dimensional environment is a challenging task in the field of robotics. It is an optimization problem as the path from source to destination has to be optimal. This paper aims to generate a collision-free trajectory in a dynamic environment. The path planning problem has sought to be of extreme importance in the military, search and rescue missions and in life-saving tasks. During its operation, the unmanned air vehicle operates in a hostile environment, and faster replanning is needed to reach the target as optimally as possible. This paper presents a novel approach of hierarchical planning using multiresolution abstract levels for faster replanning. Economic constraints like path length, total path planning time and the number of turns are taken into consideration that mandate the use of cost functions. Experimental results show that the hierarchical version of GSO gives better performance compared to the BBO, IWO and their hierarchical versions.Comment: 8 pages, 8 figure

Grey Wolf Optimizer-Based Approaches to Path Planning and Fuzzy Logic-based Tracking Control for Mobile Robots

This paper proposes two applications of Grey Wolf Optimizer (GWO) algorithms to a path planning (PaPl) problem and a Proportional-Integral (PI)-fuzzy controller tuning problem. Both optimization problems solved by GWO algorithms are explained in detail. An off-line GWO-based PaPl approach for Nonholonomic Wheeled Mobile Robots (NWMRs) in static environments is proposed. Once the PaPl problem is solved resulting in the reference trajectory of the robots, the paper also suggests a GWO-based approach to tune cost-effective PI-fuzzy controllers in tracking control problem for NWMRs. The experimental results are demonstrated through simple multiagent settings conducted on the nRobotic platform developed at the Politehnica University of Timisoara, Romania, and they prove both the effectiveness of the two GWO-based approaches and major performance improvement

Geo Data Science for Tourism

This reprint describes the recent challenges in tourism seen from the point of view of data science. Thanks to the use of the most popular Data Science concepts, you can easily recognise trends and patterns in tourism, detect the impact of tourism on the environment, and predict future trends in tourism. This reprint starts by describing how to analyse data related to the past, then it moves on to detecting behaviours in the present, and, finally, it describes some techniques to predict future trends. By the end of the reprint, you will be able to use data science to help tourism businesses make better use of data and improve their decision making and operations.

Crowdsensing-driven route optimisation algorithms for smart urban mobility

Urban rörlighet anses ofta vara en av de främsta möjliggörarna för en hållbar statsutveckling. Idag skulle det dock kräva ett betydande skifte mot renare och effektivare stadstransporter vilket skulle stödja ökad social och ekonomisk koncentration av resurser i städerna. En viktig prioritet för städer runt om i världen är att stödja medborgarnas rörlighet inom stadsmiljöer medan samtidigt minska trafikstockningar, olyckor och föroreningar. Att utveckla en effektivare och grönare (eller med ett ord; smartare) stadsrörlighet är en av de svåraste problemen att bemöta för stora metropoler. I denna avhandling närmar vi oss problemet från det snabba utvecklingsperspektivet av ITlandskapet i städer vilket möjliggör byggandet av rörlighetslösningar utan stora stora investeringar eller sofistikerad sensortenkik. I synnerhet föreslår vi utnyttjandet av den mobila rörlighetsavkännings, eng. Mobile Crowdsensing (MCS), paradigmen i vilken befolkningen exploaterar sin mobilkommunikation och/eller mobilasensorer med syftet att frivilligt samla, distribuera, lokalt processera och analysera geospecifik information. Rörlighetavkänningssdata (t.ex. händelser, trafikintensitet, buller och luftföroreningar etc.) inhämtad från frivilliga i befolkningen kan ge värdefull information om aktuella rörelsesförhållanden i stad vilka, med adekvata databehandlingsalgoriter, kan användas för att planera människors rörelseflöden inom stadsmiljön. Såtillvida kombineras i denna avhandling två mycket lovande smarta rörlighetsmöjliggörare, eng. Smart Mobility Enablers, nämligen MCS och rese/ruttplanering. Vi kan därmed till viss utsträckning sammanföra forskningsutmaningar från dessa två delar. Vi väljer att separera våra forskningsmål i två delar, dvs forskningssteg: (1) arkitektoniska utmaningar vid design av MCS-system och (2) algoritmiska utmaningar för tillämpningar av MCS-driven ruttplanering. Vi ämnar att visa en logisk forskningsprogression över tiden, med avstamp i mänskligt dirigerade rörelseavkänningssystem som MCS och ett avslut i automatiserade ruttoptimeringsalgoritmer skräddarsydda för specifika MCS-applikationer. Även om vi förlitar oss på heuristiska lösningar och algoritmer för NP-svåra ruttproblem förlitar vi oss på äkta applikationer med syftet att visa på fördelarna med algoritm- och infrastrukturförslagen.La movilidad urbana es considerada una de las principales desencadenantes de un desarrollo urbano sostenible. Sin embargo, hoy en día se requiere una transición hacia un transporte urbano más limpio y más eficiente que soporte una concentración de recursos sociales y económicos cada vez mayor en las ciudades. Una de las principales prioridades para las ciudades de todo el mundo es facilitar la movilidad de los ciudadanos dentro de los entornos urbanos, al mismo tiempo que se reduce la congestión, los accidentes y la contaminación. Sin embargo, desarrollar una movilidad urbana más eficiente y más verde (o en una palabra, más inteligente) es uno de los temas más difíciles de afrontar para las grandes áreas metropolitanas. En esta tesis, abordamos este problema desde la perspectiva de un panorama TIC en rápida evolución que nos permite construir movilidad sin la necesidad de grandes inversiones ni sofisticadas tecnologías de sensores. En particular, proponemos aprovechar el paradigma Mobile Crowdsensing (MCS) en el que los ciudadanos utilizan sus teléfonos móviles y dispositivos, para nosotros recopilar, procesar y analizar localmente información georreferenciada, distribuida voluntariamente. Los datos de movilidad recopilados de ciudadanos que voluntariamente quieren compartirlos (por ejemplo, eventos, intensidad del tráfico, ruido y contaminación del aire, etc.) pueden proporcionar información valiosa sobre las condiciones de movilidad actuales en la ciudad, que con el algoritmo de procesamiento de datos adecuado, pueden utilizarse para enrutar y gestionar el flujo de gente en entornos urbanos. Por lo tanto, en esta tesis combinamos dos prometedoras fuentes de movilidad inteligente: MCS y la planificación de viajes/rutas, uniendo en cierta medida los distintos desafíos de investigación. Hemos dividido nuestros objetivos de investigación en dos etapas: (1) Desafíos arquitectónicos en el diseño de sistemas MCS y (2) Desafíos algorítmicos en la planificación de rutas aprovechando la información del MCS. Nuestro objetivo es demostrar una progresión lógica de la investigación a lo largo del tiempo, comenzando desde los fundamentos de los sistemas de detección centrados en personas, como el MCS, hasta los algoritmos de optimización de rutas diseñados específicamente para la aplicación de estos. Si bien nos centramos en algoritmos y heurísticas para resolver problemas de enrutamiento de clase NP-hard, utilizamos ejemplos de aplicaciones en el mundo real para mostrar las ventajas de los algoritmos e infraestructuras propuestas

Recent Advances in Social Data and Artificial Intelligence 2019

The importance and usefulness of subjects and topics involving social data and artificial intelligence are becoming widely recognized. This book contains invited review, expository, and original research articles dealing with, and presenting state-of-the-art accounts pf, the recent advances in the subjects of social data and artificial intelligence, and potentially their links to Cyberspace

A Framework for Life Cycle Cost Estimation of a Product Family at the Early Stage of Product Development

A cost estimation method is required to estimate the life cycle cost of a product family at the early stage of product development in order to evaluate the product family design. There are difficulties with existing cost estimation techniques in estimating the life cycle cost for a product family at the early stage of product development. This paper proposes a framework that combines a knowledge based system and an activity based costing techniques in estimating the life cycle cost of a product family at the early stage of product development. The inputs of the framework are the product family structure and its sub function. The output of the framework is the life cycle cost of a product family that consists of all costs at each product family level and the costs of each product life cycle stage. The proposed framework provides a life cycle cost estimation tool for a product family at the early stage of product development using high level information as its input. The framework makes it possible to estimate the life cycle cost of various product family that use any types of product structure. It provides detailed information related to the activity and resource costs of both parts and products that can assist the designer in analyzing the cost of the product family design. In addition, it can reduce the required amount of information and time to construct the cost estimation system