An Optimal Travel Route Optimization Model Based on Ant Colony Optimization Algorithm

Lei Zhang, Peng Sun
{"title":"An Optimal Travel Route Optimization Model Based on Ant Colony Optimization Algorithm","authors":"Lei Zhang, Peng Sun","doi":"10.1109/ACMLC58173.2022.00026","DOIUrl":null,"url":null,"abstract":"Travel planning is an important part of tourism. Unlike traditional experience journeys, these journeys developed using mathematical modeling techniques are more scientifically reliable. The mathematical model of travel planning problem is based on tourism marketing problem, which can be solved by ant trap algorithm. At the same time, the development of information technology has led to the transformation of tourism travel organization from the traditional experience based design to a higher level. In this work, this paper focuses on the use of advanced ant algorithm to solve the travel booking problem, self-guided route planning problem and intelligent route planning problem. First, this paper proposes an advanced solution to the ACO based travel assignment problem. In order to realize the ant trap algorithm to solve the travel route problem, when solving the travel quota problem, the ant trap algorithm should obtain the optimal solution with high probability, and the solution time of the algorithm should be relatively short. Secondly, this paper improves the path selection probability and pheromone updating rules, locally searches the optimal path, optimizes the algorithm solving process, and determines the logic parameters of the algorithm. Through performance simulation analysis, the algorithm proposed in this work solves the line problem, with high search accuracy and short solution time.","PeriodicalId":375920,"journal":{"name":"2022 5th Asia Conference on Machine Learning and Computing (ACMLC)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 5th Asia Conference on Machine Learning and Computing (ACMLC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACMLC58173.2022.00026","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Travel planning is an important part of tourism. Unlike traditional experience journeys, these journeys developed using mathematical modeling techniques are more scientifically reliable. The mathematical model of travel planning problem is based on tourism marketing problem, which can be solved by ant trap algorithm. At the same time, the development of information technology has led to the transformation of tourism travel organization from the traditional experience based design to a higher level. In this work, this paper focuses on the use of advanced ant algorithm to solve the travel booking problem, self-guided route planning problem and intelligent route planning problem. First, this paper proposes an advanced solution to the ACO based travel assignment problem. In order to realize the ant trap algorithm to solve the travel route problem, when solving the travel quota problem, the ant trap algorithm should obtain the optimal solution with high probability, and the solution time of the algorithm should be relatively short. Secondly, this paper improves the path selection probability and pheromone updating rules, locally searches the optimal path, optimizes the algorithm solving process, and determines the logic parameters of the algorithm. Through performance simulation analysis, the algorithm proposed in this work solves the line problem, with high search accuracy and short solution time.
基于蚁群优化算法的最优出行路线优化模型
旅游规划是旅游业的重要组成部分。与传统的体验旅程不同,这些使用数学建模技术开发的旅程在科学上更可靠。旅游规划问题的数学模型是基于旅游营销问题,可以用蚁群陷阱算法求解。同时,信息技术的发展使得旅游组织从传统的基于体验的设计向更高层次的转变。在本工作中,本文重点研究了利用先进的蚂蚁算法解决出行预订问题、自引导路线规划问题和智能路线规划问题。首先,对基于蚁群算法的出行分配问题提出了一种改进的解决方案。为了实现蚂蚁陷阱算法解决出行路线问题,在求解出行配额问题时,蚂蚁陷阱算法应以高概率获得最优解,且算法的求解时间应相对较短。其次,改进路径选择概率和信息素更新规则,局部搜索最优路径,优化算法求解过程,确定算法的逻辑参数;通过性能仿真分析,本文提出的算法解决了直线问题,具有搜索精度高、求解时间短的特点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信