{"id":"https://openalex.org/W4206070139","doi":"https://doi.org/10.1080/08839514.2021.1995658","title":"Constrained Clustering for the Capacitated Vehicle Routing Problem (CC-CVRP)","display_name":"Constrained Clustering for the Capacitated Vehicle Routing Problem (CC-CVRP)","publication_year":2022,"publication_date":"2022-01-05","ids":{"openalex":"https://openalex.org/W4206070139","doi":"https://doi.org/10.1080/08839514.2021.1995658"},"language":"en","primary_location":{"id":"doi:10.1080/08839514.2021.1995658","is_oa":true,"landing_page_url":"https://doi.org/10.1080/08839514.2021.1995658","pdf_url":"https://www.tandfonline.com/doi/pdf/10.1080/08839514.2021.1995658?needAccess=true&role=button","source":{"id":"https://openalex.org/S125501549","display_name":"Applied Artificial Intelligence","issn_l":"0883-9514","issn":["0883-9514","1087-6545"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Applied Artificial Intelligence","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.tandfonline.com/doi/pdf/10.1080/08839514.2021.1995658?needAccess=true&role=button","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5088490426","display_name":"Francesco Alesiani","orcid":"https://orcid.org/0000-0003-4413-7247"},"institutions":[{"id":"https://openalex.org/I4210089015","display_name":"Sharp Laboratories of Europe (United Kingdom)","ror":"https://ror.org/0075mfb88","country_code":"GB","type":"company","lineage":["https://openalex.org/I4210089015"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Francesco Alesiani","raw_affiliation_strings":["NEC Laboratories Europe","NEC Laboratories Europe, Heidelberg, Germany;"],"raw_orcid":"https://orcid.org/0000-0003-4413-7247","affiliations":[{"raw_affiliation_string":"NEC Laboratories Europe","institution_ids":["https://openalex.org/I4210089015"]},{"raw_affiliation_string":"NEC Laboratories Europe, Heidelberg, Germany;","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075576380","display_name":"G\u00fcl\u00e7in Ermi\u015f","orcid":"https://orcid.org/0000-0002-6545-6979"},"institutions":[{"id":"https://openalex.org/I4210089015","display_name":"Sharp Laboratories of Europe (United Kingdom)","ror":"https://ror.org/0075mfb88","country_code":"GB","type":"company","lineage":["https://openalex.org/I4210089015"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Gulcin Ermis","raw_affiliation_strings":["NEC Laboratories Europe","NEC Laboratories Europe, Heidelberg, Germany;"],"raw_orcid":"https://orcid.org/0000-0002-6545-6979","affiliations":[{"raw_affiliation_string":"NEC Laboratories Europe","institution_ids":["https://openalex.org/I4210089015"]},{"raw_affiliation_string":"NEC Laboratories Europe, Heidelberg, Germany;","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5090082938","display_name":"Konstantinos Gkiotsalitis","orcid":"https://orcid.org/0000-0002-3009-1527"},"institutions":[{"id":"https://openalex.org/I94624287","display_name":"University of Twente","ror":"https://ror.org/006hf6230","country_code":"NL","type":"education","lineage":["https://openalex.org/I94624287"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Konstantinos Gkiotsalitis","raw_affiliation_strings":["University of Twente","University of Twente, Faculty of Engineering Technology, Enschede, Netherlands"],"raw_orcid":"https://orcid.org/0000-0002-3009-1527","affiliations":[{"raw_affiliation_string":"University of Twente","institution_ids":["https://openalex.org/I94624287"]},{"raw_affiliation_string":"University of Twente, Faculty of Engineering Technology, Enschede, Netherlands","institution_ids":["https://openalex.org/I94624287"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5090082938"],"corresponding_institution_ids":["https://openalex.org/I94624287"],"apc_list":{"value":2195,"currency":"USD","value_usd":2195},"apc_paid":{"value":2195,"currency":"USD","value_usd":2195},"fwci":4.8052,"has_fulltext":true,"cited_by_count":44,"citation_normalized_percentile":{"value":0.95204483,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":"36","issue":"1","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.9998999834060669,"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.9998999834060669,"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/T12306","display_name":"Urban and Freight Transport Logistics","score":0.9909999966621399,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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/T12176","display_name":"Optimization and Packing Problems","score":0.9889000058174133,"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/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.9498951435089111},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.8851320743560791},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.7252069711685181},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7011594176292419},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6201755404472351},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5656607747077942},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4536359906196594},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4163544178009033},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28356415033340454},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1383594274520874}],"concepts":[{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.9498951435089111},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.8851320743560791},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.7252069711685181},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7011594176292419},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6201755404472351},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5656607747077942},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4536359906196594},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4163544178009033},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28356415033340454},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1383594274520874},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1080/08839514.2021.1995658","is_oa":true,"landing_page_url":"https://doi.org/10.1080/08839514.2021.1995658","pdf_url":"https://www.tandfonline.com/doi/pdf/10.1080/08839514.2021.1995658?needAccess=true&role=button","source":{"id":"https://openalex.org/S125501549","display_name":"Applied Artificial Intelligence","issn_l":"0883-9514","issn":["0883-9514","1087-6545"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Applied Artificial Intelligence","raw_type":"journal-article"},{"id":"pmh:oai:ris.utwente.nl:openaire_cris_publications/33774cb2-34bf-492f-9b39-7c053dd7f37b","is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/33774cb2-34bf-492f-9b39-7c053dd7f37b","pdf_url":"https://ris.utwente.nl/ws/files/276336507/Alesiani2022constrained.pdf","source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Alesiani, F, Ermis, G & Gkiotsalitis, K 2022, 'Constrained Clustering for the Capacitated Vehicle Routing Problem (CC-CVRP)', Applied artificial intelligence, vol. 36, no. 1, 1995658 . https://doi.org/10.1080/08839514.2021.1995658","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:doaj.org/article:effb143683834485ba4a93c12d4037aa","is_oa":false,"landing_page_url":"https://doaj.org/article/effb143683834485ba4a93c12d4037aa","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Applied Artificial Intelligence, Vol 36, Iss 1 (2022)","raw_type":"article"},{"id":"pmh:oai:ris.utwente.nl:publications/33774cb2-34bf-492f-9b39-7c053dd7f37b","is_oa":true,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=85122378527&partnerID=8YFLogxK","pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Alesiani , F , Ermis , G & Gkiotsalitis , K 2022 , ' Constrained Clustering for the Capacitated Vehicle Routing Problem (CC-CVRP) ' , Applied artificial intelligence , vol. 36 , no. 1 , 1995658 . https://doi.org/10.1080/08839514.2021.1995658","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1080/08839514.2021.1995658","is_oa":true,"landing_page_url":"https://doi.org/10.1080/08839514.2021.1995658","pdf_url":"https://www.tandfonline.com/doi/pdf/10.1080/08839514.2021.1995658?needAccess=true&role=button","source":{"id":"https://openalex.org/S125501549","display_name":"Applied Artificial Intelligence","issn_l":"0883-9514","issn":["0883-9514","1087-6545"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Applied Artificial Intelligence","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","score":0.44999998807907104,"display_name":"Affordable and clean energy"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4206070139.pdf","grobid_xml":"https://content.openalex.org/works/W4206070139.grobid-xml"},"referenced_works_count":67,"referenced_works":["https://openalex.org/W15274158","https://openalex.org/W41322358","https://openalex.org/W1208385249","https://openalex.org/W1501435780","https://openalex.org/W1663519530","https://openalex.org/W1965212759","https://openalex.org/W1972755385","https://openalex.org/W1978186990","https://openalex.org/W1990135083","https://openalex.org/W1997368401","https://openalex.org/W2006487034","https://openalex.org/W2015057142","https://openalex.org/W2015455321","https://openalex.org/W2029655305","https://openalex.org/W2029681015","https://openalex.org/W2035231387","https://openalex.org/W2038172102","https://openalex.org/W2043735779","https://openalex.org/W2044701049","https://openalex.org/W2047146267","https://openalex.org/W2049287714","https://openalex.org/W2064578828","https://openalex.org/W2065398238","https://openalex.org/W2068084572","https://openalex.org/W2074473732","https://openalex.org/W2081340785","https://openalex.org/W2082153300","https://openalex.org/W2082260357","https://openalex.org/W2096732213","https://openalex.org/W2108536179","https://openalex.org/W2108753073","https://openalex.org/W2111563176","https://openalex.org/W2111581650","https://openalex.org/W2123213336","https://openalex.org/W2127654349","https://openalex.org/W2134946882","https://openalex.org/W2136871443","https://openalex.org/W2146647680","https://openalex.org/W2150593711","https://openalex.org/W2154800965","https://openalex.org/W2163873159","https://openalex.org/W2168210873","https://openalex.org/W2184627981","https://openalex.org/W2262276395","https://openalex.org/W2509755532","https://openalex.org/W2518529723","https://openalex.org/W2528574535","https://openalex.org/W2586188487","https://openalex.org/W2594109651","https://openalex.org/W2601027841","https://openalex.org/W2619624888","https://openalex.org/W2749062520","https://openalex.org/W2762626604","https://openalex.org/W2783647323","https://openalex.org/W2802483125","https://openalex.org/W2902581443","https://openalex.org/W2911934539","https://openalex.org/W2916932176","https://openalex.org/W2921712036","https://openalex.org/W3010138084","https://openalex.org/W3012050958","https://openalex.org/W4205821171","https://openalex.org/W4214946404","https://openalex.org/W4240555338","https://openalex.org/W4252801674","https://openalex.org/W4292122152","https://openalex.org/W4381328220"],"related_works":["https://openalex.org/W2018691209","https://openalex.org/W4312143452","https://openalex.org/W4247364272","https://openalex.org/W3133151256","https://openalex.org/W2132920749","https://openalex.org/W2101108574","https://openalex.org/W2157331354","https://openalex.org/W4206070139","https://openalex.org/W2596350817","https://openalex.org/W2002914572"],"abstract_inverted_index":{"eCommerce,":[0],"postal":[1],"and":[2,22,118,173],"logistics'":[3],"planners":[4],"require":[5],"to":[6,38,70,139,182],"solve":[7,140],"large-scale":[8],"capacitated":[9],"vehicle":[10,94],"routing":[11,95],"problems":[12,19,44],"(CVRPs)":[13],"on":[14],"a":[15,36,74,92,179],"daily":[16],"basis.":[17],"CVRP":[18,43,117,143],"are":[20],"NP-Hard":[21],"cannot":[23],"be":[24,47,124,176,189],"easily":[25],"solved":[26,49],"for":[27],"large":[28,142],"problem":[29,69,96],"instances.":[30],"Given":[31],"their":[32],"complexity,":[33],"we":[34],"propose":[35],"methodology":[37],"reduce":[39],"the":[40,64,67,107,112,115,120,128,158],"size":[41],"of":[42,60,66,114,150],"that":[45,62,135,187],"can":[46,123,162,175,188],"later":[48],"with":[50,97,111,147,166],"state-of-the-art":[51],"optimization":[52],"solvers.":[53],"Our":[54],"method":[55,105,137,156],"is":[56],"an":[57,184,192,197],"efficient":[58],"version":[59],"clustering":[61],"considers":[63],"constraints":[65],"original":[68,116,129],"transform":[71],"it":[72,90,161,174],"into":[73,127],"more":[75],"tractable":[76],"version.":[77],"We":[78,101],"call":[79],"this":[80,104],"approach":[81],"Constrained":[82],"Clustering":[83],"Capacitated":[84],"Vehicle":[85],"Routing":[86],"Solver":[87],"(CC-CVRS)":[88],"because":[89],"produces":[91],"soft-clustered":[93],"reduced":[98],"decision":[99],"variables.":[100],"demonstrate":[102],"how":[103,119],"reduces":[106],"computational":[108],"complexity":[109],"associated":[110],"solution":[113,122,186,194],"computed":[121],"transformed":[125],"back":[126],"space.":[130],"Extensive":[131],"numerical":[132],"experiments":[133],"show":[134],"our":[136,155],"allows":[138],"very":[141],"instances":[144],"within":[145],"seconds":[146],"optimality":[148,168],"gaps":[149,169],"less":[151],"than":[152],"16%.":[153],"Therefore,":[154],"has":[157],"following":[159],"benefits:":[160],"compute":[163,183],"improved":[164,185],"solutions":[165],"small":[167],"in":[170],"near":[171],"real-time,":[172],"used":[177,190],"as":[178,191],"warm-up":[180],"solver":[181],"initial":[193],"guess":[195],"by":[196],"exact":[198],"solver.":[199]},"counts_by_year":[{"year":2026,"cited_by_count":7},{"year":2025,"cited_by_count":9},{"year":2024,"cited_by_count":12},{"year":2023,"cited_by_count":13},{"year":2022,"cited_by_count":3}],"updated_date":"2026-07-04T07:58:01.006859","created_date":"2025-10-10T00:00:00"}