{"id":"https://openalex.org/W4415974615","doi":"https://doi.org/10.1016/j.procs.2025.09.217","title":"Modifying Ant Colony Optimization from Constructive to Local Search based approach : Application on large-scale problems","display_name":"Modifying Ant Colony Optimization from Constructive to Local Search based approach : Application on large-scale problems","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W4415974615","doi":"https://doi.org/10.1016/j.procs.2025.09.217"},"language":"en","primary_location":{"id":"doi:10.1016/j.procs.2025.09.217","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.procs.2025.09.217","pdf_url":null,"source":{"id":"https://openalex.org/S120348307","display_name":"Procedia Computer Science","issn_l":"1877-0509","issn":["1877-0509"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Procedia Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1016/j.procs.2025.09.217","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5082194420","display_name":"Samia Sammoud","orcid":"https://orcid.org/0000-0001-6557-5794"},"institutions":[{"id":"https://openalex.org/I83259278","display_name":"Manouba University","ror":"https://ror.org/0503ejf32","country_code":"TN","type":"education","lineage":["https://openalex.org/I83259278"]}],"countries":["TN"],"is_corresponding":true,"raw_author_name":"Samia Sammoud","raw_affiliation_strings":["National School of Computer Science University of Manouba Tunisia"],"affiliations":[{"raw_affiliation_string":"National School of Computer Science University of Manouba Tunisia","institution_ids":["https://openalex.org/I83259278"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081605634","display_name":"In\u00e8s Alaya","orcid":"https://orcid.org/0000-0002-7037-3326"},"institutions":[{"id":"https://openalex.org/I83259278","display_name":"Manouba University","ror":"https://ror.org/0503ejf32","country_code":"TN","type":"education","lineage":["https://openalex.org/I83259278"]}],"countries":["TN"],"is_corresponding":false,"raw_author_name":"Ines Alaya","raw_affiliation_strings":["National School of Computer Science University of Manouba Tunisia"],"affiliations":[{"raw_affiliation_string":"National School of Computer Science University of Manouba Tunisia","institution_ids":["https://openalex.org/I83259278"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5036389154","display_name":"Moncef Tagina","orcid":null},"institutions":[{"id":"https://openalex.org/I83259278","display_name":"Manouba University","ror":"https://ror.org/0503ejf32","country_code":"TN","type":"education","lineage":["https://openalex.org/I83259278"]}],"countries":["TN"],"is_corresponding":false,"raw_author_name":"Moncef Tagina","raw_affiliation_strings":["National School of Computer Science University of Manouba Tunisia"],"affiliations":[{"raw_affiliation_string":"National School of Computer Science University of Manouba Tunisia","institution_ids":["https://openalex.org/I83259278"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5082194420"],"corresponding_institution_ids":["https://openalex.org/I83259278"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.18193301,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"270","issue":null,"first_page":"965","last_page":"974"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9121000170707703,"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.9121000170707703,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.03999999910593033,"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"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.025699999183416367,"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/metaheuristic","display_name":"Metaheuristic","score":0.8352000117301941},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.7980999946594238},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.6176000237464905},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.6140000224113464},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.5480999946594238},{"id":"https://openalex.org/keywords/local-optimum","display_name":"Local optimum","score":0.5422999858856201},{"id":"https://openalex.org/keywords/parallel-metaheuristic","display_name":"Parallel metaheuristic","score":0.5069000124931335},{"id":"https://openalex.org/keywords/constructive","display_name":"Constructive","score":0.48100000619888306}],"concepts":[{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.8352000117301941},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.7980999946594238},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7860999703407288},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6589000225067139},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.6176000237464905},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.6140000224113464},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.5480999946594238},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.5422999858856201},{"id":"https://openalex.org/C28767586","wikidata":"https://www.wikidata.org/wiki/Q7135006","display_name":"Parallel metaheuristic","level":4,"score":0.5069000124931335},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.48100000619888306},{"id":"https://openalex.org/C58758708","wikidata":"https://www.wikidata.org/wiki/Q7240233","display_name":"Premature convergence","level":3,"score":0.46549999713897705},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4514000117778778},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4388999938964844},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.43140000104904175},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.38839998841285706},{"id":"https://openalex.org/C139807058","wikidata":"https://www.wikidata.org/wiki/Q352374","display_name":"Adaptation (eye)","level":2,"score":0.382099986076355},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.3490000069141388},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.3409999907016754},{"id":"https://openalex.org/C188919014","wikidata":"https://www.wikidata.org/wiki/Q5422296","display_name":"Extremal optimization","level":4,"score":0.3391000032424927},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.3264000117778778},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3237999975681305},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.3059000074863434},{"id":"https://openalex.org/C92995354","wikidata":"https://www.wikidata.org/wiki/Q5165499","display_name":"Continuous optimization","level":4,"score":0.260699987411499}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/j.procs.2025.09.217","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.procs.2025.09.217","pdf_url":null,"source":{"id":"https://openalex.org/S120348307","display_name":"Procedia Computer Science","issn_l":"1877-0509","issn":["1877-0509"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Procedia Computer Science","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/j.procs.2025.09.217","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.procs.2025.09.217","pdf_url":null,"source":{"id":"https://openalex.org/S120348307","display_name":"Procedia Computer Science","issn_l":"1877-0509","issn":["1877-0509"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Procedia Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1801849579","https://openalex.org/W1883019287","https://openalex.org/W1945980349","https://openalex.org/W2031308937","https://openalex.org/W2048698391","https://openalex.org/W2058569171","https://openalex.org/W2097377813","https://openalex.org/W2107941094","https://openalex.org/W2154929945","https://openalex.org/W2163428398","https://openalex.org/W2165613966","https://openalex.org/W2166992393","https://openalex.org/W2488912457","https://openalex.org/W2750711431","https://openalex.org/W2979619501","https://openalex.org/W3022559759","https://openalex.org/W4211130072","https://openalex.org/W4285734701"],"related_works":[],"abstract_inverted_index":{"Traditional":[0],"Ant":[1,67,82],"Colony":[2,68],"Optimization":[3,69],"algorithms":[4],"have":[5],"demonstrated":[6],"strong":[7],"performance":[8],"across":[9],"various":[10,130],"optimization":[11,84],"problems.":[12],"However,":[13],"they":[14],"are":[15,33,42],"prone":[16],"to":[17,36,71,89,100,119],"premature":[18],"convergence":[19],"and":[20],"their":[21],"computational":[22],"cost":[23],"increases":[24],"remarkably":[25],"as":[26],"the":[27,37,66,81,109,123,134],"problem":[28],"size":[29],"does.":[30],"These":[31],"limitations":[32],"largely":[34],"attributed":[35],"construction-based":[38,88],"approach,":[39],"where":[40],"solutions":[41,106],"rebuilt":[43],"from":[44,86],"scratch":[45],"in":[46],"each":[47],"cycle,":[48],"contrasting":[49],"with":[50],"local":[51,91,124],"search":[52,125],"methods":[53],"that":[54],"iteratively":[55],"refine":[56,101],"existing":[57],"solutions.":[58],"This":[59],"paper":[60],"introduces":[61],"a":[62,87,90,114],"novel":[63],"adaptation":[64],"of":[65,105],"metaheuristic":[70,85],"solve":[72],"large-scale":[73],"Traveling":[74],"Salesman":[75],"Problems.":[76],"The":[77],"proposed":[78,118],"Ant-ILS":[79],"modifies":[80],"colony":[83],"search-based":[92],"approach.":[93],"A":[94],"pheromone-guided":[95],"2-Opt":[96],"function":[97],"is":[98,117],"integrated":[99],"an":[102],"initial":[103],"population":[104],"generated":[107],"by":[108],"Nearest":[110],"Neighbor":[111],"heuristic.":[112],"Additionally,":[113],"simple":[115],"mechanism":[116],"mitigate":[120],"stagnation":[121],"during":[122],"process.":[126],"Experimental":[127],"evaluations":[128],"on":[129],"TSPLIB":[131],"instances":[132],"highlight":[133],"algorithm\u2019s":[135],"superior":[136],"performance,":[137],"showcasing":[138],"its":[139],"competitiveness":[140],"against":[141],"state-of-the-art":[142],"methods.":[143]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-11-06T00:00:00"}