{"id":"https://openalex.org/W2545776271","doi":"https://doi.org/10.1109/isic.2003.1254722","title":"An accelerated ant colony algorithm for complex nonlinear system optimization","display_name":"An accelerated ant colony algorithm for complex nonlinear system optimization","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W2545776271","doi":"https://doi.org/10.1109/isic.2003.1254722","mag":"2545776271"},"language":"en","primary_location":{"id":"doi:10.1109/isic.2003.1254722","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isic.2003.1254722","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2003 IEEE International Symposium on Intelligent Control ISIC-03","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/A5103719913","display_name":"Yanjun Li","orcid":null},"institutions":[{"id":"https://openalex.org/I168719708","display_name":"City University of Hong Kong","ror":"https://ror.org/03q8dnn23","country_code":"HK","type":"education","lineage":["https://openalex.org/I168719708"]}],"countries":["HK"],"is_corresponding":true,"raw_author_name":"Yanjun Li","raw_affiliation_strings":["Department of Electronic Engineering, City University of Hong Kong, Hong Kong, China"],"affiliations":[{"raw_affiliation_string":"Department of Electronic Engineering, City University of Hong Kong, Hong Kong, China","institution_ids":["https://openalex.org/I168719708"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103562825","display_name":"WU Tie-jun","orcid":null},"institutions":[{"id":"https://openalex.org/I55712492","display_name":"Zhejiang University of Technology","ror":"https://ror.org/02djqfd08","country_code":"CN","type":"education","lineage":["https://openalex.org/I55712492"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Tie-Jun Wu","raw_affiliation_strings":["National Laboratory for Industrial Control Technology, University of Zhejiang, Hangzhou, China"],"affiliations":[{"raw_affiliation_string":"National Laboratory for Industrial Control Technology, University of Zhejiang, Hangzhou, China","institution_ids":["https://openalex.org/I55712492"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062944003","display_name":"David J. Hill","orcid":"https://orcid.org/0000-0003-4036-0839"},"institutions":[{"id":"https://openalex.org/I168719708","display_name":"City University of Hong Kong","ror":"https://ror.org/03q8dnn23","country_code":"HK","type":"education","lineage":["https://openalex.org/I168719708"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"D.J. Hill","raw_affiliation_strings":["Department of Electronic Engineering, City University of Hong Kong, Hong Kong, China"],"affiliations":[{"raw_affiliation_string":"Department of Electronic Engineering, City University of Hong Kong, Hong Kong, China","institution_ids":["https://openalex.org/I168719708"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5103719913"],"corresponding_institution_ids":["https://openalex.org/I168719708"],"apc_list":null,"apc_paid":null,"fwci":1.4045,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.8630237,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"17","issue":null,"first_page":"709","last_page":"713"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9997000098228455,"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.9997000098228455,"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.9944999814033508,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9829999804496765,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.8422955870628357},{"id":"https://openalex.org/keywords/parallel-metaheuristic","display_name":"Parallel metaheuristic","score":0.6977062225341797},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.6554206609725952},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6322435736656189},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6146323084831238},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6071571707725525},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.540913462638855},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.5063132047653198},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4711025357246399},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.46742552518844604},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.45976489782333374},{"id":"https://openalex.org/keywords/swarm-intelligence","display_name":"Swarm intelligence","score":0.44906702637672424},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.4339355528354645},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4184590280056},{"id":"https://openalex.org/keywords/meta-optimization","display_name":"Meta-optimization","score":0.410871684551239},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2856065630912781},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21213975548744202},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.06328582763671875}],"concepts":[{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.8422955870628357},{"id":"https://openalex.org/C28767586","wikidata":"https://www.wikidata.org/wiki/Q7135006","display_name":"Parallel metaheuristic","level":4,"score":0.6977062225341797},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.6554206609725952},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6322435736656189},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6146323084831238},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6071571707725525},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.540913462638855},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.5063132047653198},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4711025357246399},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.46742552518844604},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.45976489782333374},{"id":"https://openalex.org/C119487961","wikidata":"https://www.wikidata.org/wiki/Q863960","display_name":"Swarm intelligence","level":3,"score":0.44906702637672424},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.4339355528354645},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4184590280056},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.410871684551239},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2856065630912781},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21213975548744202},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.06328582763671875},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"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/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/isic.2003.1254722","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isic.2003.1254722","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2003 IEEE International Symposium on Intelligent Control ISIC-03","raw_type":"proceedings-article"},{"id":"pmh:oai:openresearch-repository.anu.edu.au:1885/55968","is_oa":false,"landing_page_url":"http://hdl.handle.net/1885/55968","pdf_url":null,"source":{"id":"https://openalex.org/S4306402539","display_name":"ANU Open Research (Australian National University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I118347636","host_organization_name":"Australian National University","host_organization_lineage":["https://openalex.org/I118347636"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"An Accelerated Ant Colony Algorithm for Complex Nonlinear System Optimization","raw_type":"Conference paper"},{"id":"pmh:oai:openresearch-repository.anu.edu.au:1885/733798630","is_oa":false,"landing_page_url":"https://hdl.handle.net/1885/733798630","pdf_url":null,"source":{"id":"https://openalex.org/S4306402539","display_name":"ANU Open Research (Australian National University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I118347636","host_organization_name":"Australian National University","host_organization_lineage":["https://openalex.org/I118347636"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Conference paper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1492640216","https://openalex.org/W1801849579","https://openalex.org/W1852107442","https://openalex.org/W2017938154","https://openalex.org/W2063047454","https://openalex.org/W2070878875","https://openalex.org/W2107941094","https://openalex.org/W2141426250","https://openalex.org/W2151758915","https://openalex.org/W2911304819","https://openalex.org/W6629566668"],"related_works":["https://openalex.org/W2978078020","https://openalex.org/W2361792200","https://openalex.org/W2391112633","https://openalex.org/W2104257932","https://openalex.org/W2016475942","https://openalex.org/W2777482433","https://openalex.org/W2394153495","https://openalex.org/W2388217074","https://openalex.org/W2363465025","https://openalex.org/W2300135944"],"abstract_inverted_index":{"Ant":[0],"colony":[1,24,84,117],"algorithms":[2],"as":[3,150],"a":[4,40,81,87],"category":[5],"of":[6,68,74],"evolutionary":[7],"computational":[8],"intelligence":[9],"can":[10,57],"deal":[11],"with":[12,80,97,108,127,133],"complex":[13,33,128,135],"optimization":[14,19,36,110,131,145,152],"problems":[15,37,96,132,146],"better":[16],"than":[17],"traditional":[18,109],"techniques.":[20],"An":[21],"accelerated":[22],"ant":[23,83,116],"algorithm":[25,77,85,121],"is":[26,78,139],"proposed":[27,76,120],"in":[28,92,106,125,141,147],"this":[29],"paper":[30],"to":[31,50],"tackle":[32],"nonlinear":[34,129,144],"system":[35,130],"by":[38],"using":[39],"new":[41],"objective-function-based":[42],"heuristic":[43],"pheromone":[44,48],"assignment":[45],"approach":[46,91],"for":[47],"update":[49],"filtrate":[51],"solution":[52,136],"candidates.":[53],"Global":[54],"optimal":[55],"solutions":[56],"be":[58],"obtained":[59],"more":[60],"efficiently":[61],"through":[62],"self-adjusting":[63],"the":[64,69,75,119],"path":[65],"searching":[66],"behaviors":[67],"artificial":[70],"ants.":[71],"The":[72,100],"performance":[73],"compared":[79],"basic":[82,115],"and":[86,112,138,153],"Square":[88],"Quadratic":[89],"Programming":[90],"solving":[93,142],"two":[94],"benchmark":[95],"multiple":[98],"extremes.":[99],"simulation":[101],"results":[102],"convectively":[103],"show":[104],"that,":[105],"comparison":[107],"approaches":[111],"currently":[113],"used":[114],"algorithms,":[118],"possess":[122],"prominent":[123],"capability":[124],"dealing":[126],"extremely":[134],"structures":[137],"applicable":[140],"complicated":[143],"practice":[148],"such":[149],"network":[151],"transportation":[154],"problems.":[155]},"counts_by_year":[{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}