{"id":"https://openalex.org/W2955772172","doi":"https://doi.org/10.1142/s1469026819500160","title":"Frequency Graphs for Travelling Salesman Problem Based on Ant Colony Optimization","display_name":"Frequency Graphs for Travelling Salesman Problem Based on Ant Colony Optimization","publication_year":2019,"publication_date":"2019-07-04","ids":{"openalex":"https://openalex.org/W2955772172","doi":"https://doi.org/10.1142/s1469026819500160","mag":"2955772172"},"language":"en","primary_location":{"id":"doi:10.1142/s1469026819500160","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1469026819500160","pdf_url":null,"source":{"id":"https://openalex.org/S206936884","display_name":"International Journal of Computational Intelligence and Applications","issn_l":"1469-0268","issn":["1469-0268","1757-5885"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311754","host_organization_name":"Imperial College Press","host_organization_lineage":["https://openalex.org/P4310311754"],"host_organization_lineage_names":["Imperial College Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Intelligence and Applications","raw_type":"journal-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/A5101672620","display_name":"Yong Wang","orcid":"https://orcid.org/0000-0003-2792-3772"},"institutions":[{"id":"https://openalex.org/I153473198","display_name":"North China Electric Power University","ror":"https://ror.org/04qr5t414","country_code":"CN","type":"education","lineage":["https://openalex.org/I153473198"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Yong Wang","raw_affiliation_strings":["School of Renewable Energy, North China Electric Power University, No.2, Huilongguan, Changping Beijing, 102206, China"],"affiliations":[{"raw_affiliation_string":"School of Renewable Energy, North China Electric Power University, No.2, Huilongguan, Changping Beijing, 102206, China","institution_ids":["https://openalex.org/I153473198"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100643546","display_name":"Yiwen Wu","orcid":"https://orcid.org/0000-0003-1304-7636"},"institutions":[{"id":"https://openalex.org/I153473198","display_name":"North China Electric Power University","ror":"https://ror.org/04qr5t414","country_code":"CN","type":"education","lineage":["https://openalex.org/I153473198"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yiwen Wu","raw_affiliation_strings":["School of Renewable Energy, North China Electric Power University, No.2, Huilongguan, Changping Beijing, 102206, China"],"affiliations":[{"raw_affiliation_string":"School of Renewable Energy, North China Electric Power University, No.2, Huilongguan, Changping Beijing, 102206, China","institution_ids":["https://openalex.org/I153473198"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5101672620"],"corresponding_institution_ids":["https://openalex.org/I153473198"],"apc_list":null,"apc_paid":null,"fwci":0.28,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.64778666,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"18","issue":"03","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9908000230789185,"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"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9908000230789185,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9908000230789185,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9506000280380249,"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/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.9095807075500488},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.6964238882064819},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.6661093235015869},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5609684586524963},{"id":"https://openalex.org/keywords/extremal-optimization","display_name":"Extremal optimization","score":0.5605531334877014},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5422528386116028},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.5107519626617432},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.48325496912002563},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4801556468009949},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.47720035910606384},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.46135401725769043},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4367501437664032},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.3851619064807892},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.340406596660614},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3198593258857727}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.9095807075500488},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.6964238882064819},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.6661093235015869},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5609684586524963},{"id":"https://openalex.org/C188919014","wikidata":"https://www.wikidata.org/wiki/Q5422296","display_name":"Extremal optimization","level":4,"score":0.5605531334877014},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5422528386116028},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.5107519626617432},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.48325496912002563},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4801556468009949},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.47720035910606384},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.46135401725769043},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4367501437664032},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3851619064807892},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.340406596660614},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3198593258857727},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s1469026819500160","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1469026819500160","pdf_url":null,"source":{"id":"https://openalex.org/S206936884","display_name":"International Journal of Computational Intelligence and Applications","issn_l":"1469-0268","issn":["1469-0268","1757-5885"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311754","host_organization_name":"Imperial College Press","host_organization_lineage":["https://openalex.org/P4310311754"],"host_organization_lineage_names":["Imperial College Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Intelligence and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1247959265","display_name":null,"funder_award_id":"2018ZD09","funder_id":"https://openalex.org/F4320335787","funder_display_name":"Fundamental Research Funds for the Central Universities"},{"id":"https://openalex.org/G7295788081","display_name":null,"funder_award_id":"2015ZD10","funder_id":"https://openalex.org/F4320335787","funder_display_name":"Fundamental Research Funds for the Central Universities"}],"funders":[{"id":"https://openalex.org/F4320335787","display_name":"Fundamental Research Funds for the Central Universities","ror":null}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W268194639","https://openalex.org/W1571087346","https://openalex.org/W1573676079","https://openalex.org/W1927341089","https://openalex.org/W1965255372","https://openalex.org/W1969186119","https://openalex.org/W1971483538","https://openalex.org/W1977536632","https://openalex.org/W2007192625","https://openalex.org/W2015057142","https://openalex.org/W2017708378","https://openalex.org/W2018099601","https://openalex.org/W2045749371","https://openalex.org/W2063914115","https://openalex.org/W2078551046","https://openalex.org/W2095134601","https://openalex.org/W2105112568","https://openalex.org/W2116501956","https://openalex.org/W2119998894","https://openalex.org/W2125694129","https://openalex.org/W2144643443","https://openalex.org/W2150367356","https://openalex.org/W2154929945","https://openalex.org/W2737185337"],"related_works":["https://openalex.org/W2946024655","https://openalex.org/W3001379520","https://openalex.org/W3013791021","https://openalex.org/W2146364482","https://openalex.org/W1604040598","https://openalex.org/W4246557197","https://openalex.org/W2572756133","https://openalex.org/W2099174039","https://openalex.org/W2075572857","https://openalex.org/W2614086467"],"abstract_inverted_index":{"Traveling":[0],"salesman":[1],"problem":[2],"(TSP)":[3],"is":[4,16,21,103,137],"a":[5,24,32],"typical":[6],"combinatorial":[7],"optimization":[8,102],"problem.":[9],"A":[10],"heuristic":[11,91],"model":[12],"called":[13],"frequency":[14,114,135],"graph":[15,136,141],"introduced":[17],"for":[18,97,125,143],"TSP.":[19,98],"It":[20],"computed":[22],"with":[23,54,63,120],"set":[25,44],"of":[26,45,52,71,80,82,94],"optimal":[27,56],"i-vertex":[28],"paths":[29],"(OP)":[30],"in":[31],"weighted":[33,123,140],"graph.":[34,115],"The":[35,47,99,116,129],"frequencies":[36,70],"on":[37,112],"the":[38,43,55,64,69,72,83,90,113,134,147],"edges":[39,53,74],"are":[40,75,87,118],"enumerated":[41],"from":[42],"OPs.":[46],"OPs":[48],"have":[49],"more":[50],"intersections":[51],"Hamiltonian":[57,66],"cycle":[58],"(OHC)":[59],"than":[60,78,139],"they":[61],"do":[62],"other":[65,84],"cycles.":[67],"Thus,":[68],"OHC":[73,110],"generally":[76],"bigger":[77],"those":[79,121],"most":[81,144],"edges.":[85],"They":[86],"taken":[88],"as":[89],"information":[92],"instead":[93],"edges\u2019":[95],"weights":[96],"ant":[100],"colony":[101],"used":[104],"to":[105],"find":[106],"an":[107],"approximation":[108],"or":[109],"based":[111],"solutions":[117],"compared":[119],"using":[122],"graphs":[124],"certain":[126],"TSP":[127],"instances.":[128],"experimental":[130],"results":[131],"show":[132],"that":[133],"better":[138],"(WG)":[142],"TSPs":[145],"under":[146],"same":[148],"preconditions.":[149]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}