{"id":"https://openalex.org/W2427648012","doi":"https://doi.org/10.1109/isda.2015.7489230","title":"Heuristic approaches to Double Vehicle Routing Problem with Multiple Stacks","display_name":"Heuristic approaches to Double Vehicle Routing Problem with Multiple Stacks","publication_year":2015,"publication_date":"2015-12-01","ids":{"openalex":"https://openalex.org/W2427648012","doi":"https://doi.org/10.1109/isda.2015.7489230","mag":"2427648012"},"language":"en","primary_location":{"id":"doi:10.1109/isda.2015.7489230","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isda.2015.7489230","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 15th International Conference on Intelligent Systems Design and Applications (ISDA)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5060389011","display_name":"Ulisses E. F. Silveira","orcid":null},"institutions":[{"id":"https://openalex.org/I146165071","display_name":"Universidade Federal de Vi\u00e7osa","ror":"https://ror.org/0409dgb37","country_code":"BR","type":"education","lineage":["https://openalex.org/I146165071"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Ulisses Eduardo Ferreira da Silveira","raw_affiliation_strings":["Departmento de Inform\u00e1tica, Universidade Federal de Vicosa, Vicosa, MG, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Departmento de Inform\u00e1tica, Universidade Federal de Vicosa, Vicosa, MG, Brazil","institution_ids":["https://openalex.org/I146165071"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047406902","display_name":"Marcelo Pinheiro Leite Benedito","orcid":"https://orcid.org/0000-0002-1816-8261"},"institutions":[{"id":"https://openalex.org/I146165071","display_name":"Universidade Federal de Vi\u00e7osa","ror":"https://ror.org/0409dgb37","country_code":"BR","type":"education","lineage":["https://openalex.org/I146165071"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Marcelo Pinheiro Leite Benedito","raw_affiliation_strings":["Departmento de Inform\u00e1tica, Universidade Federal de Vicosa, Vicosa, MG, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Departmento de Inform\u00e1tica, Universidade Federal de Vicosa, Vicosa, MG, Brazil","institution_ids":["https://openalex.org/I146165071"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086393146","display_name":"Andr\u00e9 Gustavo dos Santos","orcid":"https://orcid.org/0000-0002-5743-3523"},"institutions":[{"id":"https://openalex.org/I146165071","display_name":"Universidade Federal de Vi\u00e7osa","ror":"https://ror.org/0409dgb37","country_code":"BR","type":"education","lineage":["https://openalex.org/I146165071"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Andre Gustavo dos Santos","raw_affiliation_strings":["Departmento de Inform\u00e1tica, Universidade Federal de Vi\u00e7osa, Minas Gerais, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Departmento de Inform\u00e1tica, Universidade Federal de Vi\u00e7osa, Minas Gerais, Brazil","institution_ids":["https://openalex.org/I146165071"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I146165071"],"apc_list":null,"apc_paid":null,"fwci":2.0491,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.86863743,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"60","issue":null,"first_page":"231","last_page":"236"},"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/T12176","display_name":"Optimization and Packing Problems","score":0.9965000152587891,"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.9948999881744385,"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/heuristics","display_name":"Heuristics","score":0.7626811861991882},{"id":"https://openalex.org/keywords/iterated-local-search","display_name":"Iterated local search","score":0.7316038608551025},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.7236098051071167},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7025350332260132},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.6830118298530579},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.6802313327789307},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6354195475578308},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5467161536216736},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5406361222267151},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.5372666120529175},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.44985613226890564},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.3201982378959656},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.28248316049575806},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17500212788581848},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.11223217844963074}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7626811861991882},{"id":"https://openalex.org/C124145224","wikidata":"https://www.wikidata.org/wiki/Q6094397","display_name":"Iterated local search","level":3,"score":0.7316038608551025},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.7236098051071167},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7025350332260132},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.6830118298530579},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.6802313327789307},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6354195475578308},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5467161536216736},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5406361222267151},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5372666120529175},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.44985613226890564},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.3201982378959656},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28248316049575806},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17500212788581848},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.11223217844963074},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isda.2015.7489230","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isda.2015.7489230","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 15th International Conference on Intelligent Systems Design and Applications (ISDA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Life below water","score":0.7300000190734863,"id":"https://metadata.un.org/sdg/14"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1525106674","https://openalex.org/W1601649239","https://openalex.org/W1965292088","https://openalex.org/W1993924585","https://openalex.org/W2020737022","https://openalex.org/W2050841472","https://openalex.org/W2216725884","https://openalex.org/W2913330360","https://openalex.org/W4285719527","https://openalex.org/W6680027655"],"related_works":["https://openalex.org/W2392101695","https://openalex.org/W2083844986","https://openalex.org/W2361943787","https://openalex.org/W3117281083","https://openalex.org/W2273445235","https://openalex.org/W2403875102","https://openalex.org/W2411789204","https://openalex.org/W3112607009","https://openalex.org/W2271841533","https://openalex.org/W2918713997"],"abstract_inverted_index":{"The":[0,117,137,169,182],"Double":[1,12],"Routing":[2],"Vehicle":[3],"Problem":[4,15],"with":[5,16,20,124,133],"Multiple":[6,17],"Stacks":[7,18],"(DVRPMS)":[8],"consists":[9,49],"in":[10,34,128,141],"a":[11,56,122,129,188,199,202],"Traveling":[13],"Salesman":[14],"(DTSPMS)":[19],"multiple":[21],"vehicles.":[22],"Both":[23,150],"problems":[24],"appeared":[25],"for":[26,41,99,159,166],"the":[27,35,65,72,78,100,104,134,147,178,191,194],"urgent":[28],"need":[29],"of":[30,50,84,193,201],"optimizing":[31],"intermodal":[32,46],"transportation":[33],"european":[36],"context.":[37],"Consolidated":[38],"economies":[39],"call":[40],"logistics":[42],"studies,":[43],"particularly":[44],"on":[45,103],"transportation,":[47],"which":[48],"using":[51],"different":[52],"transport":[53],"modes":[54],"between":[55],"start":[57],"point":[58],"and":[59,77,112,144,152,162],"an":[60],"end":[61],"point.":[62],"In":[63,92],"DVRPMS,":[64],"collecting":[66],"region":[67,74],"is":[68,119],"usually":[69],"connected":[70],"to":[71,120,146,156,164,173,190],"delivery":[73],"by":[75,89],"sea,":[76],"cities":[79],"that":[80,131],"make":[81],"up":[82],"each":[83],"these":[85],"regions":[86],"are":[87],"interconnected":[88],"land":[90],"routes.":[91],"this":[93],"paper,":[94],"we":[95],"propose":[96],"three":[97],"heuristics":[98,138],"DVRPMS":[101],"based":[102],"Iterated":[105],"Local":[106],"Search":[107],"(ILS),":[108],"Simulated":[109],"Annealing":[110],"(SA)":[111],"Variable":[113],"Neighborhood":[114],"Descent":[115],"(VND).":[116],"objective":[118],"provide":[121],"route":[123],"near":[125],"optimum":[126],"cost":[127],"timeframe":[130],"complies":[132],"customer's":[135],"needs.":[136],"were":[139],"applied":[140],"known":[142,180],"instances":[143,161],"compared":[145],"exact":[148],"method.":[149],"ILS":[151],"SA":[153,170],"algorithms":[154],"showed":[155],"be":[157],"satisfactory":[158],"small":[160],"open":[163],"improvement":[165],"large":[167],"instances.":[168],"algorithm":[171,184],"managed":[172],"find":[174],"solutions":[175],"better":[176],"than":[177,197],"best":[179],"upperbound.":[181],"VND":[183],"served":[185],"more":[186],"as":[187,198],"guide":[189],"quality":[192],"initial":[195],"solution":[196],"provider":[200],"good":[203],"final":[204],"solution.":[205]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}