Integrated scheduling of m-truck, m-drone, and m-depot constrained by time-window, drop-pickup, and m-visit using constraint programming
•A drone scheduling problem is extended to consider drop and pickup syncronization.•A constraint programming is applied to UAVs transportation scheduling problem.•Integrated scheduling of multiple depots is studied. The idea of deploying unmanned aerial vehicles, also known as drones, for final-mile...
Uloženo v:
| Vydáno v: | Transportation research. Part C, Emerging technologies Ročník 91; s. 1 - 14 |
|---|---|
| Hlavní autor: | |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier Ltd
01.06.2018
|
| Témata: | |
| ISSN: | 0968-090X, 1879-2359 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | •A drone scheduling problem is extended to consider drop and pickup syncronization.•A constraint programming is applied to UAVs transportation scheduling problem.•Integrated scheduling of multiple depots is studied.
The idea of deploying unmanned aerial vehicles, also known as drones, for final-mile delivery in logistics operations has vitalized this new research stream. One conceivable scenario of using a drone in conjunction with a traditional delivery truck to distribute parcels is discussed in earlier literature and termed the parallel drone scheduling traveling salesman problem (PDSTSP). This study extends the problem by considering two different types of drone tasks: drop and pickup. After a drone completes a drop, the drone can either fly back to depot to deliver the next parcels or fly directly to another customer for pickup. Integrated scheduling of multiple depots hosting a fleet of trucks and a fleet of drones is further studied to achieve an operational excellence. A vehicle that travels near the boundary of the coverage area might be more effective to serve customers that belong to the neighboring depot. This problem is uniquely modeled as an unrelated parallel machine scheduling with sequence dependent setup, precedence-relationship, and reentrant, which gives us a framework to effectively consider those operational challenges. A constraint programming approach is proposed and tested with problem instances of m-truck, m-drone, m-depot, and hundred-customer distributed across an 8-mile square region. |
|---|---|
| ISSN: | 0968-090X 1879-2359 |
| DOI: | 10.1016/j.trc.2018.03.025 |