{"id":"https://openalex.org/W2132103212","doi":"https://doi.org/10.1109/iske.2008.4730895","title":"A hybrid ant colony algorithm for the capacitated location-routing problem","display_name":"A hybrid ant colony algorithm for the capacitated location-routing problem","publication_year":2008,"publication_date":"2008-11-01","ids":{"openalex":"https://openalex.org/W2132103212","doi":"https://doi.org/10.1109/iske.2008.4730895","mag":"2132103212"},"language":"en","primary_location":{"id":"doi:10.1109/iske.2008.4730895","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iske.2008.4730895","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 3rd International Conference on Intelligent System and Knowledge Engineering","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/A5111935348","display_name":"Jitao Yan","orcid":null},"institutions":[{"id":"https://openalex.org/I151878197","display_name":"Pingdingshan University","ror":"https://ror.org/026c29h90","country_code":"CN","type":"education","lineage":["https://openalex.org/I151878197"]},{"id":"https://openalex.org/I4210113703","display_name":"Henan University of Urban Construction","ror":"https://ror.org/01x1skr92","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210113703"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Jitao Yan","raw_affiliation_strings":["Pingdingshan Institute of Technology, Pingdingshan, China","Pingdingshan Inst. of Technol., Pingdingshan, China"],"affiliations":[{"raw_affiliation_string":"Pingdingshan Institute of Technology, Pingdingshan, China","institution_ids":["https://openalex.org/I151878197","https://openalex.org/I4210113703"]},{"raw_affiliation_string":"Pingdingshan Inst. of Technol., Pingdingshan, China","institution_ids":["https://openalex.org/I151878197"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085474562","display_name":"Qiuwen Zhang","orcid":"https://orcid.org/0000-0002-8533-7088"},"institutions":[{"id":"https://openalex.org/I36152291","display_name":"Henan University of Technology","ror":"https://ror.org/05sbgwt55","country_code":"CN","type":"education","lineage":["https://openalex.org/I36152291"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Qiuwen Zhang","raw_affiliation_strings":["College of Information Science and Engineering, Henan University of Technology, Zhengzhou, China","College of information Science and Engineering, Henan University of Technology, Zhengzhou, China"],"affiliations":[{"raw_affiliation_string":"College of Information Science and Engineering, Henan University of Technology, Zhengzhou, China","institution_ids":["https://openalex.org/I36152291"]},{"raw_affiliation_string":"College of information Science and Engineering, Henan University of Technology, Zhengzhou, China","institution_ids":["https://openalex.org/I36152291"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028610244","display_name":"Wenshuai Zhang","orcid":"https://orcid.org/0000-0002-0437-8962"},"institutions":[{"id":"https://openalex.org/I4210146584","display_name":"Henan Forestry Vocational College","ror":"https://ror.org/050g87e49","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210146584"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Wenshuai Zhang","raw_affiliation_strings":["Henan Vocational College of Agriculture, Zhongmu, China","Henan Vocational Coll. of Agric., Zhongmu, China"],"affiliations":[{"raw_affiliation_string":"Henan Vocational College of Agriculture, Zhongmu, China","institution_ids":["https://openalex.org/I4210146584"]},{"raw_affiliation_string":"Henan Vocational Coll. of Agric., Zhongmu, China","institution_ids":["https://openalex.org/I4210146584"]}]},{"author_position":"last","author":{"id":null,"display_name":"Tong Zhen","orcid":null},"institutions":[{"id":"https://openalex.org/I36152291","display_name":"Henan University of Technology","ror":"https://ror.org/05sbgwt55","country_code":"CN","type":"education","lineage":["https://openalex.org/I36152291"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Tong Zhen","raw_affiliation_strings":["College of Information Science and Engineering, Henan University of Technology, Zhengzhou, China","College of information Science and Engineering, Henan University of Technology, Zhengzhou, China"],"affiliations":[{"raw_affiliation_string":"College of Information Science and Engineering, Henan University of Technology, Zhengzhou, China","institution_ids":["https://openalex.org/I36152291"]},{"raw_affiliation_string":"College of information Science and Engineering, Henan University of Technology, Zhengzhou, China","institution_ids":["https://openalex.org/I36152291"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5111935348"],"corresponding_institution_ids":["https://openalex.org/I151878197","https://openalex.org/I4210113703"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.19558893,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"220","issue":null,"first_page":"38","last_page":"43"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9998000264167786,"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.9998000264167786,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9934999942779541,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9918000102043152,"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/computer-science","display_name":"Computer science","score":0.8283085227012634},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.8205417990684509},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.6442139148712158},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5671162009239197},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.520936131477356},{"id":"https://openalex.org/keywords/hybrid-algorithm","display_name":"Hybrid algorithm (constraint satisfaction)","score":0.5203232765197754},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.5166390538215637},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4585215449333191},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4162033200263977},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2460535764694214},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09483277797698975},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.05068176984786987}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8283085227012634},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.8205417990684509},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.6442139148712158},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5671162009239197},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.520936131477356},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.5203232765197754},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.5166390538215637},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4585215449333191},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4162033200263977},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2460535764694214},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09483277797698975},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.05068176984786987},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iske.2008.4730895","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iske.2008.4730895","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 3rd International Conference on Intelligent System and Knowledge Engineering","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":17,"referenced_works":["https://openalex.org/W143879848","https://openalex.org/W586197764","https://openalex.org/W1601649239","https://openalex.org/W1972755385","https://openalex.org/W1984197114","https://openalex.org/W1992790175","https://openalex.org/W2007401074","https://openalex.org/W2024060531","https://openalex.org/W2030407706","https://openalex.org/W2056760934","https://openalex.org/W2058569171","https://openalex.org/W2154061444","https://openalex.org/W2171776966","https://openalex.org/W2297395784","https://openalex.org/W4302422232","https://openalex.org/W6617312699","https://openalex.org/W6697634807"],"related_works":["https://openalex.org/W2017411971","https://openalex.org/W2172069777","https://openalex.org/W2956620057","https://openalex.org/W2384341213","https://openalex.org/W2393811661","https://openalex.org/W2362152818","https://openalex.org/W2347951034","https://openalex.org/W2017649536","https://openalex.org/W1990067406","https://openalex.org/W2295457097"],"abstract_inverted_index":{"The":[0,13,79],"capacitated":[1,45],"location-routing":[2],"problem":[3,26,32],"(CLRP)":[4],"belongs":[5],"to":[6,40,54],"the":[7,23,29,56,60,84],"field":[8],"of":[9,11,19,69],"logistics":[10],"transportation.":[12],"CLRP":[14],"appears":[15],"as":[16],"a":[17,49,67],"combination":[18],"two":[20],"difficult":[21],"problems:":[22],"facility":[24],"location":[25],"(FLP)":[27],"and":[28,91],"vehicle":[30],"routing":[31],"(VRP).It":[33],"is":[34,89],"an":[35],"NP-hard":[36],"problem.":[37],"In":[38],"order":[39],"solve":[41,55],"practical":[42],"large":[43],"scale":[44],"LRP,":[46],"We":[47],"propose":[48],"hybrid":[50,85],"ant":[51,86],"colony":[52,87],"algorithm":[53,62,88],"CLRP.":[57],"To":[58],"compare":[59],"proposed":[61],"with":[63],"other":[64],"heuristic":[65],"algorithms,":[66],"series":[68],"computational":[70],"experiments":[71],"are":[72],"done":[73],"on":[74],"randomly":[75],"generated":[76],"test":[77],"problems.":[78],"simulation":[80],"results":[81],"demonstrate":[82],"that":[83],"feasible":[90],"efficient.":[92]},"counts_by_year":[{"year":2015,"cited_by_count":2}],"updated_date":"2026-04-16T08:26:57.006410","created_date":"2025-10-10T00:00:00"}