• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

一种考虑多种约束的行程推荐的改进遗传算法解决方案。

An enhanced genetic algorithm solution for itinerary recommendation considering various constraints.

作者信息

Şehab Muhammed, Turan Metin

机构信息

Computer Technology Department, Avrupa Vocational School, Kocaeli Health and Technology University, Kocaeli, Turkey.

Computer Engineering Department, Istanbul Ticaret University, Istanbul, Turkey.

出版信息

PeerJ Comput Sci. 2024 Oct 2;10:e2340. doi: 10.7717/peerj-cs.2340. eCollection 2024.

DOI:10.7717/peerj-cs.2340
PMID:39650351
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC11623113/
Abstract

This paper addresses the challenging task of itinerary recommendation for tourists and proposes an approach for suggesting efficient optimal itineraries in Istanbul, based on constraints. The paper presents an enhanced version of the genetic algorithm (GA), which aims to optimize the itineraries considering various constraints and preferences of the tourists. The improvement of the GA involved suggesting a customized fitness function tailored to address the complexities of the tourism problem, considering factors such as distance, time, cost, tourists' budget, and their desired activities and attractions. Additionally, we proposed a new crossover method, named "Copy Order Crossover" and we modified the tournament selection method beside enhancing the implementation of the swap mutation method for greater efficiency and adaptability. The enhanced GA is evaluated on the Burma dataset taken from TSPLIB, and our constructed Istanbul dataset, achieving significant enhancement rates in GA (43.89% for Istanbul, and 56.60% for Burma). This paper provides a detailed account of the proposed approach, its implementation, and the evaluation conducted. The experimental results conclusively demonstrated the superiority of the proposed approach over alternative methods in terms of time, efficiency, and accuracy. This paper finishes with an outlook with a detailed potential approach to overcome itinerary recommendation problem limitations.

摘要

