{"id":"https://openalex.org/W2514131115","doi":"https://doi.org/10.1109/icis.2016.7550780","title":"An improvement of partheno-genetic algorithm to solve multiple travelling salesmen problem","display_name":"An improvement of partheno-genetic algorithm to solve multiple travelling salesmen problem","publication_year":2016,"publication_date":"2016-06-01","ids":{"openalex":"https://openalex.org/W2514131115","doi":"https://doi.org/10.1109/icis.2016.7550780","mag":"2514131115"},"language":"en","primary_location":{"id":"doi:10.1109/icis.2016.7550780","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icis.2016.7550780","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE/ACIS 15th International Conference on Computer and Information Science (ICIS)","raw_type":"proceedings-article"},"type":"article","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/A5022868184","display_name":"Honglu Zhou","orcid":null},"institutions":[{"id":"https://openalex.org/I75689368","display_name":"Communication University of China","ror":"https://ror.org/04facbs33","country_code":"CN","type":"education","lineage":["https://openalex.org/I75689368"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Honglu Zhou","raw_affiliation_strings":["School of computer science, Communication University of China, Beijing, China"],"affiliations":[{"raw_affiliation_string":"School of computer science, Communication University of China, Beijing, China","institution_ids":["https://openalex.org/I75689368"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5042449002","display_name":"Mingli Song","orcid":null},"institutions":[{"id":"https://openalex.org/I75689368","display_name":"Communication University of China","ror":"https://ror.org/04facbs33","country_code":"CN","type":"education","lineage":["https://openalex.org/I75689368"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Mingli Song","raw_affiliation_strings":["School of computer science, Communication University of China, Beijing, China"],"affiliations":[{"raw_affiliation_string":"School of computer science, Communication University of China, Beijing, China","institution_ids":["https://openalex.org/I75689368"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5022868184"],"corresponding_institution_ids":["https://openalex.org/I75689368"],"apc_list":null,"apc_paid":null,"fwci":2.5071,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.90057497,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9940999746322632,"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"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9940999746322632,"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"}},{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9887999892234802,"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"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9815999865531921,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8974474668502808},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.6970235705375671},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6704641580581665},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.6513189077377319},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5458853244781494},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.49987268447875977},{"id":"https://openalex.org/keywords/lin\u2013kernighan-heuristic","display_name":"Lin\u2013Kernighan heuristic","score":0.443955659866333},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4214818477630615},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.41118037700653076},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3903208374977112}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8974474668502808},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.6970235705375671},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6704641580581665},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.6513189077377319},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5458853244781494},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.49987268447875977},{"id":"https://openalex.org/C103888782","wikidata":"https://www.wikidata.org/wiki/Q2835802","display_name":"Lin\u2013Kernighan heuristic","level":4,"score":0.443955659866333},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4214818477630615},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.41118037700653076},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3903208374977112}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icis.2016.7550780","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icis.2016.7550780","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE/ACIS 15th International Conference on Computer and Information Science (ICIS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.5600000023841858}],"awards":[],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320329139","display_name":"Communication University of China","ror":"https://ror.org/04facbs33"},{"id":"https://openalex.org/F4320335688","display_name":"Chinese Service Center for Scholarly Exchange","ror":null}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1585363783","https://openalex.org/W1981084155","https://openalex.org/W2008824533","https://openalex.org/W2044575427","https://openalex.org/W2090747348","https://openalex.org/W2101057866","https://openalex.org/W2111585582","https://openalex.org/W2133804955","https://openalex.org/W2152922390","https://openalex.org/W2157442606","https://openalex.org/W2160904149","https://openalex.org/W2162330812","https://openalex.org/W2163409911","https://openalex.org/W2167356205","https://openalex.org/W2169694673","https://openalex.org/W2170200240","https://openalex.org/W2305746546","https://openalex.org/W6673594244","https://openalex.org/W6683072616"],"related_works":["https://openalex.org/W4389782626","https://openalex.org/W1595757466","https://openalex.org/W2171568915","https://openalex.org/W4376138746","https://openalex.org/W2766731260","https://openalex.org/W2946024655","https://openalex.org/W4246557197","https://openalex.org/W2758988501","https://openalex.org/W3013791021","https://openalex.org/W2099174039"],"abstract_inverted_index":{"Traveling":[0],"salesman":[1],"problem":[2,8],"is":[3],"a":[4],"typical":[5],"combinatorial":[6],"optimization":[7],"which":[9],"can":[10],"be":[11],"effectively":[12],"solved":[13],"by":[14],"genetic":[15],"algorithm.":[16],"This":[17],"paper":[18],"proposes":[19],"an":[20],"improved":[21],"partheno-genetic":[22,36],"algorithm":[23,32,37],"to":[24],"solve":[25],"TSP":[26],"problem.":[27],"A":[28],"comparison":[29],"between":[30],"our":[31],"and":[33],"the":[34],"conventional":[35],"shows":[38],"its":[39],"effectiveness.":[40]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}