An Optimal Round-Trip Route Planning Method for Tourism Based on Improved Genetic Algorithm
The optimization of the travel route for a round-trip is not only a customized demand made by a large number of independently guided tourists but also an essential practical issue for the development of tourism management and tourism businesses. In light of this, the study presents a genetic algorit...
Saved in:
| Published in | Computational intelligence and neuroscience Vol. 2022; pp. 1 - 8 |
|---|---|
| Main Author | |
| Format | Journal Article |
| Language | English |
| Published |
New York
Hindawi
28.08.2022
John Wiley & Sons, Inc |
| Subjects | |
| Online Access | Get full text |
| ISSN | 1687-5265 1687-5273 1687-5273 |
| DOI | 10.1155/2022/7665874 |
Cover
| Abstract | The optimization of the travel route for a round-trip is not only a customized demand made by a large number of independently guided tourists but also an essential practical issue for the development of tourism management and tourism businesses. In light of this, the study presents a genetic algorithm (GA) as a potential solution to the problem of how to visit a number of tourist destinations within a constrained area in order to quickly determine the shortest tourist route. To traverse areas or regions with the least amount of physical exertion, select the correct and shortest route. Examining all potential routes from the starting point to the destination will allow you to determine the quickest route. A condensed explanation of the enhanced GA is provided to start. The second step is to analyze the model’s construction and solution in detail. Next, an enhanced genetic algorithm (IGA) is utilized to determine the optimal travel route for visiting a variety of tourist attractions. In accordance with the optimal travel route, the required number of days and specific travel arrangements are then estimated. In conclusion, the GA is optimized, and a simulation examination of each individual’s average path convergence is conducted. The results of the experiments indicate that the IGA can be effectively applied to the path planning of multiple scenic locations, the selection of the shortest travel route, the reduction of travel expenses, and the saving of travel time. This has important implications for both research and practical applications, as well as a high research significance and practical value. |
|---|---|
| AbstractList | The optimization of the travel route for a round-trip is not only a customized demand made by a large number of independently guided tourists but also an essential practical issue for the development of tourism management and tourism businesses. In light of this, the study presents a genetic algorithm (GA) as a potential solution to the problem of how to visit a number of tourist destinations within a constrained area in order to quickly determine the shortest tourist route. To traverse areas or regions with the least amount of physical exertion, select the correct and shortest route. Examining all potential routes from the starting point to the destination will allow you to determine the quickest route. A condensed explanation of the enhanced GA is provided to start. The second step is to analyze the model's construction and solution in detail. Next, an enhanced genetic algorithm (IGA) is utilized to determine the optimal travel route for visiting a variety of tourist attractions. In accordance with the optimal travel route, the required number of days and specific travel arrangements are then estimated. In conclusion, the GA is optimized, and a simulation examination of each individual's average path convergence is conducted. The results of the experiments indicate that the IGA can be effectively applied to the path planning of multiple scenic locations, the selection of the shortest travel route, the reduction of travel expenses, and the saving of travel time. This has important implications for both research and practical applications, as well as a high research significance and practical value.The optimization of the travel route for a round-trip is not only a customized demand made by a large number of independently guided tourists but also an essential practical issue for the development of tourism management and tourism businesses. In light of this, the study presents a genetic algorithm (GA) as a potential solution to the problem of how to visit a number of tourist destinations within a constrained area in order to quickly determine the shortest tourist route. To traverse areas or regions with the least amount of physical exertion, select the correct and shortest route. Examining all potential routes from the starting point to the destination will allow you to determine the quickest route. A condensed explanation of the enhanced GA is provided to start. The second step is to analyze the model's construction and solution in detail. Next, an enhanced genetic algorithm (IGA) is utilized to determine the optimal travel route for visiting a variety of tourist attractions. In accordance with the optimal travel route, the required number of days and specific travel arrangements are then estimated. In conclusion, the GA is optimized, and a simulation examination of each individual's average path convergence is conducted. The results of the experiments indicate that the IGA can be effectively applied to the path planning of multiple scenic locations, the selection of the shortest travel route, the reduction of travel expenses, and the saving of travel time. This has important implications for both research and practical applications, as well as a high research significance and practical value. The optimization of the travel route for a round-trip is not only a customized demand made by a large number of independently guided tourists but also an essential practical issue for the development of tourism management and tourism businesses. In light of this, the study presents a genetic algorithm (GA) as a potential solution to the problem of how to visit a number of tourist destinations within a constrained area in order to quickly determine the shortest tourist route. To traverse areas or regions with the least amount of physical exertion, select the correct and shortest route. Examining all potential routes from the starting point to the destination will allow you to determine the quickest route. A condensed explanation of the enhanced GA is provided to start. The second step is to analyze the model’s construction and solution in detail. Next, an enhanced genetic algorithm (IGA) is utilized to determine the optimal travel route for visiting a variety of tourist attractions. In accordance with the optimal travel route, the required number of days and specific travel arrangements are then estimated. In conclusion, the GA is optimized, and a simulation examination of each individual’s average path convergence is conducted. The results of the experiments indicate that the IGA can be effectively applied to the path planning of multiple scenic locations, the selection of the shortest travel route, the reduction of travel expenses, and the saving of travel time. This has important implications for both research and practical applications, as well as a high research significance and practical value. |
| Audience | Academic |
| Author | Cao, Sha |
| AuthorAffiliation | College of Land and Tourism, Luoyang Normal University, Luoyang 471934, Henan, China |
| AuthorAffiliation_xml | – name: College of Land and Tourism, Luoyang Normal University, Luoyang 471934, Henan, China |
| Author_xml | – sequence: 1 givenname: Sha orcidid: 0000-0001-8658-1229 surname: Cao fullname: Cao, Sha organization: College of Land and TourismLuoyang Normal UniversityLuoyang 471934HenanChinalynu.edu.cn |
| BookMark | eNqFkltrFTEUhQep2Iu--QMCvgg6bZLJZeZFOBathUqLnD71IaS5nJMyk0yTTEv_vRnOwdKilkCySb61NnuR_WrHB2-q6j2ChwhReoQhxkecMdpy8qraQ6zlNcW82flTM7pb7ad0AyHlFOI31W7DIMcco73qauHB-ZjdIHvwK0xe18voxrnMBlz00nvnV-CnyeuggQ0RLMMUXRrAV5mMBsGD02GM4a7UJ8ab7BRY9KsQXV4Pb6vXVvbJvNueB9Xl92_L4x_12fnJ6fHirFakw7k2RlukW6PgNbPKQs07bnFjpSUdJKTRkFHFmdS0tRxyDgniVHaNRJQhqFlzUNUb38mP8uFe9r0YY5koPggExRySmEMS25AK_2XDj9P1YLQyPkf5qAnSiacv3q3FKtyJjhDUsKYYfNwaxHA7mZTF4JIyfYnLhCkJzBFqCaRs7vXhGXpTAvQljkLBjnZlw4_USvZGOG9D6atmU7HgiCHSoqYr1OFfqLK0GZwqv8K6cv9EgDcCFUNK0VihXJbZhXks1_8rnc_PRC-E-WmDr53X8t79n_4NF-fQew |
| CitedBy_id | crossref_primary_10_1016_j_asoc_2023_111200 crossref_primary_10_1080_10255842_2024_2326888 crossref_primary_10_1038_s41598_025_86695_4 crossref_primary_10_1038_s41598_024_84581_z crossref_primary_10_7717_peerj_cs_2340 crossref_primary_10_1007_s42979_024_02667_x crossref_primary_10_1108_JHTI_09_2024_0972 |
| Cites_doi | 10.1007/978-1-4419-1153-7_1068 10.1007/978-981-13-0617-4_52 10.1109/tassp.1978.1163055 10.1109/ci-m.2006.248054 10.1016/j.wasman.2016.06.017 10.2139/ssrn.3834234 10.32604/cmc.2022.020546 10.1016/j.ipm.2019.102078 10.1016/s0305-0548(97)00031-2 10.1016/S0927-0507(05)80121-5 10.1080/13658816.2012.696649 10.1016/j.scitotenv.2018.08.078 10.1016/s0377-2217(00)00100-4 10.1007/978-94-015-7744-1_2 10.2139/ssrn.3529843 10.1287/opre.4.1.61 10.1007/BF00175354 10.1016/j.eswa.2011.09.070 10.3727/1098305031436944 10.26599/bdma.2020.9020026 10.1145/505241.505243 10.1007/978-3-319-93025-1_4 |
| ContentType | Journal Article |
| Copyright | Copyright © 2022 Sha Cao. COPYRIGHT 2022 John Wiley & Sons, Inc. Copyright © 2022 Sha Cao. This is an open access article distributed under the Creative Commons Attribution License (the “License”), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. https://creativecommons.org/licenses/by/4.0 Copyright © 2022 Sha Cao. 2022 |
| Copyright_xml | – notice: Copyright © 2022 Sha Cao. – notice: COPYRIGHT 2022 John Wiley & Sons, Inc. – notice: Copyright © 2022 Sha Cao. This is an open access article distributed under the Creative Commons Attribution License (the “License”), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. https://creativecommons.org/licenses/by/4.0 – notice: Copyright © 2022 Sha Cao. 2022 |
| DBID | RHU RHW RHX AAYXX CITATION 3V. 7QF 7QQ 7SC 7SE 7SP 7SR 7TA 7TB 7TK 7U5 7X7 7XB 8AL 8BQ 8FD 8FE 8FG 8FH 8FI 8FJ 8FK ABJCF ABUWG AFKRA ARAPS AZQEC BBNVY BENPR BGLVJ BHPHI CCPQU CWDGH DWQXO F28 FR3 FYUFA GHDGH GNUQQ H8D H8G HCIFZ JG9 JQ2 K7- K9. KR7 L6V L7M LK8 L~C L~D M0N M0S M1P M7P M7S P5Z P62 PHGZM PHGZT PIMPY PJZUB PKEHL PPXIY PQEST PQGLB PQQKQ PQUKI PRINS PSYQQ PTHSS Q9U 7X8 5PM ADTOC UNPAY |
| DOI | 10.1155/2022/7665874 |
| DatabaseName | Hindawi Publishing Complete Hindawi Publishing Subscription Journals Hindawi Publishing Open Access CrossRef ProQuest Central (Corporate) Aluminium Industry Abstracts Ceramic Abstracts Computer and Information Systems Abstracts Corrosion Abstracts Electronics & Communications Abstracts Engineered Materials Abstracts Materials Business File Mechanical & Transportation Engineering Abstracts Neurosciences Abstracts Solid State and Superconductivity Abstracts Health & Medical Collection ProQuest Central (purchase pre-March 2016) Computing Database (Alumni Edition) METADEX Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Natural Science Journals ProQuest Hospital Collection Hospital Premium Collection (Alumni Edition) ProQuest Central (Alumni) (purchase pre-March 2016) Materials Science & Engineering Collection ProQuest Central (Alumni) ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Essentials Biological Science Collection (subscription) ProQuest Central Technology Collection Natural Science Collection ProQuest One Community College Middle East & Africa Database ProQuest Central ANTE: Abstracts in New Technology & Engineering Engineering Research Database Health Research Premium Collection Health Research Premium Collection (Alumni) ProQuest Central Student Aerospace Database Copper Technical Reference Library SciTech Premium Collection Materials Research Database ProQuest Computer Science Collection Computer Science Database ProQuest Health & Medical Complete (Alumni) Civil Engineering Abstracts ProQuest Engineering Collection Advanced Technologies Database with Aerospace ProQuest Biological Science Collection Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Computing Database Health & Medical Collection (Alumni Edition) Medical Database Biological Science Database Engineering Database Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic Publicly Available Content Database ProQuest Health & Medical Research Collection ProQuest One Academic Middle East (New) ProQuest One Health & Nursing ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic ProQuest One Academic UKI Edition ProQuest Central China ProQuest One Psychology Engineering Collection ProQuest Central Basic MEDLINE - Academic PubMed Central (Full Participant titles) Unpaywall for CDI: Periodical Content Unpaywall |
| DatabaseTitle | CrossRef Publicly Available Content Database Materials Research Database ProQuest One Psychology Computer Science Database ProQuest Central Student ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection Computer and Information Systems Abstracts SciTech Premium Collection ProQuest Central China Materials Business File ProQuest One Applied & Life Sciences Engineered Materials Abstracts Health Research Premium Collection Natural Science Collection Health & Medical Research Collection Biological Science Collection ProQuest Central (New) Engineering Collection ANTE: Abstracts in New Technology & Engineering Advanced Technologies & Aerospace Collection Engineering Database Aluminium Industry Abstracts ProQuest Biological Science Collection ProQuest One Academic Eastern Edition Electronics & Communications Abstracts ProQuest Hospital Collection ProQuest Technology Collection Health Research Premium Collection (Alumni) Ceramic Abstracts Biological Science Database Neurosciences Abstracts ProQuest Hospital Collection (Alumni) ProQuest Health & Medical Complete ProQuest One Academic UKI Edition Solid State and Superconductivity Abstracts Engineering Research Database ProQuest One Academic ProQuest One Academic (New) Technology Collection Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest One Academic Middle East (New) Mechanical & Transportation Engineering Abstracts ProQuest Health & Medical Complete (Alumni) ProQuest Central (Alumni Edition) ProQuest One Community College ProQuest One Health & Nursing ProQuest Natural Science Collection ProQuest Central Aerospace Database Copper Technical Reference Library ProQuest Health & Medical Research Collection ProQuest Engineering Collection Middle East & Africa Database Health and Medicine Complete (Alumni Edition) ProQuest Central Korea Advanced Technologies Database with Aerospace Civil Engineering Abstracts ProQuest Computing ProQuest Central Basic ProQuest Computing (Alumni Edition) ProQuest SciTech Collection METADEX Computer and Information Systems Abstracts Professional Advanced Technologies & Aerospace Database ProQuest Medical Library Materials Science & Engineering Collection Corrosion Abstracts ProQuest Central (Alumni) MEDLINE - Academic |
| DatabaseTitleList | MEDLINE - Academic CrossRef Publicly Available Content Database |
| Database_xml | – sequence: 1 dbid: RHX name: Hindawi Publishing Open Access url: http://www.hindawi.com/journals/ sourceTypes: Publisher – sequence: 2 dbid: UNPAY name: Unpaywall url: https://proxy.k.utb.cz/login?url=https://unpaywall.org/ sourceTypes: Open Access Repository – sequence: 3 dbid: 8FG name: ProQuest Technology Collection url: https://search.proquest.com/technologycollection1 sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Anatomy & Physiology |
| EISSN | 1687-5273 |
| Editor | Kumar, Vijay |
| Editor_xml | – sequence: 1 givenname: Vijay surname: Kumar fullname: Kumar, Vijay |
| EndPage | 8 |
| ExternalDocumentID | 10.1155/2022/7665874 PMC9441363 A716148139 10_1155_2022_7665874 |
| GroupedDBID | --- 188 29F 2WC 3V. 4.4 53G 5GY 5VS 6J9 7X7 8FE 8FG 8FH 8FI 8FJ 8R4 8R5 AAFWJ AAJEY AAKPC ABDBF ABIVO ABJCF ABUWG ACGFO ACIWK ACM ACPRK ADBBV ADRAZ AENEX AFKRA AHMBA AINHJ ALMA_UNASSIGNED_HOLDINGS AOIJS ARAPS AZQEC BAWUL BBNVY BCNDV BENPR BGLVJ BHPHI BPHCQ BVXVI CCPQU CS3 CWDGH DIK DWQXO E3Z EBD EBS EMOBN ESX F5P FYUFA GNUQQ GROUPED_DOAJ GX1 HCIFZ HMCUK HYE I-F IAO ICD INH INR IPY ITC K6V K7- KQ8 L6V LK8 M0N M1P M48 M7P M7S MK~ O5R O5S OK1 P2P P62 PIMPY PQQKQ PROAC PSQYO PSYQQ PTHSS Q2X RHU RHW RHX RNS RPM SV3 TR2 TUS UKHRP XH6 ~8M 0R~ 24P AAMMB AAYXX ACCMX ACUHS AEFGJ AGXDD AIDQK AIDYY CITATION H13 IHR OVT PGMZT PHGZM PHGZT PJZUB PPXIY PQGLB PUEGO 7QF 7QQ 7SC 7SE 7SP 7SR 7TA 7TB 7TK 7U5 7XB 8AL 8BQ 8FD 8FK F28 FR3 H8D H8G JG9 JQ2 K9. KR7 L7M L~C L~D PKEHL PQEST PQUKI PRINS Q9U 7X8 5PM 2UF ADTOC C1A EJD IL9 UNPAY UZ4 |
| ID | FETCH-LOGICAL-c492t-eedf1d8ec0b6fcf0d797f23faf490443d065c76ad58f707704175a93a15610d63 |
| IEDL.DBID | M48 |
| ISSN | 1687-5265 1687-5273 |
| IngestDate | Sun Oct 26 04:02:59 EDT 2025 Tue Sep 30 16:42:52 EDT 2025 Thu Oct 02 03:27:34 EDT 2025 Tue Oct 07 06:06:08 EDT 2025 Mon Oct 20 22:44:20 EDT 2025 Mon Oct 20 16:54:32 EDT 2025 Wed Oct 01 02:22:28 EDT 2025 Thu Apr 24 23:11:52 EDT 2025 Sun Jun 02 18:51:21 EDT 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Language | English |
| License | This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. https://creativecommons.org/licenses/by/4.0 cc-by |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c492t-eedf1d8ec0b6fcf0d797f23faf490443d065c76ad58f707704175a93a15610d63 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 content type line 23 Academic Editor: Vijay Kumar |
| ORCID | 0000-0001-8658-1229 |
| OpenAccessLink | https://dx.doi.org/10.1155/2022/7665874 |
| PMID | 36072721 |
| PQID | 2709597092 |
| PQPubID | 237303 |
| PageCount | 8 |
| ParticipantIDs | unpaywall_primary_10_1155_2022_7665874 pubmedcentral_primary_oai_pubmedcentral_nih_gov_9441363 proquest_miscellaneous_2711840564 proquest_journals_2709597092 gale_infotracmisc_A716148139 gale_infotracacademiconefile_A716148139 crossref_citationtrail_10_1155_2022_7665874 crossref_primary_10_1155_2022_7665874 hindawi_primary_10_1155_2022_7665874 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2022-08-28 |
| PublicationDateYYYYMMDD | 2022-08-28 |
| PublicationDate_xml | – month: 08 year: 2022 text: 2022-08-28 day: 28 |
| PublicationDecade | 2020 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | Computational intelligence and neuroscience |
| PublicationYear | 2022 |
| Publisher | Hindawi John Wiley & Sons, Inc |
| Publisher_xml | – name: Hindawi – name: John Wiley & Sons, Inc |
| References | J. Zong (2) 22 24 25 26 27 D. Zhou (23) A. Singhal (4) D. Whitley (11) 1994; 4 K. L. Hoffman (8) 2013; 1 R. Logesh (17) 2019 13 14 16 M. Jünger (7) 1995; 7 P. J. M. Van Laarhoven (15) 1987 18 M. Kumar (12) 2010 19 1 5 6 J. Coelho (20) 9 F. C. Hsu (3) 2000; 1 S. Mirjalili (10) 2019 21 |
| References_xml | – volume: 1 start-page: 1573 year: 2013 ident: 8 article-title: Traveling salesman problem[J] publication-title: Encyclopedia of operations research and management science doi: 10.1007/978-1-4419-1153-7_1068 – start-page: 535 volume-title: Cognitive Informatics and Soft Computing year: 2019 ident: 17 article-title: Exploring hybrid recommender systems for personalized travel applications[M] doi: 10.1007/978-981-13-0617-4_52 – ident: 14 doi: 10.1109/tassp.1978.1163055 – ident: 16 doi: 10.1109/ci-m.2006.248054 – ident: 24 doi: 10.1016/j.wasman.2016.06.017 – volume: 1 start-page: 13 year: 2000 ident: 3 article-title: Interactive genetic algorithms for a travel itinerary planning problem[J] publication-title: TSP – start-page: 4601 ident: 2 article-title: Feedback-based coarse time-granularity POI recommendation and itinerary planning – ident: 4 article-title: GoTrip: an automatic ontological travel itinerary planner using SPARQL inferencing doi: 10.2139/ssrn.3834234 – ident: 5 doi: 10.32604/cmc.2022.020546 – ident: 18 doi: 10.1016/j.ipm.2019.102078 – ident: 25 doi: 10.1016/s0305-0548(97)00031-2 – volume: 7 start-page: 225 year: 1995 ident: 7 article-title: The traveling salesman problem[J] publication-title: Handbooks in Operations Research and Management Science doi: 10.1016/S0927-0507(05)80121-5 – ident: 21 doi: 10.1080/13658816.2012.696649 – ident: 1 doi: 10.1016/j.scitotenv.2018.08.078 – ident: 26 doi: 10.1016/s0377-2217(00)00100-4 – ident: 13 – start-page: 7 volume-title: Simulated Annealing: Theory and Applications year: 1987 ident: 15 article-title: Simulated annealing[M] doi: 10.1007/978-94-015-7744-1_2 – start-page: 255 ident: 23 article-title: A study of recommending locations on location-based social network by collaborative filtering[C] – year: 2010 ident: 12 article-title: Genetic algorithm: review and application[J] doi: 10.2139/ssrn.3529843 – ident: 9 doi: 10.1287/opre.4.1.61 – volume: 4 start-page: 65 issue: 2 year: 1994 ident: 11 article-title: A genetic algorithm tutorial[J] publication-title: Statistics and Computing doi: 10.1007/BF00175354 – start-page: 260 ident: 20 article-title: A personalized travel recommendation system using social media analysis[C] – ident: 22 doi: 10.1016/j.eswa.2011.09.070 – ident: 6 doi: 10.3727/1098305031436944 – ident: 19 doi: 10.26599/bdma.2020.9020026 – ident: 27 doi: 10.1145/505241.505243 – start-page: 43 volume-title: Evolutionary Algorithms and Neural Networks year: 2019 ident: 10 article-title: Genetic algorithm[M] doi: 10.1007/978-3-319-93025-1_4 |
| SSID | ssj0057502 |
| Score | 2.3990667 |
| Snippet | The optimization of the travel route for a round-trip is not only a customized demand made by a large number of independently guided tourists but also an... |
| SourceID | unpaywall pubmedcentral proquest gale crossref hindawi |
| SourceType | Open Access Repository Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 1 |
| SubjectTerms | Algorithms Collaboration Genetic algorithms Genetic research Immunoglobulin A Methods Optimization Path planning Planning Route planning Route selection Tourism Travel Travel industry Travel time Traveling salesman problem |
| SummonAdditionalLinks | – databaseName: Hindawi Publishing Open Access dbid: RHX link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3da9swEBdrYWwvY1035i4dGnTdwzCzJVmKH93REgbdoLQQ2IOR9bEEEqW0DqX__e4cOcwd-3gxNpIt26fT_X7n8x0hR1xbIA2-SI3NkKCoDHTONSnTTHDpc-E7P-T5Vzm5El-mxTQmSbr9_RM-WDuk5-yTkmAqldghO2OJkVsXk2m_4ALg2IQWStAXzPbex7c_OHdgeeL6-3iGzPduPsCXD6Mjn6zDtb6_04vFL6bn7Dl5FjEjrTZC3iOPXHhB9qsAfHl5T49pF8XZucf3yfcq0G-wDCzhhAssmZRewrKAu62jfYUiet7VjaYAWGlMI0hPwJxZugp042aAfcxIDSPSavFjdTNvZ8uX5Ors9PLzJI0FFFIjStamYP98bsfOZPhLj8-sKpVn3GsvykwIbgF_GCW1LcZeZUplAsCELrnOEVVZyV-R3bAK7jWhHpmPylij8lI4UzaGCyNdWTaNLSx3CfnYv9zaxOziWORiUXcsoyhqFEUdRZGQ99ve15usGn_o9wHlVKOywdWMjv8MwD1h2qq6ArYHfA5QbEJGg56gJGbQfBQl_Y_xRv00qKMu39ZMoa8UNiwh77bNOADGpwW3WmOfHKlyIeESajB9tuNhHu9hS5jPunzeJUBSLnlCjrcT7a93efB_D_OGPMVDdICz8YjstjdrdwgIqm3edvrzE8OgEQc priority: 102 providerName: Hindawi Publishing – databaseName: ProQuest Central dbid: BENPR link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwhV3da9RAEB_qFdEXUauYesoKtT5IaLK7yV4eRK7SUoSeUloo-BA2--EV7nJnzVH63zuT25xGsL6EwE6yS3Y-fjOZnQHYE9qi0-Cz2NiEHBSVoMy5KuaaS5H7VPo2Dnk6yU8u5OfL7HILJt1ZGEqr7HRiq6jtwlCM_IAriljhhX9c_oipaxT9Xe1aaOjQWsF-aEuM3YNtTpWxBrB9eDT5etbpZsQm6yzEHEWLCsN3qfBZRlEAfqBytMhK9oxUUNX3p-Qk31z1oOjfiZQPVvVS397o2ewPK3X8GB4FeMnGa354Aluufgo74xpd6_kt22dtwmcbSd-Bb-OafUGNMccHzqi7UnyOGoRuG8e6ZkbstG0xzRDbslBxkB2i5bNsUbN1RALvqXg1zsjGs-_4zZrp_BlcHB-dfzqJQ6-F2MiCNzGaSp_akTMJnf7xiVWF8lx47WWRSCksQhWjcm2zkVeJUolE3KELoVMCYDYXz2FQL2r3ApgnJ0klvFJpIZ0pKiOkyV1RVJXNrHARvO8-bmlCIXLqhzErW4cky0raijJsRQRvN9TLdQGOf9C9o30qSS7xbUaH4wW4JqpwVY7RMUTXDwFvBMMeJcqT6Q3vhZ3-z3zDjg3KIPY_y99MGsGbzTBNQKlstVusiCYlrzrL8RWqxz6b-ajkd3-kvpq2pb8LRK8iFxHsbxjtzlXu3r3Kl_CQqClGzkdDGDTXK_cKQVZTvQ6S8ws3SiHF priority: 102 providerName: ProQuest – databaseName: Unpaywall dbid: UNPAY link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3da9RAEF_qFdEXv6oYPWWFWh8k1yT7dcGnKJYitIr0oKIQNrtZ7_AuOdocpf71zuQ2pyn4gS_HHjvZSXZnduY37M4Qssu0BdDgRGhshABFRaBzZREmOuFMupi7Ng55dCwPJ_zdqTjdIq-6uzAWU8TX2p6PpohJL2btbu3n9XzfAFoEuJ7sKwmmU_HR0rprZFsKcMQHZHty_CH7hBBLgupg4vefbcW6Y-9C9IboGSS_LV_3zHtu59VDkzdW1VJfXuj5_BeLdHCbfOm-ZX0Q5dto1RQj8_1Kmsf__Ng75Jb3VGm2Fq27ZKus7pGdrAKUvrike7Q9O9oG5XfI56yi72HzWcADH7FQU3gCmxE2m5J2dZHoUVutmoKbTH3yQvoajKildUXXwQ1oYx5s4Eiz-df6bNZMF_fJ5ODtyZvD0JdtCA1PkyYEq-tiOy5NhBeJXGRVqlzCnHY8jThnFrweo6S2YuxUpFTEwYXRKdMx-nJWsgdkUNVV-ZBQh3hLRUmh4pSXJi0M40aWaVoUVlhWBuRlt3a58TnNsbTGPG-xjRA5zl_u5y8gzzfUy3Uuj9_QvUAxyFHFYTSj_U0FeCdMlpVngDEBRYLvHJBhjxJU0_S6d_3C_oXfsJOyvFv8PFEYoYWfJCDPNt3IAE_FVWW9QpoYAbqQMITqSeeGH2YP7_dUs2mbRTwFR5hJFpC9jRz_8S0f_SvhY3IT_2LgPRkPyaA5W5VPwHNriqdeQ38Aclk9GA priority: 102 providerName: Unpaywall |
| Title | An Optimal Round-Trip Route Planning Method for Tourism Based on Improved Genetic Algorithm |
| URI | https://dx.doi.org/10.1155/2022/7665874 https://www.proquest.com/docview/2709597092 https://www.proquest.com/docview/2711840564 https://pubmed.ncbi.nlm.nih.gov/PMC9441363 https://downloads.hindawi.com/journals/cin/2022/7665874.pdf |
| UnpaywallVersion | publishedVersion |
| Volume | 2022 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAFT databaseName: Open Access Digital Library customDbUrl: eissn: 1687-5273 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0057502 issn: 1687-5273 databaseCode: KQ8 dateStart: 20070625 isFulltext: true titleUrlDefault: http://grweb.coalliance.org/oadl/oadl.html providerName: Colorado Alliance of Research Libraries – providerCode: PRVAFT databaseName: Open Access Digital Library customDbUrl: eissn: 1687-5273 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0057502 issn: 1687-5273 databaseCode: KQ8 dateStart: 20070101 isFulltext: true titleUrlDefault: http://grweb.coalliance.org/oadl/oadl.html providerName: Colorado Alliance of Research Libraries – providerCode: PRVEBS databaseName: Academic Search Ultimate customDbUrl: https://search.ebscohost.com/login.aspx?authtype=ip,shib&custid=s3936755&profile=ehost&defaultdb=asn eissn: 1687-5273 dateEnd: 20230628 omitProxy: true ssIdentifier: ssj0057502 issn: 1687-5273 databaseCode: ABDBF dateStart: 20070101 isFulltext: true titleUrlDefault: https://search.ebscohost.com/direct.asp?db=asn providerName: EBSCOhost – providerCode: PRVBFR databaseName: Free Medical Journals customDbUrl: eissn: 1687-5273 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0057502 issn: 1687-5273 databaseCode: DIK dateStart: 20070101 isFulltext: true titleUrlDefault: http://www.freemedicaljournals.com providerName: Flying Publisher – providerCode: PRVFQY databaseName: GFMER Free Medical Journals customDbUrl: eissn: 1687-5273 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0057502 issn: 1687-5273 databaseCode: GX1 dateStart: 20070101 isFulltext: true titleUrlDefault: http://www.gfmer.ch/Medical_journals/Free_medical.php providerName: Geneva Foundation for Medical Education and Research – providerCode: PRVAQN databaseName: PubMed Central customDbUrl: eissn: 1687-5273 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0057502 issn: 1687-5273 databaseCode: RPM dateStart: 20070101 isFulltext: true titleUrlDefault: https://www.ncbi.nlm.nih.gov/pmc/ providerName: National Library of Medicine – providerCode: PRVPQU databaseName: Health & Medical Collection customDbUrl: eissn: 1687-5273 dateEnd: 20250131 omitProxy: true ssIdentifier: ssj0057502 issn: 1687-5273 databaseCode: 7X7 dateStart: 20080101 isFulltext: true titleUrlDefault: https://search.proquest.com/healthcomplete providerName: ProQuest – providerCode: PRVPQU databaseName: Middle East & Africa Database customDbUrl: eissn: 1687-5273 dateEnd: 20250131 omitProxy: false ssIdentifier: ssj0057502 issn: 1687-5273 databaseCode: CWDGH dateStart: 20080101 isFulltext: true titleUrlDefault: https://search.proquest.com/middleeastafrica providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Databases customDbUrl: http://www.proquest.com/pqcentral?accountid=15518 eissn: 1687-5273 dateEnd: 20250131 omitProxy: true ssIdentifier: ssj0057502 issn: 1687-5273 databaseCode: BENPR dateStart: 20080101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Technology Collection customDbUrl: eissn: 1687-5273 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0057502 issn: 1687-5273 databaseCode: 8FG dateStart: 20080101 isFulltext: true titleUrlDefault: https://search.proquest.com/technologycollection1 providerName: ProQuest – providerCode: PRVFZP databaseName: Scholars Portal Journals: Open Access customDbUrl: eissn: 1687-5273 dateEnd: 20250430 omitProxy: true ssIdentifier: ssj0057502 issn: 1687-5273 databaseCode: M48 dateStart: 20070101 isFulltext: true titleUrlDefault: http://journals.scholarsportal.info providerName: Scholars Portal – providerCode: PRVWIB databaseName: Wiley Online Library Open Access customDbUrl: eissn: 1687-5273 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0057502 issn: 1687-5273 databaseCode: 24P dateStart: 20070101 isFulltext: true titleUrlDefault: https://authorservices.wiley.com/open-science/open-access/browse-journals.html providerName: Wiley-Blackwell |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3db9MwELf2IQQvCBiIsFIZaYwHFJbETlw_IJTCSoXUMlWrVMRDlNgOrZSmW0k1-t9zlyYRmfh6caPYjiP7zvf7XZ07Qk5YrIE0pL6ttIMERTigcyaxvdjjLEhdnpZ-yNE4GE75p5k_2yN1ttFqAr__ltphPqnpOnvz43r7DhT-banwvo_83TsTAdhSwffJIdgoiUkcRrz5PwEwye70YQAqhQHh6yPwt3q3jFO1Rd-ZIzm-WbQg6O0DlHc3-VW8vYmz7BfrNHhA7lewkoY7OXhI9kz-iByFOVDq5Zae0vKgZ-lBPyJfw5x-hp1iCR0mmFXJvoSdAy8LQ-skRnRUppamgGlpFWmQ9sHiabrK6c4TAdcYtBpGpGH2bbVeFPPlYzIdnF--H9pVjgVbcekVNpjI1NU9oxz86id1tJAi9Vgap1w6nDMNEEWJINZ-LxWOEA4HvBFLFrsIvHTAnpCDfJWbp4SmSI6E4yXCldwomSjGVWCkTBLta2Ys8rqe3EhVAcgxD0YWlUTE9yNciqhaCou8bFpf7QJv_KHdK1ynCCUEnqbi6rMCeCeMbBWFQAiB8gHQtUin1RL0SLWqT6qV_sd4nVoMolpaI0-gOxUKzyIvmmocAI-w5Wa1wTYusmk_gEeIlvg042Go73ZNvpiXIb8loFYWMIucNoL217d89t-zckzuYUd0k3u9Djko1hvzHHBWkXTJvpgJKHuDj11yGPY_9Afw2z8fX0y6pXpBORnO4N50fBF--QlSxiiz |
| linkProvider | Scholars Portal |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Pb9MwFH8andC48G8gCgWMtJUDypY4TtwcOJSN0bF1SGgTkziExHboRJsWlqoqH4qvwlfivdQpZBLjtAOXKJId20nev9_z83sAG36iETRkgaO0SwBFushzJnV4woUfZp7ISj9k_yjsnYi3p8HpCvyozsJQWGUlE0tBrceKfOTbXJLHCi_cRlAemPkM8dn5y_1d_JmbnO-9Pt7pObaEgKNExAsHNUDm6Y5RLh1qyVwtI5lxP0syEblC-Bo1sJJhooNOJl0pXYHqNIn8xCO7Qoc-jtuefHWoShXt5tqSHddgFenc4w1Y3fmw-6ZXyX60fRZRjiGyLiWer0Ltg4C8DHxbhqjxpagpQasKrg8IhM_OaqbuxUDNtWk-SeazZDj8Qwvu3YKf1fdbBL982ZoW6Zb6fiG15P_zgW_DTWuQs-6Cg-7Aisnvwno3T4rxaM7arAyRLfce1uFjN2fvUMaO8IH3VI_KOUaZS7eFYVX5J9Yvi3IzRAPM5mhkr9BW0Gycs4UPB-8p3TfOyLrDz7ioYjC6BydX8ub3oZGPc_MAWEawUro8lV4kjIpS5QsVmihKUx1o3zThRUUusbKp26mCyDAuIVwQxERcsSWuJmwue08WKUv-0u85UV5MkgxHU4k9kIFropxgcRehNIJlhAhNaNV6ogRSteYNS7v_mK9VEV5sBeV5_JvqmvBs2UwTUPBfbsZT6uORHyIIcQhZY4jlfJQkvd6Snw3KZOkR2vt-6DehvWSdS1f58PJVPoW13nH_MD7cPzp4BDfoSdph4J0WNIpvU_MYTdQifWLlAoNPV808vwD6F5w0 |
| linkToPdf | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1bb9MwFLbGJi4v3AaiUMBI23hAWVPHsZsHhMpK2RgbaNrEJB5C4gudaNPCUlXlp_FX-DOckziFTGI87YGXKpId23HP7Ts-PoeQtSDRABps6CntI0CRPvCcST2WMB4I2-a28EPu7YvtI_7mODxeIj-quzAYVlnJxEJQ67FCH3mLSfRYwQ9rWRcW8b7XfzH56mEFKTxprcpplCSya-YzgG-nz3d68F-vM9Z_dbi17bkKA57iEcs9UBC2rTtG-XjnxfpaRtKywCaWRz7ngQYFraRIdNix0pfS56BtkyhI2mh2aBHAuJfISkdIAUJhZetD7_V2pQfADiojHgWwMSahr8LuwxA9DqwlBWh_yWsK0amFywME5LOTmtl7Nmjz6jSbJPNZMhz-oRH7N8jPai_LQJgvm9M83VTfz6SZ_D83-ya57gx12i056xZZMtltstrNknw8mtMNWoTOFmcSq-RjN6PvQPaO4IUDrFPlHYIsxsfc0KosFN0rinVTQAnU5W6kL8GG0HSc0dK3A8-YBhxmpN3hZ9iEfDC6Q44u5DPvkuVsnJl7hFqEm9JnqWxH3KgoVQFXwkRRmupQB6ZBnlWkEyuX0h0riwzjAtqFYYyEFjtCa5D1Re9JmcrkL_2eIhXGKOFgNJW4ixqwJswVFncBYgOIBujQIM1aT5BMqta85uj4H_M1KyKMnQA9jX9TYIM8WTTjBBgUmJnxFPu00T8RChhC1phjMR8mT6-3ZCeDIol6BDggEEGDbCzY6NxV3j9_lY_JFeCQ-O3O_u4Dcg1fxIMH1mmS5fzb1DwEyzVPHzkRQcmni2aUX8TlpPw |
| linkToUnpaywall | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3da9RAEF_qFdEXv6oYPWWFWh8k1yT7dcGnKJYitIr0oKIQNrtZ7_AuOdocpf71zuQ2pyn4gS_HHjvZSXZnduY37M4Qssu0BdDgRGhshABFRaBzZREmOuFMupi7Ng55dCwPJ_zdqTjdIq-6uzAWU8TX2p6PpohJL2btbu3n9XzfAFoEuJ7sKwmmU_HR0rprZFsKcMQHZHty_CH7hBBLgupg4vefbcW6Y-9C9IboGSS_LV_3zHtu59VDkzdW1VJfXuj5_BeLdHCbfOm-ZX0Q5dto1RQj8_1Kmsf__Ng75Jb3VGm2Fq27ZKus7pGdrAKUvrike7Q9O9oG5XfI56yi72HzWcADH7FQU3gCmxE2m5J2dZHoUVutmoKbTH3yQvoajKildUXXwQ1oYx5s4Eiz-df6bNZMF_fJ5ODtyZvD0JdtCA1PkyYEq-tiOy5NhBeJXGRVqlzCnHY8jThnFrweo6S2YuxUpFTEwYXRKdMx-nJWsgdkUNVV-ZBQh3hLRUmh4pSXJi0M40aWaVoUVlhWBuRlt3a58TnNsbTGPG-xjRA5zl_u5y8gzzfUy3Uuj9_QvUAxyFHFYTSj_U0FeCdMlpVngDEBRYLvHJBhjxJU0_S6d_3C_oXfsJOyvFv8PFEYoYWfJCDPNt3IAE_FVWW9QpoYAbqQMITqSeeGH2YP7_dUs2mbRTwFR5hJFpC9jRz_8S0f_SvhY3IT_2LgPRkPyaA5W5VPwHNriqdeQ38Aclk9GA |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=An+Optimal+Round-Trip+Route+Planning+Method+for+Tourism+Based+on+Improved+Genetic+Algorithm&rft.jtitle=Computational+intelligence+and+neuroscience&rft.au=Cao%2C+Sha&rft.date=2022-08-28&rft.pub=John+Wiley+%26+Sons%2C+Inc&rft.issn=1687-5265&rft.volume=2022&rft_id=info:doi/10.1155%2F2022%2F7665874&rft.externalDocID=A716148139 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1687-5265&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1687-5265&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1687-5265&client=summon |