{"id":"https://openalex.org/W2085451151","doi":"https://doi.org/10.1145/1509315.1509316","title":"The personal tour planning engine based on genetic algorithm","display_name":"The personal tour planning engine based on genetic algorithm","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2085451151","doi":"https://doi.org/10.1145/1509315.1509316","mag":"2085451151"},"language":"en","primary_location":{"id":"doi:10.1145/1509315.1509316","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1509315.1509316","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2008 International Conference on Advanced Infocomm Technology - ICAIT '08","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5036989858","display_name":"Chuanchang Liu","orcid":"https://orcid.org/0000-0002-0418-9889"},"institutions":[{"id":"https://openalex.org/I139759216","display_name":"Beijing University of Posts and Telecommunications","ror":"https://ror.org/04w9fbh59","country_code":"CN","type":"education","lineage":["https://openalex.org/I139759216"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Chuanchang Liu","raw_affiliation_strings":["Beijing University of Posts and Telecommunications, Beijing, China","Beijing University of Posts and Telecommunications,Beijing,China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Beijing University of Posts and Telecommunications, Beijing, China","institution_ids":["https://openalex.org/I139759216"]},{"raw_affiliation_string":"Beijing University of Posts and Telecommunications,Beijing,China","institution_ids":["https://openalex.org/I139759216"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101979694","display_name":"Junliang Chen","orcid":"https://orcid.org/0000-0002-7147-2625"},"institutions":[{"id":"https://openalex.org/I139759216","display_name":"Beijing University of Posts and Telecommunications","ror":"https://ror.org/04w9fbh59","country_code":"CN","type":"education","lineage":["https://openalex.org/I139759216"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Junliang Chen","raw_affiliation_strings":["Beijing University of Posts and Telecommunications, Beijing, China","Beijing University of Posts and Telecommunications,Beijing,China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Beijing University of Posts and Telecommunications, Beijing, China","institution_ids":["https://openalex.org/I139759216"]},{"raw_affiliation_string":"Beijing University of Posts and Telecommunications,Beijing,China","institution_ids":["https://openalex.org/I139759216"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I139759216"],"apc_list":null,"apc_paid":null,"fwci":0.2607,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.42275656,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"5"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9570000171661377,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9570000171661377,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T14270","display_name":"Simulation and Modeling Applications","score":0.9427000284194946,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9261000156402588,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6905708909034729},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.6666034460067749},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.643890380859375},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6354489326477051},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.598948061466217},{"id":"https://openalex.org/keywords/plan","display_name":"Plan (archaeology)","score":0.5768004059791565},{"id":"https://openalex.org/keywords/personal-computer","display_name":"Personal computer","score":0.5513474941253662},{"id":"https://openalex.org/keywords/table","display_name":"Table (database)","score":0.4727892577648163},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.45714879035949707},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.44846659898757935},{"id":"https://openalex.org/keywords/prims-algorithm","display_name":"Prim's algorithm","score":0.4150931239128113},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.41118431091308594},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.31051450967788696},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.29525235295295715},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.2220079004764557},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1933417022228241},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.12450844049453735},{"id":"https://openalex.org/keywords/geography","display_name":"Geography","score":0.09665447473526001}],"concepts":[{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6905708909034729},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.6666034460067749},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.643890380859375},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6354489326477051},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.598948061466217},{"id":"https://openalex.org/C2776505523","wikidata":"https://www.wikidata.org/wiki/Q4785468","display_name":"Plan (archaeology)","level":2,"score":0.5768004059791565},{"id":"https://openalex.org/C2988821698","wikidata":"https://www.wikidata.org/wiki/Q16338","display_name":"Personal computer","level":2,"score":0.5513474941253662},{"id":"https://openalex.org/C45235069","wikidata":"https://www.wikidata.org/wiki/Q278425","display_name":"Table (database)","level":2,"score":0.4727892577648163},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.45714879035949707},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.44846659898757935},{"id":"https://openalex.org/C1649724","wikidata":"https://www.wikidata.org/wiki/Q470813","display_name":"Prim's algorithm","level":4,"score":0.4150931239128113},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.41118431091308594},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.31051450967788696},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29525235295295715},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.2220079004764557},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1933417022228241},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.12450844049453735},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.09665447473526001},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C9390403","wikidata":"https://www.wikidata.org/wiki/Q3966","display_name":"Computer hardware","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.1145/1509315.1509316","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1509315.1509316","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2008 International Conference on Advanced Infocomm Technology - ICAIT '08","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.5600000023841858}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1522546195","https://openalex.org/W1866154538","https://openalex.org/W2159267590","https://openalex.org/W3142267645"],"related_works":["https://openalex.org/W2387385213","https://openalex.org/W3011323517","https://openalex.org/W4242086819","https://openalex.org/W2899787781","https://openalex.org/W2074214908","https://openalex.org/W3101457564","https://openalex.org/W4387896093","https://openalex.org/W2898459690","https://openalex.org/W4380840098","https://openalex.org/W2130375301"],"abstract_inverted_index":{"The":[0],"personal":[1,38,117],"tour":[2,7,13,19,25,31,39,52,79,83,118],"planning":[3,40,119],"is":[4,41,49,55,75,87,111],"to":[5,17,22,29,50,76,113],"select":[6],"elements":[8,32,84],"for":[9],"tourists":[10],"from":[11],"the":[12,24,30,37,46,60,67,72,82,92,101,109,116],"integrated-information":[14],"database":[15],"according":[16,28,81],"their":[18],"requirements,":[20],"then":[21],"plan":[23],"time":[26],"table":[27],"selected.":[33],"In":[34],"this":[35],"paper,":[36],"divided":[42],"into":[43,59,91],"two":[44],"steps:":[45],"fist":[47],"one":[48,74],"choose":[51,77],"elements,":[53],"which":[54,86],"modeled":[56,88],"by":[57,66,89,100],"transforming":[58,90],"0-1":[61],"knapsack":[62],"problem":[63],"and":[64,98],"resolved":[65,99],"greedy":[68],"algorithm-based":[69],"genetic":[70,104],"algorithm;":[71],"second":[73],"a":[78],"route":[80],"chosen,":[85],"degree-constrained":[93],"multi-objective":[94],"minimum":[95],"spanning":[96,102],"tree":[97],"tree-based":[103],"algorithm.":[105],"Simulation":[106],"results":[107],"prove":[108],"method":[110],"able":[112],"deal":[114],"with":[115],"problem.":[120]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}