Collaborative Delivery Optimization With Multiple Drones via Constrained Hybrid Pointer Network
dc.contributor.author | Kong, Fanhui | |
dc.contributor.author | Jiang, Bin | |
dc.contributor.author | Wang, Jian | |
dc.contributor.author | Wang, Huihui | |
dc.contributor.author | Song, Houbing | |
dc.date.accessioned | 2023-10-17T18:22:09Z | |
dc.date.available | 2023-10-17T18:22:09Z | |
dc.date.issued | 2023-09-25 | |
dc.description.abstract | Drone participation in truck delivery is a potential booster for the last-mile logistics system, which has been an emerging hot research field. Among that, how to arrange a fleet of drones from the truck and optimize the vehicle routing problem with drones (VRPD) is a key issue. However, most existing studies fail to derive the feasible solutions due to unordered customer distributions and multi-variant drone feature constraints. In this paper, we propose a novel self-driven reinforcement learning structure, named constraint-based hybrid pointer network(CH-Ptr-Net) model, which is a hybrid pointer network approach composed of graph neural network(GNN) embedding and attention decoder. We go into developing the simpler embedding version for multiple drones-assisted truck delivery. The CH-Ptr-Net model tends to generate a set of optimal delivery sequence, after constructing the mixed integer linear program(MILP) formulation. Extensive numerical testing indicates that the proposed method performs better than recent exact and heuristic approaches for collaborative delivery routing optimization with the truck carrying multiple drones. | en_US |
dc.description.sponsorship | This work was supported in part by Humanities and Social Sciences Research Project of the Ministry of Education of China under Grant 21YJC630051, National Natural Science Foundation of China under Grant 62102264, Youth Foundation of Shandong Natural Science Foundation under Grant ZR2023QG034, Youth Innovation University Team Project in Shandong under Grant 2022KJ062, Independent Innovation Fund of China University of Petroleum (East China) under Grant 22CX06056A and Talent Project of Qingdao University of Technology under Grant 901020220046. | en_US |
dc.description.uri | https://ieeexplore.ieee.org/abstract/document/10261492 | en_US |
dc.format.extent | 16 pages | en_US |
dc.genre | journal articles | en_US |
dc.genre | postprints | en_US |
dc.identifier | doi:10.13016/m2l95z-xb8w | |
dc.identifier.citation | Kong, Fanhui, Bin Jiang, Jian Wang, Huihui Wang, and Houbing Song. “Collaborative Delivery Optimization With Multiple Drones via Constrained Hybrid Pointer Network.” IEEE Internet of Things Journal, 2023, 1–1. https://doi.org/10.1109/JIOT.2023.3318524. | en_US |
dc.identifier.uri | https://doi.org/10.1109/JIOT.2023.3318524 | |
dc.identifier.uri | http://hdl.handle.net/11603/30235 | |
dc.language.iso | en_US | en_US |
dc.publisher | IEEE | en_US |
dc.relation.isAvailableAt | The University of Maryland, Baltimore County (UMBC) | |
dc.relation.ispartof | UMBC Information Systems Department Collection | |
dc.relation.ispartof | UMBC Faculty Collection | |
dc.rights | © 2023 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. | en_US |
dc.title | Collaborative Delivery Optimization With Multiple Drones via Constrained Hybrid Pointer Network | en_US |
dc.type | Text | en_US |
dcterms.creator | https://orcid.org/0000-0003-2631-9223 | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Collaborative_Delivery_Optimization_With_Multiple_Drones_via_Constrained_Hybrid_Pointer_Network.pdf
- Size:
- 3.37 MB
- Format:
- Adobe Portable Document Format
- Description:
License bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- license.txt
- Size:
- 2.56 KB
- Format:
- Item-specific license agreed upon to submission
- Description: