EconPapers    
Economics at your fingertips  
 

Design of intelligent planning system for tourist scenic route based on ant colony algorithm

Shi Meishan

International Journal of Industrial and Systems Engineering, 2021, vol. 39, issue 3, 377-393

Abstract: In view of the problems of CPU energy consumption and mobile phone memory occupation in the current intelligent planning system of tourist attraction line, an intelligent planning system of tourist attraction line based on ant colony algorithm is proposed. The system hardware consists of data integration device, sensor and GPS positioning chip. In the software part of the system, ant colony algorithm is used to transform the problem of landscape path planning into the shortest feasible path problem: to calculate the transfer probability of ants to scenic spots, to construct the weight matrix used by ants in the process of path finding, to construct the intelligent planning model, and to realise the intelligent planning of scenic spots. The experimental results show that the CPU consumption of the system is 24.3% and the mobile memory consumption is 2.54%, which can solve the problems existing in the traditional routing planning system.

Keywords: ant colony algorithm; tourist scenic spots; route intelligent planning; weight matrix; system design. (search for similar items in EconPapers)
Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=119712 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijisen:v:39:y:2021:i:3:p:377-393

Access Statistics for this article

More articles in International Journal of Industrial and Systems Engineering from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().

 
Page updated 2025-03-19
Handle: RePEc:ids:ijisen:v:39:y:2021:i:3:p:377-393