Full metadata record
DC FieldValueLanguage
dc.contributor.authorHan, Anthony Fu-Whaen_US
dc.contributor.authorChu, Yu-Chingen_US
dc.date.accessioned2017-04-21T06:55:18Z-
dc.date.available2017-04-21T06:55:18Z-
dc.date.issued2016-04en_US
dc.identifier.issn1366-5545en_US
dc.identifier.urihttp://dx.doi.org/10.1016/j.tre.2016.01.014en_US
dc.identifier.urihttp://hdl.handle.net/11536/133819-
dc.description.abstractWe propose a new multi-start solution approach for the split-delivery vehicle routing problem with minimum delivery amounts (SDVRP-MDA). Initial solutions are generated by both node-insertion and route-addition procedures with a single parameter to control the restart. These solutions are then improved by a variable neighborhood descent metaheuristic with a novel search operator inspired by node-ejection chains. We test the proposed approach with 32 benchmark instances for four different minimum delivery fractions. Using the proposed algorithm, out of 128 cases tested, we find 81 best known solutions and 34 new best solutions; overall, we find 43 new best solutions. (C) 2016 Elsevier Ltd. All rights reserved.en_US
dc.language.isoen_USen_US
dc.subjectVehicle routingen_US
dc.subjectSplit deliveryen_US
dc.subjectMinimal delivery amounten_US
dc.subjectVariable neighborhood descenten_US
dc.subjectNode-ejection chainsen_US
dc.subjectHeuristicsen_US
dc.titleA multi-start heuristic approach for the split-delivery vehicle routing problem with minimum delivery amountsen_US
dc.identifier.doi10.1016/j.tre.2016.01.014en_US
dc.identifier.journalTRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEWen_US
dc.citation.volume88en_US
dc.citation.spage11en_US
dc.citation.epage31en_US
dc.contributor.department運輸與物流管理系 註:原交通所+運管所zh_TW
dc.contributor.departmentDepartment of Transportation and Logistics Managementen_US
dc.identifier.wosnumberWOS:000374598500002en_US
Appears in Collections:Articles