A variable neighborhood search algorithm for locker-based drone delivery makespan minimization problem
| Year of publication: |
2024
|
|---|---|
| Authors: | Zhu, Waiming ; Sun, Haiquan ; Hu, Xiaoxuan ; Ma, Yingying |
| Published in: |
Transportation research : an international journal. - Oxford : Pergamon, Elsevier Science, ISSN 1878-5794, ZDB-ID 2013782-5. - Vol. 192.2024, Art.-No. 103820, p. 1-18
|
| Subject: | Locker-based drone delivery | Routing and parking problem | Time-expanded network | Variable neighborhood search | Scheduling-Verfahren | Scheduling problem | Tourenplanung | Vehicle routing problem | Durchlaufzeit | Lead time | Algorithmus | Algorithm | Heuristik | Heuristics | Theorie | Theory | Parken | Parking |
-
Nsakanda, Aaron Luntala, (2011)
-
Scheduling Parallel Machines with Single Vehicle Delivery
Cakici, Eray, (2015)
-
Minimizing the total completion time of an urban delivery problem with uncertain assembly time
Liu, Bingbing, (2019)
- More ...
-
Orientational variable-length strip covering problem : a branch-and-price-based algorithm
Hu, Xiaoxuan, (2021)
-
Hu, Xiaoxuan, (2019)
-
State Shift Digraph based Branch and Cut for the Locker based Drone Delivery Problem
Zhu, Waiming, (2022)
- More ...