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: PDF


    Zugriff

    Download


    Exportieren, teilen und zitieren



    Titel :

    Study of Optimization of Tourists' Travel Paths by Several Algorithms


    Beteiligte:
    Wang, Ting (Autor:in)

    Erscheinungsdatum :

    01.06.2023


    Anmerkungen:

    doi:10.28991/HIJ-2023-04-02-012
    HighTech and Innovation Journal; Vol 4, No 2 (2023): June; 402-411 ; 2723-9535



    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Klassifikation :

    DDC:    629




    Travel demand functions for Florida bound tourists

    Gapinski, James H. / Tuckman, Howard P. | Elsevier | 1976


    Travel demand functions for Florida bound tourists

    Gapinski, James H. / Tuckman, Howard P. | Elsevier | 1976


    Multi-Objective Optimal Travel Route Recommendation for Tourists by Improved Ant Colony Optimization Algorithm

    Haodong Sun / Yanyan Chen / Jianming Ma et al. | DOAJ | 2022

    Freier Zugriff