Tourism Route Recommendation Based on A Multi-Objective Evolutionary Algorithm Using Two-Stage Decomposition and Pareto Layering

多目标优化 水准点(测量) 分层 数学优化 进化算法 帕累托原理 计算机科学 渡线 算法 人口 阶段(地层学) 旅游 数学 人工智能 地理 社会学 考古 古生物学 人口学 生物 植物 大地测量学
作者
Xiaoyao Zheng,Baoting Han,Ni Zhang
出处
期刊:IEEE/CAA Journal of Automatica Sinica [Institute of Electrical and Electronics Engineers]
卷期号:10 (2): 486-500 被引量:4
标识
DOI:10.1109/jas.2023.123219
摘要

Tourism route planning is widely applied in the smart tourism field. The Pareto-optimal front obtained by the traditional multi-objective evolutionary algorithm exhibits long tails, sharp peaks and disconnected regions problems, which leads to uneven distribution and weak diversity of optimization solutions of tourism routes. Inspired by these limitations, we propose a multi-objective evolutionary algorithm for tourism route recommendation (MOTRR) with two-stage and Pareto layering based on decomposition. The method decomposes the multi-objective problem into several subproblems, and improves the distribution of solutions through a two-stage method. The crowding degree mechanism between extreme and intermediate populations is used in the two-stage method. The neighborhood is determined according to the weight of the subproblem for crossover mutation. Finally, Pareto layering is used to improve the updating efficiency and population diversity of the solution. The two-stage method is combined with the Pareto layering structure, which not only maintains the distribution and diversity of the algorithm, but also avoids the same solutions. Compared with several classical benchmark algorithms, the experimental results demonstrate competitive advantages on five test functions, hypervolume (HV) and inverted generational distance (IGD) metrics. Using the experimental results of real scenic spot datasets from two famous tourism social networking sites with vast amounts of users and large-scale online comments in Beijing, our proposed algorithm shows better distribution. It proves that the tourism routes recommended by our proposed algorithm have better distribution and diversity, so that the recommended routes can better meet the personalized needs of tourists.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
1秒前
停停走走发布了新的文献求助10
1秒前
123456发布了新的文献求助10
2秒前
科研通AI6.1应助phy采纳,获得10
3秒前
gougou完成签到,获得积分10
3秒前
5秒前
5秒前
流禾乙豫完成签到 ,获得积分10
5秒前
5秒前
想一夏完成签到,获得积分10
5秒前
小curry完成签到,获得积分10
5秒前
6秒前
wdh完成签到,获得积分10
7秒前
小糊涂仙完成签到,获得积分10
7秒前
xzn1123应助心灵美的翠芙采纳,获得10
7秒前
mxq完成签到,获得积分10
8秒前
NexusExplorer应助小王啵啵采纳,获得10
8秒前
Jasper应助停停走走采纳,获得10
9秒前
科研通AI6.2应助爱小尹采纳,获得10
9秒前
海苔噗噗发布了新的文献求助10
9秒前
mmyhn发布了新的文献求助50
10秒前
wlywdb发布了新的文献求助10
10秒前
灿灿的资源完成签到,获得积分10
10秒前
科研通AI2S应助wckow采纳,获得10
11秒前
12秒前
传奇3应助shanshan采纳,获得10
12秒前
酪酥爱大米完成签到,获得积分10
13秒前
星辰大海应助呆子采纳,获得10
13秒前
13秒前
Bear完成签到,获得积分10
13秒前
14秒前
Zurlliant完成签到,获得积分10
15秒前
呆萌的蚂蚁完成签到 ,获得积分10
15秒前
feifei发布了新的文献求助10
16秒前
ZZZ发布了新的文献求助10
17秒前
17秒前
17秒前
17秒前
Banana完成签到,获得积分10
17秒前
于小淘发布了新的文献求助10
18秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Modern Epidemiology, Fourth Edition 5000
Handbook of pharmaceutical excipients, Ninth edition 5000
Digital Twins of Advanced Materials Processing 2000
Weaponeering, Fourth Edition – Two Volume SET 2000
Polymorphism and polytypism in crystals 1000
Signals, Systems, and Signal Processing 610
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 纳米技术 有机化学 生物化学 化学工程 物理 计算机科学 复合材料 内科学 催化作用 物理化学 光电子学 电极 冶金 基因 遗传学
热门帖子
关注 科研通微信公众号,转发送积分 6022567
求助须知:如何正确求助?哪些是违规求助? 7642904
关于积分的说明 16169707
捐赠科研通 5170857
什么是DOI,文献DOI怎么找? 2766894
邀请新用户注册赠送积分活动 1750200
关于科研通互助平台的介绍 1636934