An enhanced genetic algorithm solution for itinerary recommendation considering various constraints

MakaleAçık ErişimScopus SJRQ1

Özet

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.

Anahtar Kelimeler

RDL Kalıcı Bağlantı (PID)
https://rdlopen.rawdatalibrary.net/r/kostu/10493Resmi atıflarda kullanılan kalıcı adres
DOI
https://doi.org/10.7717/peerj-cs.2340Yayıncı resmi DOI adresi
İndeks kayıtları
Kaydın indeks veri tabanlarındaki sayfası (aktarımda alınan kayıt numarasıyla). Erişim, indeksin kendi koşullarına bağlıdır.
Atıflar
Scopus
5
WoS
4
Her kaynağın kendi saydığı toplam atıf; aktarım ve zenginleştirme sırasında alındı.
Tam Kayıt
AlanDeğerDil
dc.contributor.authorŞehab, Muhammed
dc.contributor.authorTuran, Metin
dc.date.accessioned2026-10-27T23:47:35.135599405Z
dc.date.available2026-10-27T23:47:35.135599405Z
dc.date.issued2024
dc.description.abstractThis 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.
dc.identifier.articlenumbere2340
dc.identifier.doi10.7717/peerj-cs.2340
dc.identifier.eissn2376-5992
dc.identifier.issn2376-5992
dc.identifier.pmcidPMC11623113
dc.identifier.pmid39650351
dc.identifier.scopus2-s2.0-85207098446
dc.identifier.urihttps://rdlopen.rawdatalibrary.net/r/kostu/10493
dc.identifier.volume10
dc.identifier.wosWOS:001330328700002
dc.language.isoen
dc.publisherPeerJ Inc.
dc.relation.ispartofPeerJ Computer Science
dc.rightsinfo:eu-repo/semantics/openAccess
dc.subjectCrossover method
dc.subjectFitness function
dc.subjectGenetic algorithm
dc.subjectItinerary recommendation
dc.subjectMutation ratio
dc.subjectOptimal itinerary
dc.subject.classificationComputer Science, Artificial Intelligence
dc.subject.classificationComputer Science, Information Systems
dc.subject.classificationComputer Science, Theory & Methods
dc.subject.classificationComputer Science
dc.subject.otherGenetic algorithms
dc.subject.otherLeisure
dc.subject.otherAlgorithm solution
dc.subject.otherCrossover methods
dc.subject.otherEnhanced genetic algorithms
dc.subject.otherFitness functions
dc.subject.otherIstanbul
dc.subject.otherItinerary recommendation
dc.subject.otherMutation ratio
dc.subject.otherOptimal itinerary
dc.subject.otherOrder crossover
dc.subject.otherTime cost
dc.subject.otherBudget control
dc.titleAn enhanced genetic algorithm solution for itinerary recommendation considering various constraints
dc.typeArticle
rdl.citation.scopus5
rdl.citation.wos4
rdl.departmentComputer Technology Department, Avrupa Vocational School, Kocaeli Health and Technology University, Kocaeli, Turkey
rdl.departmentComputer Engineering Department, Istanbul Ticaret University, Istanbul, Turkey
rdl.oa.statusgold
rdl.oa.statusgreen
rdl.oa.urlhttps://doi.org/10.7717/peerj-cs.2340
rdl.scopus.quartileQ1
rdl.source.indexSCOPUS
rdl.source.indexWOS
rdl.source.indexPUBMED
rdl.wos.indexScience Citation Index Expanded (SCI-EXPANDED)