Please use this identifier to cite or link to this item:
|Title:||Goods consumed during transit in split delivery vehicle routing problems : modeling and solution||Authors:||Yang, Wenzhe
|Keywords:||Engineering::Computer science and engineering||Issue Date:||2020||Source:||Yang, W., Wang, D., Pang, W., Tan, A.-H., & Zhou, Y. (2020). Goods consumed during transit in split delivery vehicle routing problems : modeling and solution. IEEE Access, 8, 110336-110350. doi:10.1109/ACCESS.2020.3001590||Project:||NWJ-2019-002||Journal:||IEEE Access||Abstract:||This article presents the modeling and solution of an extended type of split delivery vehicle routing problem (SDVRP). In SDVRP, the demands of customers need to be met by efficiently routing a given number of capacitated vehicles, wherein each customer may be served multiple times by more than one vehicle. Furthermore, in many real-world scenarios, consumption of vehicles en route is the same as the goods being delivered to customers, such as food, water and fuel in rescue or replenishment missions in harsh environments. Moreover, the consumption may also be in virtual forms, such as time spent in constrained tasks. We name such a real-world SDVRP as Split Delivery Vehicle Routing Problem with Goods Consumed during Transit (SDVRP-GCT). In this paper, we give mathematical formulas to model SDVRP-GCT and provide solutions by extending three ant colony algorithms. To the best of our knowledge, this is the first research work specifically focussing on the SDVRP-GCT problem and its solutions. To assess the effectiveness of our proposed ant colony algorithms, we first apply them on widely adopted SDVRP benchmarking instances on different scales and their correspondingly extended SDVRP-GCT instances. Then, we formulate a real-world SDVRP-GCT instance for further assessment. Based on the extensive experimental results, we discuss the pros and cons of our proposed solutions and subsequently suggest their preferable application scenarios. In summary, our proposed solutions are shown as highly efficient in solving SDVRP-GCT instances.||URI:||https://hdl.handle.net/10356/145637||ISSN:||2169-3536||DOI:||10.1109/ACCESS.2020.3001590||Rights:||© 2020 IEEE. This journal is 100% open access, which means that all content is freely available without charge to users or their institutions. All articles accepted after 12 June 2019 are published under a CC BY 4.0 license, and the author retains copyright. Users are allowed to read, download, copy, distribute, print, search, or link to the full texts of the articles, or use them for any other lawful purpose, as long as proper attribution is given.||Fulltext Permission:||open||Fulltext Availability:||With Fulltext|
|Appears in Collections:||SCSE Journal Articles|
Updated on May 16, 2021
Updated on May 16, 2021
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.