{"id":"https://openalex.org/W2508789524","doi":"https://doi.org/10.1109/icis.2016.7550776","title":"A novel evolutionary algorithm for the homogeneous Probabilistic Traveling Salesman Problem","display_name":"A novel evolutionary algorithm for the homogeneous Probabilistic Traveling Salesman Problem","publication_year":2016,"publication_date":"2016-06-01","ids":{"openalex":"https://openalex.org/W2508789524","doi":"https://doi.org/10.1109/icis.2016.7550776","mag":"2508789524"},"language":"en","primary_location":{"id":"doi:10.1109/icis.2016.7550776","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icis.2016.7550776","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/A5002666498","display_name":"Michael Manuel Smith","orcid":null},"institutions":[{"id":"https://openalex.org/I99908691","display_name":"Yuan Ze University","ror":"https://ror.org/01fv1ds98","country_code":"TW","type":"education","lineage":["https://openalex.org/I99908691"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Michael Manuel Smith","raw_affiliation_strings":["Department of Industrial Engineering and Management, Yuan Ze University, Chung-Li, Tao Yuan, Taiwan, R.O.C"],"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering and Management, Yuan Ze University, Chung-Li, Tao Yuan, Taiwan, R.O.C","institution_ids":["https://openalex.org/I99908691"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034022089","display_name":"Yun Shiow Chen","orcid":null},"institutions":[{"id":"https://openalex.org/I99908691","display_name":"Yuan Ze University","ror":"https://ror.org/01fv1ds98","country_code":"TW","type":"education","lineage":["https://openalex.org/I99908691"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Yun Shiow Chen","raw_affiliation_strings":["Department of Industrial Engineering and Management, Yuan Ze University, Chung-Li, Tao Yuan, Taiwan, R.O.C"],"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering and Management, Yuan Ze University, Chung-Li, Tao Yuan, Taiwan, R.O.C","institution_ids":["https://openalex.org/I99908691"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5002666498"],"corresponding_institution_ids":["https://openalex.org/I99908691"],"apc_list":null,"apc_paid":null,"fwci":0.8357,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.78442354,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"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.9979000091552734,"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.9979000091552734,"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.9965999722480774,"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"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9879999756813049,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.7112892866134644},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7074370384216309},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.6122578382492065},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.5628024339675903},{"id":"https://openalex.org/keywords/tabu-search","display_name":"Tabu search","score":0.5220508575439453},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4908323884010315},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.45958462357521057},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.4419782757759094},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.4333193302154541},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.4271717369556427},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38324856758117676},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.37105005979537964},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.21323475241661072}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7112892866134644},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7074370384216309},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.6122578382492065},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.5628024339675903},{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.5220508575439453},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4908323884010315},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.45958462357521057},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.4419782757759094},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.4333193302154541},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.4271717369556427},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38324856758117676},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37105005979537964},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.21323475241661072}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icis.2016.7550776","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icis.2016.7550776","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":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1500165591","https://openalex.org/W1576498301","https://openalex.org/W1750249149","https://openalex.org/W1879570979","https://openalex.org/W1984036937","https://openalex.org/W2017066479","https://openalex.org/W2021473921","https://openalex.org/W2027954882","https://openalex.org/W2032200826","https://openalex.org/W2032555824","https://openalex.org/W2034027189","https://openalex.org/W2044009541","https://openalex.org/W2064535384","https://openalex.org/W2065335627","https://openalex.org/W2069657950","https://openalex.org/W2095134601","https://openalex.org/W2100605418","https://openalex.org/W2129557546","https://openalex.org/W2129968104","https://openalex.org/W2148386266","https://openalex.org/W2163428398","https://openalex.org/W2163528881","https://openalex.org/W2164172191","https://openalex.org/W2339986406","https://openalex.org/W4254560958","https://openalex.org/W6637745686"],"related_works":["https://openalex.org/W2991484371","https://openalex.org/W2519041592","https://openalex.org/W1967939489","https://openalex.org/W2303529426","https://openalex.org/W2079721241","https://openalex.org/W2324472571","https://openalex.org/W2946024655","https://openalex.org/W2185228534","https://openalex.org/W4210470436","https://openalex.org/W2758988501"],"abstract_inverted_index":{"Amid":[0],"the":[1,9,20,31,52,55,66,77,90,108,111,143,153,187,192,201],"most":[2],"widely":[3],"studied":[4],"NP-hard":[5],"combinatorial":[6],"optimization":[7],"problems,":[8],"Probabilistic":[10,56],"Traveling":[11,22,57],"Salesman":[12,23,58],"Problem":[13],"(PTSP),":[14],"which":[15,88,116],"is":[16,49,63,117,140,195],"an":[17],"extension":[18],"of":[19,54,110,145,148,184],"well-known":[21,134,149],"Problem,":[24],"offers":[25],"a":[26,40,83,196],"fundamental":[27],"basis":[28],"for":[29,51,199],"analyzing":[30],"stochastic":[32],"impacts":[33],"in":[34,76,93,113,119,131],"routing":[35],"problems.":[36],"In":[37],"this":[38],"paper,":[39],"new":[41,180],"meta-heuristic":[42,150],"approach,":[43],"Genetic":[44,171],"Minimum":[45,67],"Matrix":[46,68],"Search":[47,69,169],"(GMMS),":[48],"introduced":[50],"solution":[53,92,182],"Problem.":[59],"This":[60],"evolutionary":[61,125],"algorithm":[62,71,126,194],"founded":[64],"upon":[65],"construction":[70],"that":[72,191],"uses":[73,98],"dimension":[74],"reduction":[75],"matrix":[78,85],"edge":[79],"set":[80],"to":[81,106],"obtain":[82],"reduce":[84],"network":[86],"within":[87],"lies":[89],"optimal":[91],"whole":[94],"or":[95],"clusters.":[96],"GMMS":[97,193],"family":[99],"competitive":[100,197],"metamorphosis":[101],"and":[102],"short-term":[103],"memory":[104],"selection":[105],"maintain":[107],"diversity":[109],"population":[112],"each":[114],"generation":[115],"useful":[118],"avoiding":[120],"local":[121],"optimum.":[122],"The":[123],"proposed":[124],"showed":[127],"very":[128],"satisfactory":[129],"results":[130,144],"testing":[132],"on":[133],"benchmark":[135],"problems":[136],"from":[137,152],"TSPLIB.":[138],"Comparisons":[139],"performed":[141],"with":[142],"numerous":[146],"implementations":[147],"approaches":[151],"literature,":[154],"such":[155],"as;":[156],"Honey":[157],"Bee":[158],"Mating":[159],"Optimization,":[160,163,175],"Particle":[161],"Swarm":[162],"Tabu":[164],"Search,":[165],"Greedy":[166],"Randomized":[167],"Adaptive":[168],"Procedure,":[170],"Algorithm,":[172],"Ant":[173],"Colony":[174],"etc.":[176],"Having":[177],"found":[178],"9":[179],"best":[181],"out":[183],"20":[185],"cases,":[186],"computational":[188],"study":[189],"shows":[190],"tool":[198],"solving":[200],"PTSP.":[202]},"counts_by_year":[{"year":2018,"cited_by_count":2}],"updated_date":"2026-02-24T19:35:01.260952","created_date":"2025-10-10T00:00:00"}