{"id":"https://openalex.org/W1973873255","doi":"https://doi.org/10.1109/ukci.2012.6335752","title":"A fast approximative approach for the Vehicle Routing Problem","display_name":"A fast approximative approach for the Vehicle Routing Problem","publication_year":2012,"publication_date":"2012-09-01","ids":{"openalex":"https://openalex.org/W1973873255","doi":"https://doi.org/10.1109/ukci.2012.6335752","mag":"1973873255"},"language":"en","primary_location":{"id":"doi:10.1109/ukci.2012.6335752","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ukci.2012.6335752","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 12th UK Workshop on Computational Intelligence (UKCI)","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/A5014979931","display_name":"Marta Vallejo","orcid":"https://orcid.org/0000-0001-9957-954X"},"institutions":[{"id":"https://openalex.org/I32062511","display_name":"Heriot-Watt University","ror":"https://ror.org/04mghma93","country_code":"GB","type":"education","lineage":["https://openalex.org/I32062511"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Marta Vallejo","raw_affiliation_strings":["Heriot-Watt University, Edinburgh, UK","Heriot Watt University  Edinburgh UK"],"affiliations":[{"raw_affiliation_string":"Heriot-Watt University, Edinburgh, UK","institution_ids":["https://openalex.org/I32062511"]},{"raw_affiliation_string":"Heriot Watt University  Edinburgh UK","institution_ids":["https://openalex.org/I32062511"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090575787","display_name":"Patr\u00edcia A. Vargas","orcid":"https://orcid.org/0000-0002-3272-2521"},"institutions":[{"id":"https://openalex.org/I32062511","display_name":"Heriot-Watt University","ror":"https://ror.org/04mghma93","country_code":"GB","type":"education","lineage":["https://openalex.org/I32062511"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Patricia A. Vargas","raw_affiliation_strings":["Heriot-Watt University, Edinburgh, UK","Heriot Watt University  Edinburgh UK"],"affiliations":[{"raw_affiliation_string":"Heriot-Watt University, Edinburgh, UK","institution_ids":["https://openalex.org/I32062511"]},{"raw_affiliation_string":"Heriot Watt University  Edinburgh UK","institution_ids":["https://openalex.org/I32062511"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061783148","display_name":"David Corne","orcid":"https://orcid.org/0000-0003-4369-3807"},"institutions":[{"id":"https://openalex.org/I32062511","display_name":"Heriot-Watt University","ror":"https://ror.org/04mghma93","country_code":"GB","type":"education","lineage":["https://openalex.org/I32062511"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"David W. Corne","raw_affiliation_strings":["Heriot-Watt University, Edinburgh, UK","Heriot Watt University  Edinburgh UK"],"affiliations":[{"raw_affiliation_string":"Heriot-Watt University, Edinburgh, UK","institution_ids":["https://openalex.org/I32062511"]},{"raw_affiliation_string":"Heriot Watt University  Edinburgh UK","institution_ids":["https://openalex.org/I32062511"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5014979931"],"corresponding_institution_ids":["https://openalex.org/I32062511"],"apc_list":null,"apc_paid":null,"fwci":2.7392,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.89825499,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"132","issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9997000098228455,"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.9997000098228455,"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.9925000071525574,"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.9805999994277954,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.7444825768470764},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7190689444541931},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6563829779624939},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.654742956161499},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.6506382822990417},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5986912250518799},{"id":"https://openalex.org/keywords/abstraction","display_name":"Abstraction","score":0.5925837159156799},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.5871446132659912},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.5786306858062744},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5760131478309631},{"id":"https://openalex.org/keywords/relation","display_name":"Relation (database)","score":0.5340449213981628},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.5010414123535156},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4826655685901642},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2764629125595093},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.203603595495224},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15429770946502686},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.15149399638175964}],"concepts":[{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.7444825768470764},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7190689444541931},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6563829779624939},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.654742956161499},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.6506382822990417},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5986912250518799},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.5925837159156799},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.5871446132659912},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.5786306858062744},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5760131478309631},{"id":"https://openalex.org/C25343380","wikidata":"https://www.wikidata.org/wiki/Q277521","display_name":"Relation (database)","level":2,"score":0.5340449213981628},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.5010414123535156},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4826655685901642},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2764629125595093},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.203603595495224},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15429770946502686},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.15149399638175964},{"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/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C94625758","wikidata":"https://www.wikidata.org/wiki/Q7163","display_name":"Politics","level":2,"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.1109/ukci.2012.6335752","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ukci.2012.6335752","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 12th UK Workshop on Computational Intelligence (UKCI)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W174230839","https://openalex.org/W1208385249","https://openalex.org/W1487871107","https://openalex.org/W1510454218","https://openalex.org/W1513472112","https://openalex.org/W1518644902","https://openalex.org/W1558547553","https://openalex.org/W1572130003","https://openalex.org/W1972755385","https://openalex.org/W2039766013","https://openalex.org/W2046280257","https://openalex.org/W2069323107","https://openalex.org/W2084151425","https://openalex.org/W2101657530","https://openalex.org/W2111563176","https://openalex.org/W2126415128","https://openalex.org/W2147336456","https://openalex.org/W3000633136","https://openalex.org/W4242361212","https://openalex.org/W4302334632","https://openalex.org/W6630931993","https://openalex.org/W6671460257"],"related_works":["https://openalex.org/W1525389557","https://openalex.org/W2361554335","https://openalex.org/W4297427155","https://openalex.org/W2975368677","https://openalex.org/W3025823153","https://openalex.org/W3136451934","https://openalex.org/W3200006077","https://openalex.org/W2170228269","https://openalex.org/W2017649536","https://openalex.org/W1990067406"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3],"introduce":[4],"a":[5,9,61,86,99,123,133],"three-step":[6],"heuristic":[7],"for":[8],"complex":[10],"version":[11],"of":[12,26,64,70,80,101,122,138],"the":[13,24,45,57,65,71,81,96,116,120],"Vehicle":[14,18],"Routing":[15,19],"Problem.":[16],"The":[17,93,129],"Problem":[20],"is":[21,34,53,91,127],"focused":[22],"on":[23],"design":[25],"optimal":[27],"delivery":[28],"routes.":[29],"A":[30,50,113],"new":[31,87],"memory-based":[32],"approach":[33,90],"developed":[35],"in":[36,48,98,136,143],"order":[37],"to":[38,43,55,59,74,111,145],"gather":[39],"highly":[40],"valuable":[41],"experience":[42],"predict":[44],"best":[46],"routes":[47],"advance.":[49],"clustering":[51],"representation":[52],"proposed":[54],"allow":[56],"system":[58],"achieve":[60],"simplified":[62],"abstraction":[63],"model":[66],"and":[67,119,140],"making":[68],"use":[69],"pre-existing":[72],"knowledge":[73],"solve":[75],"more":[76,102],"efficiently":[77],"real":[78],"instances":[79],"problem.":[82],"With":[83],"these":[84],"elements":[85],"approximative":[88,147],"fast":[89],"developed.":[92],"process":[94],"transforms":[95],"VRP":[97],"set":[100],"simple":[103],"Travelling":[104],"Salesman":[105],"Problems":[106],"which":[107],"are":[108],"remarkably":[109],"easier":[110],"solve.":[112],"comparison":[114],"between":[115],"results":[117,131],"achieved":[118],"application":[121],"genetic":[124],"algorithm":[125],"technique":[126],"performed.":[128],"obtained":[130],"demonstrate":[132],"noteworthy":[134],"improvement":[135],"terms":[137],"performance":[139],"time":[141],"consumption":[142],"relation":[144],"previous":[146],"approaches.":[148]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2014,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}