{"id":"https://openalex.org/W2886782012","doi":"https://doi.org/10.12783/dtcse/mso2018/20492","title":"Interest Tourism Route Plan Algorithm Based on Improved Minimum Spanning Tree","display_name":"Interest Tourism Route Plan Algorithm Based on Improved Minimum Spanning Tree","alternate_titles":[],"publication_year":2018,"publication_date":"2018-04-06","ids":{"openalex":"https://openalex.org/W2886782012","doi":"https://doi.org/10.12783/dtcse/mso2018/20492","mag":"2886782012"},"language":"en","primary_location":{"id":"doi:10.12783/dtcse/mso2018/20492","doi":"https://doi.org/10.12783/dtcse/mso2018/20492","is_oa":true,"landing_page_url":"https://doi.org/10.12783/dtcse/mso2018/20492","pdf_url":null,"source":{"id":"https://openalex.org/S2764550102","display_name":"DEStech Transactions on Computer Science and Engineering","issn_l":"2475-8841","issn":["2475-8841"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4322697008","host_organization_name":"Destech Publications","host_organization_lineage":["https://openalex.org/P4322697008"],"host_organization_lineage_names":["Destech Publications"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DEStech Transactions on Computer Science and Engineering","raw_type":"journal-article"},"parent_works":[],"lineage":["https://openalex.org/W2886782012"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.12783/dtcse/mso2018/20492","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5032045674","display_name":"Xiao Bo Zhou","orcid":"https://orcid.org/0000-0003-4493-2785","observed_orcids":["https://orcid.org/0000-0003-4493-2785"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xiao ZHOU","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005696022","display_name":"Jia Kate Yang","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jia YANG","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090729077","display_name":"Jia-jun WU","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jia-jun WU","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049850592","display_name":"Zhigang Shi","orcid":"https://orcid.org/0000-0002-5700-9351","observed_orcids":["https://orcid.org/0000-0002-5700-9351"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhi-gang SHI","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024244142","display_name":"Kui-liang GAO","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kui-liang GAO","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5042308310","display_name":"Hang-wei LIU","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hang-wei LIU","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":"mso","first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10203","display_name":"Recommender Systems and Techniques","score":0.21240000426769257,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10203","display_name":"Recommender Systems and Techniques","score":0.21240000426769257,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10055","display_name":"Diverse Aspects of Tourism Research","score":0.16200000047683716,"subfield":{"id":"https://openalex.org/subfields/1409","display_name":"Tourism, Leisure and Hospitality Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.11990000307559967,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/tourist-route-planning","display_name":"tourism route planning","score":0.9670000076293945},{"id":"https://openalex.org/keywords/tourist-motivation","display_name":"tourist motivation","score":0.4830000102519989},{"id":"https://openalex.org/keywords/optimal-path-selection","display_name":"optimal path selection","score":0.5659999847412109},{"id":"https://openalex.org/keywords/sightseeing-spots","display_name":"sightseeing spots","score":0.515999972820282}],"concepts":[{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.8055596351623535},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.727912187576294},{"id":"https://openalex.org/C18918823","wikidata":"https://www.wikidata.org/wiki/Q49389","display_name":"Tourism","level":2,"score":0.6657710075378418},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.6485487222671509},{"id":"https://openalex.org/C2776505523","wikidata":"https://www.wikidata.org/wiki/Q4785468","display_name":"Plan (archaeology)","level":2,"score":0.620609700679779},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.6020976901054382},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5992485880851746},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.50221848487854},{"id":"https://openalex.org/C1649724","wikidata":"https://www.wikidata.org/wiki/Q470813","display_name":"Prim's algorithm","level":4,"score":0.501563310623169},{"id":"https://openalex.org/C2989549987","wikidata":"https://www.wikidata.org/wiki/Q350882","display_name":"Route planning","level":2,"score":0.4779662787914276},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.47387930750846863},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.42941349744796753},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.4180167317390442},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.4101472795009613},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3765978515148163},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24820002913475037},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.10681870579719543},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.09049570560455322},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.08473002910614014},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.12783/dtcse/mso2018/20492","doi":"https://doi.org/10.12783/dtcse/mso2018/20492","is_oa":true,"landing_page_url":"https://doi.org/10.12783/dtcse/mso2018/20492","pdf_url":null,"source":{"id":"https://openalex.org/S2764550102","display_name":"DEStech Transactions on Computer Science and Engineering","issn_l":"2475-8841","issn":["2475-8841"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4322697008","host_organization_name":"Destech Publications","host_organization_lineage":["https://openalex.org/P4322697008"],"host_organization_lineage_names":["Destech Publications"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DEStech Transactions on Computer Science and Engineering","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.12783/dtcse/mso2018/20492","doi":"https://doi.org/10.12783/dtcse/mso2018/20492","is_oa":true,"landing_page_url":"https://doi.org/10.12783/dtcse/mso2018/20492","pdf_url":null,"source":{"id":"https://openalex.org/S2764550102","display_name":"DEStech Transactions on Computer Science and Engineering","issn_l":"2475-8841","issn":["2475-8841"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4322697008","host_organization_name":"Destech Publications","host_organization_lineage":["https://openalex.org/P4322697008"],"host_organization_lineage_names":["Destech Publications"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DEStech Transactions on Computer Science and Engineering","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","score":0.428600013256073,"display_name":"Industry, innovation and infrastructure"}],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2801192767","https://openalex.org/W3044766514","https://openalex.org/W4292484404","https://openalex.org/W2939590235","https://openalex.org/W2996063062","https://openalex.org/W4226127836","https://openalex.org/W3007473355","https://openalex.org/W7138847081","https://openalex.org/W4285796626","https://openalex.org/W4408459511"],"abstract_inverted_index":{"Currently,":[0],"tourism":[1,26,37,84],"route":[2,27,67,85],"plan":[3,28],"lacks":[4],"of":[5,13,55],"individuality,":[6],"which":[7,94],"can":[8,80],"hardly":[9],"meet":[10,87],"the":[11,19,63,72,82,88],"needs":[12],"tourists\u2019":[14],"motive":[15,90],"benefits.":[16],"Aim":[17],"at":[18],"problem,":[20],"this":[21],"paper":[22],"brings":[23],"forward":[24],"interest":[25,38],"algorithm":[29,79],"based":[30],"on":[31,45,51],"improved":[32],"minimum":[33,52],"spanning":[34,53,64,74],"tree.":[35],"Firstly,":[36],"feature":[39],"model":[40],"is":[41,95],"set":[42],"up.":[43],"Based":[44],"each":[46],"influence":[47],"factor,":[48],"iteration":[49],"values":[50],"trees":[54],"different":[56],"start":[57],"sight":[58],"spots":[59],"are":[60],"obtained.":[61],"Select":[62],"tree":[65,75],"and":[66,76,97],"with":[68],"maximum":[69],"value":[70],"as":[71],"optimal":[73,83],"route.":[77],"This":[78],"get":[81],"to":[86],"best":[89],"benefits":[91],"for":[92],"tourists,":[93],"feasible":[96],"practical.":[98]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2886782012","counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":2}],"updated_date":"2026-11-14T11:04:58.165337","created_date":"2018-08-22T00:00:00"}