本文探讨了为游客推荐行程这一具有挑战性的任务,并提出了一种基于约束条件在伊斯坦布尔推荐高效最优行程的方法。本文介绍了遗传算法(GA)的一个改进版本,旨在考虑游客的各种约束条件和偏好来优化行程。GA的改进包括提出一个定制的适应度函数,该函数考虑了距离、时间、成本、游客预算以及他们期望的活动和景点等因素,以应对旅游问题的复杂性。此外,我们提出了一种名为“复制顺序交叉”的新交叉方法,修改了锦标赛选择方法,并改进了交换变异方法的实现,以提高效率和适应性。在取自TSPLIB的缅甸数据集以及我们构建的伊斯坦布尔数据集上对改进后的GA进行了评估,GA实现了显著的提升率(伊斯坦布尔为43.89%,缅甸为56.60%)。本文详细介绍了所提出的方法、其实现过程以及进行的评估。实验结果确凿地证明了所提出的方法在时间、效率和准确性方面优于其他替代方法。本文最后展望了一种克服行程推荐问题局限性的详细潜在方法。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8ae8/11623113/a72994614c2c/peerj-cs-10-2340-g020.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8ae8/11623113/0294ccde8f82/peerj-cs-10-2340-g001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8ae8/11623113/d65faf25c712/peerj-cs-10-2340-g002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8ae8/11623113/3cf73ea0fc4b/peerj-cs-10-2340-g003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8ae8/11623113/e68a221aa835/peerj-cs-10-2340-g004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8ae8/11623113/ee7bfa2f213d/peerj-cs-10-2340-g005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8ae8/11623113/d109e5257ecd/peerj-cs-10-2340-g006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8ae8/11623113/46d744880591/peerj-cs-10-2340-g007.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8ae8/11623113/84dae44c0457/peerj-cs-10-2340-g008.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8ae8/11623113/bb3c49c6ce87/peerj-cs-10-2340-g009.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8ae8/11623113/4f3c8da66ed1/peerj-cs-10-2340-g010.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8ae8/11623113/a38bb48dccce/peerj-cs-10-2340-g011.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8ae8/11623113/b83aa86114a7/peerj-cs-10-2340-g012.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8ae8/11623113/6dd3998d1a8a/peerj-cs-10-2340-g013.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8ae8/11623113/069bc06bba10/peerj-cs-10-2340-g014.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8ae8/11623113/f88f3a892f48/peerj-cs-10-2340-g015.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8ae8/11623113/9523d82c6d82/peerj-cs-10-2340-g016.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8ae8/11623113/7f0d191269aa/peerj-cs-10-2340-g017.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8ae8/11623113/20d0a755c5a6/peerj-cs-10-2340-g018.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8ae8/11623113/e4b7d68f1e7d/peerj-cs-10-2340-g019.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8ae8/11623113/a72994614c2c/peerj-cs-10-2340-g020.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8ae8/11623113/0294ccde8f82/peerj-cs-10-2340-g001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8ae8/11623113/d65faf25c712/peerj-cs-10-2340-g002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8ae8/11623113/3cf73ea0fc4b/peerj-cs-10-2340-g003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8ae8/11623113/e68a221aa835/peerj-cs-10-2340-g004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8ae8/11623113/ee7bfa2f213d/peerj-cs-10-2340-g005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8ae8/11623113/d109e5257ecd/peerj-cs-10-2340-g006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8ae8/11623113/46d744880591/peerj-cs-10-2340-g007.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8ae8/11623113/84dae44c0457/peerj-cs-10-2340-g008.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8ae8/11623113/bb3c49c6ce87/peerj-cs-10-2340-g009.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8ae8/11623113/4f3c8da66ed1/peerj-cs-10-2340-g010.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8ae8/11623113/a38bb48dccce/peerj-cs-10-2340-g011.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8ae8/11623113/b83aa86114a7/peerj-cs-10-2340-g012.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8ae8/11623113/6dd3998d1a8a/peerj-cs-10-2340-g013.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8ae8/11623113/069bc06bba10/peerj-cs-10-2340-g014.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8ae8/11623113/f88f3a892f48/peerj-cs-10-2340-g015.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8ae8/11623113/9523d82c6d82/peerj-cs-10-2340-g016.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8ae8/11623113/7f0d191269aa/peerj-cs-10-2340-g017.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8ae8/11623113/20d0a755c5a6/peerj-cs-10-2340-g018.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8ae8/11623113/e4b7d68f1e7d/peerj-cs-10-2340-g019.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/8ae8/11623113/a72994614c2c/peerj-cs-10-2340-g020.jpg

相似文献

1
An enhanced genetic algorithm solution for itinerary recommendation considering various constraints.一种考虑多种约束的行程推荐的改进遗传算法解决方案。
PeerJ Comput Sci. 2024 Oct 2;10:e2340. doi: 10.7717/peerj-cs.2340. eCollection 2024.
2
Personalized Recommendation Algorithm of Smart Tourism Based on Cross-Media Big Data and Neural Network.基于跨媒体大数据和神经网络的智能旅游个性化推荐算法。
Comput Intell Neurosci. 2022 Jun 26;2022:9566766. doi: 10.1155/2022/9566766. eCollection 2022.
3
The data mining and high-performance network model of tourism electronic word of mouth for analysis of factors influencing tourists' purchasing behavior.用于分析影响游客购买行为因素的旅游电子口碑数据挖掘与高性能网络模型。
Sci Rep. 2024 Dec 4;14(1):30237. doi: 10.1038/s41598-024-75794-3.
4
Value evaluation of cultural tourism tourists' psychological expectation based on machine learning data mining.基于机器学习数据挖掘的文化旅游游客心理预期价值评估
Front Psychol. 2022 Aug 8;13:943071. doi: 10.3389/fpsyg.2022.943071. eCollection 2022.
5
Reprint of: Exploring tourists' motivations, constraints, and negotiations regarding outdoor recreation trips during COVID-19 through a focus group study.重印:通过焦点小组研究探索新冠疫情期间游客进行户外休闲旅行的动机、限制因素及协商情况。
J Outdoor Recreat Tour. 2023 Mar;41:100626. doi: 10.1016/j.jort.2023.100626. Epub 2023 Mar 15.
6
Exploring tourists' motivations, constraints, and negotiations regarding outdoor recreation trips during COVID-19 through a focus group study.通过焦点小组研究探索新冠疫情期间游客对于户外休闲旅行的动机、限制因素及协商情况。
J Outdoor Recreat Tour. 2021 Dec;36:100447. doi: 10.1016/j.jort.2021.100447. Epub 2021 Sep 29.
7
Regional destination attributes that attract domestic tourists: the role of man-made venues for leisure and recreation.吸引国内游客的区域目的地属性:休闲娱乐人造场所的作用。
Heliyon. 2021 Jun 25;7(6):e07383. doi: 10.1016/j.heliyon.2021.e07383. eCollection 2021 Jun.
8
An Optimal Round-Trip Route Planning Method for Tourism Based on Improved Genetic Algorithm.基于改进遗传算法的旅游最优往返路径规划方法。
Comput Intell Neurosci. 2022 Aug 28;2022:7665874. doi: 10.1155/2022/7665874. eCollection 2022.
9
Spatial layout optimization model integrating layered attention mechanism in the development of smart tourism management.智能旅游管理发展中融合分层注意力机制的空间布局优化模型
PeerJ Comput Sci. 2024 Oct 9;10:e2329. doi: 10.7717/peerj-cs.2329. eCollection 2024.
10
Tourism Management Strategies under the Intelligent Tourism IoT Service Platform.智能旅游物联网服务平台下的旅游管理策略。
Comput Intell Neurosci. 2022 Apr 12;2022:7750098. doi: 10.1155/2022/7750098. eCollection 2022.

