{"id":"https://openalex.org/W2787282612","doi":"https://doi.org/10.1109/ssci.2017.8280800","title":"A sugeno-based search width decay schedule in the ACO<inf>R</inf> algorithm","display_name":"A sugeno-based search width decay schedule in the ACO<inf>R</inf> algorithm","publication_year":2017,"publication_date":"2017-11-01","ids":{"openalex":"https://openalex.org/W2787282612","doi":"https://doi.org/10.1109/ssci.2017.8280800","mag":"2787282612"},"language":"en","primary_location":{"id":"doi:10.1109/ssci.2017.8280800","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ssci.2017.8280800","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE Symposium Series on Computational Intelligence (SSCI)","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/A5079888480","display_name":"Ashraf M. Abdelbar","orcid":"https://orcid.org/0000-0002-7921-1892"},"institutions":[{"id":"https://openalex.org/I48890080","display_name":"Brandon University","ror":"https://ror.org/02qp25a50","country_code":"CA","type":"education","lineage":["https://openalex.org/I48890080"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Ashraf M. Abdelbar","raw_affiliation_strings":["Dept. of Mathematics & Computer Science, Brandon University, Brandon, Manitoba, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Mathematics & Computer Science, Brandon University, Brandon, Manitoba, Canada","institution_ids":["https://openalex.org/I48890080"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101950185","display_name":"Khalid M. Salama","orcid":"https://orcid.org/0000-0001-7535-5154"},"institutions":[{"id":"https://openalex.org/I20581793","display_name":"University of Kent","ror":"https://ror.org/00xkeyj56","country_code":"GB","type":"education","lineage":["https://openalex.org/I20581793"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Khalid M. Salama","raw_affiliation_strings":["School of Computing, University of Kent, Canterbury, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computing, University of Kent, Canterbury, United Kingdom","institution_ids":["https://openalex.org/I20581793"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2065,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.67413631,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9993000030517578,"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.9993000030517578,"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.9617999792098999,"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/T10423","display_name":"Neurobiology and Insect Physiology Research","score":0.916700005531311,"subfield":{"id":"https://openalex.org/subfields/2804","display_name":"Cellular and Molecular Neuroscience"},"field":{"id":"https://openalex.org/fields/28","display_name":"Neuroscience"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6394425630569458},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.6250219941139221},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.57093346118927},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4548732042312622},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.44390103220939636},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.4406709372997284},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3693295121192932}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6394425630569458},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.6250219941139221},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.57093346118927},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4548732042312622},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.44390103220939636},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.4406709372997284},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3693295121192932},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ssci.2017.8280800","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ssci.2017.8280800","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE Symposium Series on Computational Intelligence (SSCI)","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":35,"referenced_works":["https://openalex.org/W12292379","https://openalex.org/W113285753","https://openalex.org/W118796026","https://openalex.org/W1497256448","https://openalex.org/W1551247482","https://openalex.org/W1556265791","https://openalex.org/W1580022276","https://openalex.org/W1598801990","https://openalex.org/W1953766815","https://openalex.org/W1985127868","https://openalex.org/W1988698908","https://openalex.org/W2047810585","https://openalex.org/W2069448304","https://openalex.org/W2070448096","https://openalex.org/W2076375504","https://openalex.org/W2082942022","https://openalex.org/W2108654603","https://openalex.org/W2133152516","https://openalex.org/W2145597414","https://openalex.org/W2152744490","https://openalex.org/W2153817143","https://openalex.org/W2165203444","https://openalex.org/W2165301864","https://openalex.org/W2166095939","https://openalex.org/W2244047465","https://openalex.org/W2294352625","https://openalex.org/W2521110226","https://openalex.org/W2557977866","https://openalex.org/W2585154133","https://openalex.org/W2746791058","https://openalex.org/W4285719527","https://openalex.org/W4299796063","https://openalex.org/W6604772054","https://openalex.org/W6633350825","https://openalex.org/W6690895747"],"related_works":["https://openalex.org/W2051058708","https://openalex.org/W1494268238","https://openalex.org/W154868527","https://openalex.org/W1983207144","https://openalex.org/W2490706771","https://openalex.org/W2480116122","https://openalex.org/W4255576661","https://openalex.org/W1516574938","https://openalex.org/W2625725254","https://openalex.org/W2563912921"],"abstract_inverted_index":{"ACO":[0,17,50,57,127],"R":[3,20,53,60,130],"is":[4,33],"a":[5,47,71,83,119],"fairly":[6],"recent":[7],"Ant":[8],"Colony":[9],"Optimization":[10],"(ACO)":[11],"algorithm":[12,131],"for":[13],"continuous":[14],"problem":[15],"domains.":[16],"'s":[21,61],"search":[22,32,62],"width":[23,63],"parameter":[24,64],"\u03be":[25],"controls":[26],"the":[27,31,36,78,98,125],"extent":[28],"to":[29,118],"which":[30,56],"concentrated":[34],"around":[35],"best":[37],"solutions":[38,114],"encountered":[39],"so":[40],"far.":[41],"In":[42,77],"previous":[43],"work,":[44,80],"we":[45,81],"proposed":[46],"variation":[48],"of":[49,100],",":[54],"in":[55,74,97],"decays":[65],"over":[66],"time,":[67],"being":[68],"reduced":[69],"by":[70],"fixed":[72],"fraction":[73],"each":[75],"iteration.":[76],"present":[79],"propose":[82],"parameterized":[84],"decay":[85],"schedule":[86],"based":[87],"on":[88],"Sugeno's":[89],"fuzzy":[90],"complement":[91],"operator.":[92],"We":[93,108],"evaluate":[94],"our":[95,111,133],"proposal":[96],"context":[99],"neural":[101],"network":[102],"training":[103],"using":[104],"36":[105],"popular":[106],"datasets.":[107],"find":[109],"that":[110,115],"approach":[112],"produces":[113],"are":[116],"better,":[117],"statistically":[120],"significant":[121],"extent,":[122],"than":[123],"both":[124],"standard":[126],"and":[132],"previously-proposed":[134],"variation.":[135]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}