{"id":"https://openalex.org/W2782292677","doi":"https://doi.org/10.1080/0952813x.2017.1421268","title":"A GRASP algorithm based new heuristic for the capacitated location routing problem","display_name":"A GRASP algorithm based new heuristic for the capacitated location routing problem","publication_year":2018,"publication_date":"2018-01-05","ids":{"openalex":"https://openalex.org/W2782292677","doi":"https://doi.org/10.1080/0952813x.2017.1421268","mag":"2782292677"},"language":"en","primary_location":{"id":"doi:10.1080/0952813x.2017.1421268","is_oa":false,"landing_page_url":"https://doi.org/10.1080/0952813x.2017.1421268","pdf_url":null,"source":{"id":"https://openalex.org/S153467142","display_name":"Journal of Experimental & Theoretical Artificial Intelligence","issn_l":"0952-813X","issn":["0952-813X","1362-3079"],"is_oa":false,"is_in_doaj":false,"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":"Journal of Experimental &amp; Theoretical Artificial Intelligence","raw_type":"journal-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/A5022290090","display_name":"Imene Ferdi","orcid":null},"institutions":[{"id":"https://openalex.org/I4210160465","display_name":"Universit\u00e9 Constantine 2","ror":"https://ror.org/056mctw68","country_code":"DZ","type":"education","lineage":["https://openalex.org/I4210160465"]},{"id":"https://openalex.org/I4391767747","display_name":"University of Constantine 3","ror":"https://ror.org/04wk25q62","country_code":null,"type":"education","lineage":["https://openalex.org/I4391767747"]}],"countries":["DZ"],"is_corresponding":true,"raw_author_name":"Imene Ferdi","raw_affiliation_strings":["Department of Fundamental Computer and its Applications, Abdelhamid Mehri university of constantine 2, Constantine, Algeria"],"affiliations":[{"raw_affiliation_string":"Department of Fundamental Computer and its Applications, Abdelhamid Mehri university of constantine 2, Constantine, Algeria","institution_ids":["https://openalex.org/I4210160465","https://openalex.org/I4391767747"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016921626","display_name":"Abdesslem Layeb","orcid":"https://orcid.org/0000-0002-6553-8253"},"institutions":[{"id":"https://openalex.org/I4210160465","display_name":"Universit\u00e9 Constantine 2","ror":"https://ror.org/056mctw68","country_code":"DZ","type":"education","lineage":["https://openalex.org/I4210160465"]},{"id":"https://openalex.org/I4391767747","display_name":"University of Constantine 3","ror":"https://ror.org/04wk25q62","country_code":null,"type":"education","lineage":["https://openalex.org/I4391767747"]}],"countries":["DZ"],"is_corresponding":false,"raw_author_name":"Abdesslem Layeb","raw_affiliation_strings":["Department of Fundamental Computer and its Applications, Abdelhamid Mehri university of constantine 2, Constantine, Algeria"],"affiliations":[{"raw_affiliation_string":"Department of Fundamental Computer and its Applications, Abdelhamid Mehri university of constantine 2, Constantine, Algeria","institution_ids":["https://openalex.org/I4210160465","https://openalex.org/I4391767747"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5022290090"],"corresponding_institution_ids":["https://openalex.org/I4210160465","https://openalex.org/I4391767747"],"apc_list":null,"apc_paid":null,"fwci":1.7244,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.86720963,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"30","issue":"3","first_page":"369","last_page":"387"},"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/T11502","display_name":"Facility Location and Emergency Management","score":0.9954000115394592,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12546","display_name":"Smart Parking Systems Research","score":0.9927999973297119,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.9064557552337646},{"id":"https://openalex.org/keywords/grasp","display_name":"GRASP","score":0.7480828166007996},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.6524144411087036},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.6184892654418945},{"id":"https://openalex.org/keywords/greedy-randomized-adaptive-search-procedure","display_name":"Greedy randomized adaptive search procedure","score":0.5978658199310303},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.5952754616737366},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5312896370887756},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5245751738548279},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5170986652374268},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.49427247047424316},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45607948303222656},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2881084382534027}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.9064557552337646},{"id":"https://openalex.org/C171268870","wikidata":"https://www.wikidata.org/wiki/Q1486676","display_name":"GRASP","level":2,"score":0.7480828166007996},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.6524144411087036},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.6184892654418945},{"id":"https://openalex.org/C126221529","wikidata":"https://www.wikidata.org/wiki/Q3116070","display_name":"Greedy randomized adaptive search procedure","level":3,"score":0.5978658199310303},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.5952754616737366},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5312896370887756},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5245751738548279},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5170986652374268},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.49427247047424316},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45607948303222656},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2881084382534027},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/0952813x.2017.1421268","is_oa":false,"landing_page_url":"https://doi.org/10.1080/0952813x.2017.1421268","pdf_url":null,"source":{"id":"https://openalex.org/S153467142","display_name":"Journal of Experimental & Theoretical Artificial Intelligence","issn_l":"0952-813X","issn":["0952-813X","1362-3079"],"is_oa":false,"is_in_doaj":false,"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":"Journal of Experimental &amp; Theoretical Artificial Intelligence","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":58,"referenced_works":["https://openalex.org/W1583403835","https://openalex.org/W1601649239","https://openalex.org/W1608651154","https://openalex.org/W1825846561","https://openalex.org/W1964317936","https://openalex.org/W1965681692","https://openalex.org/W1974082921","https://openalex.org/W1985662483","https://openalex.org/W1988924288","https://openalex.org/W1989974478","https://openalex.org/W1992447230","https://openalex.org/W1994940434","https://openalex.org/W1996268504","https://openalex.org/W1999030226","https://openalex.org/W1999283757","https://openalex.org/W2008477533","https://openalex.org/W2015737965","https://openalex.org/W2015785429","https://openalex.org/W2017708378","https://openalex.org/W2027946669","https://openalex.org/W2028438572","https://openalex.org/W2029350737","https://openalex.org/W2029392610","https://openalex.org/W2030407706","https://openalex.org/W2031733044","https://openalex.org/W2035491675","https://openalex.org/W2038947920","https://openalex.org/W2040546552","https://openalex.org/W2043496704","https://openalex.org/W2052171047","https://openalex.org/W2056295481","https://openalex.org/W2058698701","https://openalex.org/W2083030584","https://openalex.org/W2090275183","https://openalex.org/W2099721629","https://openalex.org/W2120930954","https://openalex.org/W2123115451","https://openalex.org/W2136611127","https://openalex.org/W2139919574","https://openalex.org/W2145603433","https://openalex.org/W2168210873","https://openalex.org/W2225985969","https://openalex.org/W2232332530","https://openalex.org/W2234744346","https://openalex.org/W2475189112","https://openalex.org/W2507480084","https://openalex.org/W2553814086","https://openalex.org/W2560429286","https://openalex.org/W2589302128","https://openalex.org/W2615458308","https://openalex.org/W4214652857","https://openalex.org/W4231590666","https://openalex.org/W4231671316","https://openalex.org/W4237379127","https://openalex.org/W4239179583","https://openalex.org/W4248027363","https://openalex.org/W4254646219","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W3135694647","https://openalex.org/W2541071804","https://openalex.org/W2094485034","https://openalex.org/W20026230","https://openalex.org/W4251926495","https://openalex.org/W2393373993","https://openalex.org/W2896014154","https://openalex.org/W1967029759","https://openalex.org/W3117281083","https://openalex.org/W3119129187"],"abstract_inverted_index":{"In":[0],"this":[1,56],"paper,":[2],"the":[3,18,23,34,46,50,101,104,108],"capacitated":[4],"location-routing":[5],"problem":[6,21],"(CLRP)":[7],"is":[8,11,31,52,69,88],"studied.":[9],"CLRP":[10,30,79],"composed":[12],"of":[13,29,37,49,110],"two":[14],"hard":[15],"optimisation":[16],"problems:":[17],"facility":[19],"location":[20,36],"and":[22,81],"vehicle":[24,42],"routing":[25],"problem.":[26],"The":[27,66,118],"objective":[28],"to":[32,75,99],"determine":[33],"best":[35],"multiple":[38],"depots":[39],"with":[40],"their":[41],"routes":[43],"such":[44],"that":[45],"total":[47],"cost":[48],"solution":[51],"minimal.":[53],"To":[54,106],"solve":[55],"problem,":[57],"we":[58],"propose":[59],"a":[60,72,77,83,96],"greedy":[61],"randomised":[62],"adaptive":[63],"search":[64],"procedure.":[65],"proposed":[67],"method":[68],"based":[70],"on":[71],"new":[73,97],"heuristic":[74],"construct":[76,100],"feasible":[78],"solution,":[80],"then":[82],"local":[84],"search-based":[85],"simulated":[86],"annealing":[87],"used":[89,95],"as":[90],"improvement":[91],"phase.":[92],"We":[93],"have":[94],"technique":[98],"clusters":[102],"around":[103],"depots.":[105],"prove":[107],"effectiveness":[109],"our":[111],"algorithm,":[112],"several":[113],"LRP":[114],"instances":[115],"are":[116,121],"used.":[117],"results":[119],"found":[120],"very":[122],"encouraging.":[123]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