本文引用的文献

1
Study on a hybrid algorithm combining enhanced ant colony optimization and double improved simulated annealing via clustering in the Traveling Salesman Problem (TSP).基于聚类的增强蚁群优化与双重改进模拟退火相结合的混合算法在旅行商问题(TSP)中的研究。
PeerJ Comput Sci. 2023 Oct 2;9:e1609. doi: 10.7717/peerj-cs.1609. eCollection 2023.
2
An Optimal Round-Trip Route Planning Method for Tourism Based on Improved Genetic Algorithm.基于改进遗传算法的旅游最优往返路径规划方法。
Comput Intell Neurosci. 2022 Aug 28;2022:7665874. doi: 10.1155/2022/7665874. eCollection 2022.
3
Application of Genetic Optimization Algorithm in Financial Portfolio Problem.
遗传优化算法在金融投资组合问题中的应用。
Comput Intell Neurosci. 2022 Jul 15;2022:5246309. doi: 10.1155/2022/5246309. eCollection 2022.
4
Logistics Distribution Route Optimization Based on Genetic Algorithm.基于遗传算法的物流配送路线优化
Comput Intell Neurosci. 2022 Jul 6;2022:8468438. doi: 10.1155/2022/8468438. eCollection 2022.
5
A versatile active learning workflow for optimization of genetic and metabolic networks.一种用于遗传和代谢网络优化的多功能主动学习工作流程。
Nat Commun. 2022 Jul 5;13(1):3876. doi: 10.1038/s41467-022-31245-z.
6
Deep learning based real-time tourist spots detection and recognition mechanism.基于深度学习的实时旅游景点检测与识别机制。
Sci Prog. 2021 Sep;104(3_suppl):368504211044228. doi: 10.1177/00368504211044228.
7
A review on genetic algorithm: past, present, and future.关于遗传算法的综述:过去、现在与未来。
Multimed Tools Appl. 2021;80(5):8091-8126. doi: 10.1007/s11042-020-10139-6. Epub 2020 Oct 31.
8
Applications of machine learning to diagnosis and treatment of neurodegenerative diseases.机器学习在神经退行性疾病诊断和治疗中的应用。
Nat Rev Neurol. 2020 Aug;16(8):440-456. doi: 10.1038/s41582-020-0377-8. Epub 2020 Jul 15.
9
Machine learning and complex biological data.机器学习和复杂的生物数据。
Genome Biol. 2019 Apr 16;20(1):76. doi: 10.1186/s13059-019-1689-0.
10
The Applications of Genetic Algorithms in Medicine.遗传算法在医学中的应用。
Oman Med J. 2015 Nov;30(6):406-16. doi: 10.5001/omj.2015.82.