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
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
无心的天真完成签到 ,获得积分10
刚刚
JSY发布了新的文献求助10
刚刚
无昵称完成签到 ,获得积分10
1秒前
时尚的大山应助chenjzhuc采纳,获得30
1秒前
丘比特应助食分子采纳,获得10
4秒前
科研小辉完成签到,获得积分10
4秒前
端庄的如霜完成签到,获得积分10
4秒前
谢耳朵完成签到 ,获得积分10
5秒前
嘟嘟豆806完成签到 ,获得积分0
5秒前
Yuang完成签到 ,获得积分10
5秒前
6秒前
陈龙完成签到,获得积分10
7秒前
科研通AI6.3应助波力海苔采纳,获得10
8秒前
8秒前
李不乐完成签到,获得积分10
8秒前
枯叶灬风完成签到,获得积分10
9秒前
苏苏完成签到,获得积分10
9秒前
zdw完成签到,获得积分10
11秒前
斯文香彤完成签到,获得积分10
11秒前
11秒前
11秒前
Ao完成签到,获得积分10
12秒前
淡定曼寒发布了新的文献求助10
12秒前
董昌铭发布了新的文献求助10
14秒前
TangQQ完成签到,获得积分10
14秒前
15秒前
程程完成签到 ,获得积分10
15秒前
ding应助有魅力的含海采纳,获得10
15秒前
加油呀发布了新的文献求助50
16秒前
无私的蜡烛完成签到,获得积分20
16秒前
16秒前
CipherSage应助真好采纳,获得10
17秒前
yaohaha发布了新的文献求助20
19秒前
及时雨完成签到 ,获得积分10
19秒前
19秒前
20秒前
yike完成签到 ,获得积分10
20秒前
RJ应助诚心的松思采纳,获得10
21秒前
忐忑的小玉完成签到,获得积分10
21秒前
露露子完成签到,获得积分10
22秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 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
Social Cognition: Understanding People and Events 1000
Polymorphism and polytypism in crystals 1000
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 纳米技术 有机化学 物理 生物化学 化学工程 计算机科学 复合材料 内科学 催化作用 光电子学 物理化学 电极 冶金 遗传学 细胞生物学
热门帖子
关注 科研通微信公众号,转发送积分 6030180
求助须知:如何正确求助?哪些是违规求助? 7704658
关于积分的说明 16192176
捐赠科研通 5177088
什么是DOI,文献DOI怎么找? 2770430
邀请新用户注册赠送积分活动 1753873
关于科研通互助平台的介绍 1639385