{"id":"https://openalex.org/W4388997841","doi":"https://doi.org/10.1007/s00521-023-09195-4","title":"Ant colony optimization for Chinese postman problem","display_name":"Ant colony optimization for Chinese postman problem","publication_year":2023,"publication_date":"2023-11-25","ids":{"openalex":"https://openalex.org/W4388997841","doi":"https://doi.org/10.1007/s00521-023-09195-4"},"language":"en","primary_location":{"id":"doi:10.1007/s00521-023-09195-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00521-023-09195-4","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00521-023-09195-4.pdf","source":{"id":"https://openalex.org/S147897268","display_name":"Neural Computing and Applications","issn_l":"0941-0643","issn":["0941-0643","1433-3058"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Neural Computing and Applications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00521-023-09195-4.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5051530850","display_name":"Giacinto Angelo Sgarro","orcid":"https://orcid.org/0000-0002-4189-0674"},"institutions":[{"id":"https://openalex.org/I106296451","display_name":"University of Foggia","ror":"https://ror.org/01xtv3204","country_code":"IT","type":"education","lineage":["https://openalex.org/I106296451"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Giacinto Angelo Sgarro","raw_affiliation_strings":["Department of Economics, Management and Territory (DEMeT), University of Foggia, Via A. Da Zara, 11, 71121, Foggia, FG, Italy"],"raw_orcid":"https://orcid.org/0000-0002-4189-0674","affiliations":[{"raw_affiliation_string":"Department of Economics, Management and Territory (DEMeT), University of Foggia, Via A. Da Zara, 11, 71121, Foggia, FG, Italy","institution_ids":["https://openalex.org/I106296451"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5082291195","display_name":"Luca Grilli","orcid":"https://orcid.org/0000-0003-4550-9276"},"institutions":[{"id":"https://openalex.org/I106296451","display_name":"University of Foggia","ror":"https://ror.org/01xtv3204","country_code":"IT","type":"education","lineage":["https://openalex.org/I106296451"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Luca Grilli","raw_affiliation_strings":["Department of Economics, Management and Territory (DEMeT), University of Foggia, Via A. Da Zara, 11, 71121, Foggia, FG, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Economics, Management and Territory (DEMeT), University of Foggia, Via A. Da Zara, 11, 71121, Foggia, FG, Italy","institution_ids":["https://openalex.org/I106296451"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5051530850"],"corresponding_institution_ids":["https://openalex.org/I106296451"],"apc_list":{"value":2990,"currency":"USD","value_usd":2990},"apc_paid":{"value":2990,"currency":"USD","value_usd":2990},"fwci":1.8405,"has_fulltext":true,"cited_by_count":13,"citation_normalized_percentile":{"value":0.85991746,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":97,"max":99},"biblio":{"volume":"36","issue":"6","first_page":"2901","last_page":"2920"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9993000030517578,"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.9993000030517578,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9925000071525574,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10698","display_name":"Transportation Planning and Optimization","score":0.9925000071525574,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.7007994055747986},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6074846386909485},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5462344884872437},{"id":"https://openalex.org/keywords/extremal-optimization","display_name":"Extremal optimization","score":0.5000548362731934},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.4477701485157013},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42809516191482544},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4246540665626526},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.42007189989089966},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41928592324256897},{"id":"https://openalex.org/keywords/consistency","display_name":"Consistency (knowledge bases)","score":0.4187198877334595},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.34299588203430176},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2937161922454834},{"id":"https://openalex.org/keywords/meta-optimization","display_name":"Meta-optimization","score":0.2056027054786682},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.19514420628547668},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.16902661323547363}],"concepts":[{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.7007994055747986},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6074846386909485},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5462344884872437},{"id":"https://openalex.org/C188919014","wikidata":"https://www.wikidata.org/wiki/Q5422296","display_name":"Extremal optimization","level":4,"score":0.5000548362731934},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.4477701485157013},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42809516191482544},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4246540665626526},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.42007189989089966},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41928592324256897},{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.4187198877334595},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.34299588203430176},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2937161922454834},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.2056027054786682},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.19514420628547668},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.16902661323547363}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00521-023-09195-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00521-023-09195-4","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00521-023-09195-4.pdf","source":{"id":"https://openalex.org/S147897268","display_name":"Neural Computing and Applications","issn_l":"0941-0643","issn":["0941-0643","1433-3058"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Neural Computing and Applications","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s00521-023-09195-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00521-023-09195-4","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00521-023-09195-4.pdf","source":{"id":"https://openalex.org/S147897268","display_name":"Neural Computing and Applications","issn_l":"0941-0643","issn":["0941-0643","1433-3058"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Neural Computing and Applications","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320316353","display_name":"Universit\u00e0 degli Studi di Foggia","ror":"https://ror.org/01xtv3204"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4388997841.pdf","grobid_xml":"https://content.openalex.org/works/W4388997841.grobid-xml"},"referenced_works_count":40,"referenced_works":["https://openalex.org/W1584108895","https://openalex.org/W1801849579","https://openalex.org/W1986940512","https://openalex.org/W2009883530","https://openalex.org/W2010418932","https://openalex.org/W2010570954","https://openalex.org/W2040326319","https://openalex.org/W2064284095","https://openalex.org/W2089653513","https://openalex.org/W2107941094","https://openalex.org/W2114312063","https://openalex.org/W2118051273","https://openalex.org/W2123789618","https://openalex.org/W2125690626","https://openalex.org/W2143945515","https://openalex.org/W2164267739","https://openalex.org/W2167920923","https://openalex.org/W2169640222","https://openalex.org/W2938150024","https://openalex.org/W2990172563","https://openalex.org/W3046155783","https://openalex.org/W3096348806","https://openalex.org/W3114791866","https://openalex.org/W3138560504","https://openalex.org/W3160015875","https://openalex.org/W3163462517","https://openalex.org/W3198841180","https://openalex.org/W4206751062","https://openalex.org/W4207081143","https://openalex.org/W4226186048","https://openalex.org/W4242215473","https://openalex.org/W4242223460","https://openalex.org/W4285092818","https://openalex.org/W4285729064","https://openalex.org/W4292083457","https://openalex.org/W4307637414","https://openalex.org/W4312720137","https://openalex.org/W4313537271","https://openalex.org/W4317614173","https://openalex.org/W4385493623"],"related_works":["https://openalex.org/W4245157707","https://openalex.org/W2908391583","https://openalex.org/W2981400081","https://openalex.org/W4385871958","https://openalex.org/W2353880500","https://openalex.org/W2553274123","https://openalex.org/W4283826969","https://openalex.org/W1997193297","https://openalex.org/W2120093588","https://openalex.org/W2369428395"],"abstract_inverted_index":{"Abstract":[0],"This":[1,38,80,195],"paper":[2,81],"aims":[3],"to":[4,77,83,171,179],"solve":[5,78],"the":[6,21,25,62,125,128,151,154,161,174],"Chinese":[7],"Postman":[8],"Problem":[9],"(CPP)":[10],"using":[11],"an":[12,89],"Ant":[13],"Colony":[14],"Optimization":[15],"(ACO)":[16],"algorithm.":[17],"In":[18],"graph":[19],"theory,":[20],"CPP":[22,58,94,207],"looks":[23],"for":[24,124,150,202],"shortest":[26],"closed":[27],"path":[28],"that":[29,92,160,186,197],"visits":[30],"every":[31],"edge":[32],"of":[33,127,153,176],"a":[34,106,111,168,206],"connected":[35],"undirected":[36],"graph.":[37],"problem":[39],"has":[40],"many":[41],"applications,":[42],"including":[43],"route":[44],"optimization,":[45],"interactive":[46],"system":[47],"analysis,":[48],"and":[49,70,100,110,166],"flow":[50],"design.":[51],"Although":[52],"numerous":[53],"algorithms":[54,67],"aimed":[55],"at":[56],"solving":[57,203],"are":[59,68],"present":[60],"in":[61],"literature,":[63],"very":[64],"few":[65],"meta-heuristic":[66],"proposed,":[69],"no":[71],"ACO":[72,90,144,192,198],"applications":[73],"have":[74],"been":[75],"proposed":[76],"them.":[79],"tries":[82],"fill":[84],"this":[85],"gap":[86],"by":[87,142],"presenting":[88],"algorithm":[91,113,163],"solves":[93],"(ACO-CPP).":[95],"To":[96],"prove":[97,159],"its":[98],"consistency":[99,169],"effectiveness,":[101],"ACO-CPP":[102,162],"is":[103,164,181,199],"compared":[104],"with":[105,205],"Genetic":[107],"Algorithm":[108],"(GA)":[109],"recursive":[112],"throughout":[114],"three":[115],"experiments:":[116],"(1)":[117],"recursive-ACO-GA":[118,140],"comparisons":[119,134,141],"over":[120,135,146],"randomly":[121,147],"generated":[122,137,148],"graphs":[123,149],"attainment":[126,152],"global":[129,155],"optimum;":[130],"(2)":[131],"ACO-GA":[132],"statistical":[133],"specifically":[136],"graphs;":[138],"(3)":[139],"changing":[143],"hyperparameters":[145],"optimum.":[156],"The":[157],"experiments":[158],"efficient":[165],"exhibits":[167],"similar":[170],"GA":[172],"when":[173,185],"number":[175,187],"possible":[177],"solutions":[178],"explore":[180],"relatively":[182],"low.":[183],"However,":[184],"greatly":[188],"exceeds":[189],"those":[190],"explored,":[191],"outperforms":[193],"GA.":[194],"suggests":[196],"more":[200],"suitable":[201],"problems":[204],"structure.":[208]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":5}],"updated_date":"2026-08-28T12:50:07.497085","created_date":"2025-10-10T00:00:00"}