{"id":"https://openalex.org/W2189241693","doi":null,"title":"OPTIMIZATION OF CAPACITATED VEHICLE ROUTING PROBLEM USING PSO","display_name":"OPTIMIZATION OF CAPACITATED VEHICLE ROUTING PROBLEM USING PSO","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W2189241693","mag":"2189241693"},"language":"en","primary_location":{"id":"mag:2189241693","doi":null,"is_oa":false,"landing_page_url":"https://www.idc-online.com/technical_references/pdfs/mechanical_engineering/OPTIMIZATION%20OF%20CAPACITATED%20VEHICLE%20ROUTING%20PROBLEM%20USING%20PSO.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5103590912","display_name":"Subramaniyan Venkatesan","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Subramaniyan Venkatesan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078361670","display_name":"D. Logendran","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"D. Logendran","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5042494194","display_name":"Chandramohan Dhasarathan","orcid":"https://orcid.org/0000-0002-5279-950X","observed_orcids":["https://orcid.org/0000-0002-5279-950X"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chandramohan Dhasarathan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.1351,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.86994515,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":97},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9994999766349792,"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.9994999766349792,"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.00019999999494757503,"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/T11502","display_name":"Facility Location and Emergency Management","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/capacitated-vehicle-routing-problem","display_name":"capacitated vehicle routing problem","score":0.9940000176429749},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"particle swarm optimization","score":0.9980000257492065},{"id":"https://openalex.org/keywords/metaheuristic-optimization","display_name":"metaheuristic optimization","score":0.8320000171661377},{"id":"https://openalex.org/keywords/cluster-formation","display_name":"cluster formation","score":0.5479999780654907},{"id":"https://openalex.org/keywords/traveling-salesman-problem","display_name":"traveling salesman problem","score":0.8489999771118164},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.7739999890327454},{"id":"https://openalex.org/keywords/route-optimization","display_name":"route optimization","score":0.6100000143051147},{"id":"https://openalex.org/keywords/vehicle-capacity","display_name":"vehicle capacity","score":0.49300000071525574}],"concepts":[{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.8461815118789673},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.8176306486129761},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.7204732894897461},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7000694274902344},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.5793297290802002},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5074939131736755},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5022826194763184},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.49620896577835083},{"id":"https://openalex.org/C122357587","wikidata":"https://www.wikidata.org/wiki/Q6934508","display_name":"Multi-swarm optimization","level":3,"score":0.46654200553894043},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.458005428314209},{"id":"https://openalex.org/C181335050","wikidata":"https://www.wikidata.org/wiki/Q14915018","display_name":"Swarm behaviour","level":2,"score":0.41902169585227966},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3073458671569824},{"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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2189241693","doi":null,"is_oa":false,"landing_page_url":"https://www.idc-online.com/technical_references/pdfs/mechanical_engineering/OPTIMIZATION%20OF%20CAPACITATED%20VEHICLE%20ROUTING%20PROBLEM%20USING%20PSO.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.8970999717712402}],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1601649239","https://openalex.org/W1964005729","https://openalex.org/W1973494611","https://openalex.org/W2011040589","https://openalex.org/W2080427200","https://openalex.org/W2081231516","https://openalex.org/W2136284166","https://openalex.org/W2145130465","https://openalex.org/W2340149117"],"related_works":["https://openalex.org/W2976600940","https://openalex.org/W2154855022","https://openalex.org/W2779187025","https://openalex.org/W2908412377","https://openalex.org/W2548746808","https://openalex.org/W1992841150","https://openalex.org/W2146547098","https://openalex.org/W3097509271","https://openalex.org/W7035912243","https://openalex.org/W2863400761"],"abstract_inverted_index":{"This":[0,79,92],"paper":[1,49,80],"presents":[2,81],"solution":[3],"techniques":[4,77],"for":[5],"Capacitated":[6,13],"Vehicle":[7,14],"Routing":[8,15],"Problem":[9,16],"(CVRP)":[10],"using":[11,73,98],"metaheuristics.":[12],"is":[17,35,45,57,64,94],"divided":[18,58],"into":[19,59],"set":[20],"of":[21,30,110,133],"customers":[22,129],"called":[23],"cluster,":[24],"and":[25,61,70,85,135],"find":[26,106],"optimum":[27,107],"travel":[28,108],"distance":[29,109,132],"vehicle":[31,111],"route.":[32,112],"The":[33,54],"CVRP":[34],"a":[36,82,99],"combinatorial":[37],"optimization":[38,42,76,102],"problem;":[39],"particle":[40,74,100],"swarm":[41,75,101],"(PSO)":[43,103],"technique":[44],"adapted":[46],"in":[47],"this":[48,52],"to":[50,88,105,122,125],"solve":[51],"problem.":[53],"main":[55],"problem":[56,69],"subprograms/clusters":[60],"each":[62],"subprogram":[63],"treated":[65],"as":[66],"travelling":[67],"salesman":[68],"solved":[71,96],"by":[72,97],"(PSO).":[78],"sweep,":[83],"Clark":[84],"wright":[86],"algorithm":[87],"form":[89],"the":[90,117],"clusters.":[91],"model":[93,119],"then":[95],"method":[104],"Our":[113],"analysis":[114],"suggests":[115],"that":[116],"proposed":[118],"enables":[120],"users":[121],"establish":[123],"route":[124],"serve":[126],"all":[127],"given":[128],"with":[130],"minimum":[131],"vehicles":[134],"maximum":[136],"capacity.":[137]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-10-12T09:40:04.860316","created_date":"2016-06-24T00:00:00"}