{"id":"https://openalex.org/W2066357329","doi":"https://doi.org/10.4018/ijoris.2015010106","title":"Two Novel Heuristics Based on a New Density Measure for Vehicle Routing Problem","display_name":"Two Novel Heuristics Based on a New Density Measure for Vehicle Routing Problem","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W2066357329","doi":"https://doi.org/10.4018/ijoris.2015010106","mag":"2066357329"},"language":"en","primary_location":{"id":"doi:10.4018/ijoris.2015010106","is_oa":false,"landing_page_url":"https://doi.org/10.4018/ijoris.2015010106","pdf_url":null,"source":{"id":"https://openalex.org/S176018216","display_name":"International Journal of Operations Research and Information Systems","issn_l":"1947-9328","issn":["1947-9328","1947-9336"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320424","host_organization_name":"IGI Global","host_organization_lineage":["https://openalex.org/P4310320424"],"host_organization_lineage_names":["IGI Global"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Operations Research and Information Systems","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/A5016921626","display_name":"Abdesslem Layeb","orcid":"https://orcid.org/0000-0002-6553-8253"},"institutions":[{"id":"https://openalex.org/I4391767747","display_name":"University of Constantine 3","ror":"https://ror.org/04wk25q62","country_code":"DZ","type":"education","lineage":["https://openalex.org/I4391767747"]}],"countries":["DZ"],"is_corresponding":true,"raw_author_name":"Abdesslem Layeb","raw_affiliation_strings":["Department of Information and Applications, University of Constantine II, Constantine, Algeria","Department of Information and Applications, University of Constantine II, Constantine, Algeria#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information and Applications, University of Constantine II, Constantine, Algeria","institution_ids":["https://openalex.org/I4391767747"]},{"raw_affiliation_string":"Department of Information and Applications, University of Constantine II, Constantine, Algeria#TAB#","institution_ids":["https://openalex.org/I4391767747"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5016921626"],"corresponding_institution_ids":["https://openalex.org/I4391767747"],"apc_list":null,"apc_paid":null,"fwci":1.1207,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.8132824,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"6","issue":"1","first_page":"78","last_page":"90"},"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/T12176","display_name":"Optimization and Packing Problems","score":0.9962999820709229,"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.9940999746322632,"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/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.7641482353210449},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7445415258407593},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.7131001949310303},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6887673735618591},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.6854261159896851},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5216851234436035},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4881208837032318},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4787418246269226},{"id":"https://openalex.org/keywords/consistent-heuristic","display_name":"Consistent heuristic","score":0.45677369832992554},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.41758227348327637},{"id":"https://openalex.org/keywords/incremental-heuristic-search","display_name":"Incremental heuristic search","score":0.1351795494556427},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.07515168190002441}],"concepts":[{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.7641482353210449},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7445415258407593},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.7131001949310303},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6887673735618591},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.6854261159896851},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5216851234436035},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4881208837032318},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4787418246269226},{"id":"https://openalex.org/C200246849","wikidata":"https://www.wikidata.org/wiki/Q5163226","display_name":"Consistent heuristic","level":5,"score":0.45677369832992554},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41758227348327637},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.1351795494556427},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.07515168190002441},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.0},{"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":2,"locations":[{"id":"doi:10.4018/ijoris.2015010106","is_oa":false,"landing_page_url":"https://doi.org/10.4018/ijoris.2015010106","pdf_url":null,"source":{"id":"https://openalex.org/S176018216","display_name":"International Journal of Operations Research and Information Systems","issn_l":"1947-9328","issn":["1947-9328","1947-9336"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320424","host_organization_name":"IGI Global","host_organization_lineage":["https://openalex.org/P4310320424"],"host_organization_lineage_names":["IGI Global"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Operations Research and Information Systems","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:igg:joris0:v:6:y:2015:i:1:p:78-90","is_oa":false,"landing_page_url":"https://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/ijoris.2015010106","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W1208385249","https://openalex.org/W1509119367","https://openalex.org/W1582017793","https://openalex.org/W1601649239","https://openalex.org/W1978186990","https://openalex.org/W1988242784","https://openalex.org/W2002356593","https://openalex.org/W2015480187","https://openalex.org/W2017070898","https://openalex.org/W2024061864","https://openalex.org/W2029970827","https://openalex.org/W2056880022","https://openalex.org/W2069973745","https://openalex.org/W2074186253","https://openalex.org/W2081230102","https://openalex.org/W2082153300","https://openalex.org/W2084002770","https://openalex.org/W2089047615","https://openalex.org/W2108753073","https://openalex.org/W2111174053","https://openalex.org/W2111388156","https://openalex.org/W2111563176","https://openalex.org/W2111581650","https://openalex.org/W2114939271","https://openalex.org/W2134946882","https://openalex.org/W2136963152","https://openalex.org/W2148673189","https://openalex.org/W2325343629","https://openalex.org/W3193090537"],"related_works":["https://openalex.org/W3119129187","https://openalex.org/W2470251263","https://openalex.org/W2193306078","https://openalex.org/W2133728917","https://openalex.org/W3125143773","https://openalex.org/W2007032764","https://openalex.org/W803550684","https://openalex.org/W2483226803","https://openalex.org/W3143937874","https://openalex.org/W3177062893"],"abstract_inverted_index":{"The":[0,10,48,69,81,171],"vehicle":[1,66],"routing":[2,67],"problem":[3],"(VRP)":[4],"is":[5,12,31,40,53,84,97,110,122,127,142,161,181],"a":[6,21,93,107,203],"known":[7],"optimization":[8],"problem.":[9,47,68,80],"objective":[11],"to":[13,54,144,150,155,198],"construct":[14],"an":[15],"optimal":[16],"set":[17],"of":[18,23,28,50,78,166,173,206],"routes":[19,153],"serving":[20],"number":[22],"customers":[24,131],"where":[25],"the":[26,34,65,75,90,104,114,117,125,136,139,164,167,174,178,184,191],"demand":[27],"each":[29,38,159],"customer":[30,39,118],"less":[32],"than":[33,183],"vehicle'":[35],"capacity,":[36],"and":[37,59],"visited":[41],"exactly":[42],"once":[43],"like":[44],"in":[45,148],"TSP":[46],"purpose":[49],"this":[51,145],"paper":[52],"present":[55],"new":[56],"deterministic":[57],"heuristic":[58,77,83,180,187],"its":[60],"stochastic":[61],"version":[62],"for":[63,188,202],"solving":[64],"proposed":[70,82,179,192],"algorithms":[71],"are":[72],"inspired":[73],"from":[74],"density":[76,94,115,121],"knapsack":[79],"based":[85],"on":[86],"four":[87],"steps.":[88],"In":[89,103,135],"first":[91],"step":[92],"matrix":[95],"(demand/distance)":[96],"constructed":[98,111],"by":[99,112,163],"using":[100,113],"given":[101],"equations.":[102],"second":[105],"step,":[106],"giant":[108,146],"tour":[109,147],"matrix;":[116],"with":[119],"highest":[120],"firstly":[123],"visited,":[124],"process":[126],"repeated":[128],"until":[129],"all":[130],"will":[132],"be":[133,196],"visited.":[134],"third":[137],"phase,":[138],"split":[140],"procedure":[141],"applied":[143],"order":[149],"get":[151],"feasible":[152],"subject":[154],"vehicles":[156],"capacities.":[157],"Finally,":[158],"route":[160],"improved":[162],"application":[165],"nearest":[168,185],"neighbor":[169,186],"heuristic.":[170],"results":[172],"experiment":[175],"indicate":[176],"that":[177],"better":[182],"VRP.":[189],"Moreover,":[190],"algorithm":[193],"can":[194],"easily":[195],"used":[197],"generate":[199],"initial":[200],"solutions":[201],"wide":[204],"variety":[205],"VRP":[207],"algorithms.":[208]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-06-11T06:19:23.411458","created_date":"2025-10-10T00:00:00"}