Ants can solve the parallel drone scheduling traveling salesman problem
In this work, we are interested in studying the parallel drone scheduling traveling salesman problem (PDSTSP), where deliveries are split between a truck and a fleet of drones. The truck performs a common delivery tour, while the drones are forced to perform back and forth trips between customers an...
Saved in:
Main Authors: | , , |
---|---|
Format: | Bài trích |
Language: | eng |
Published: |
GECCO
2021
|
Online Access: | https://dl.acm.org/doi/10.1145/3449639.3459342 https://dlib.phenikaa-uni.edu.vn/handle/PNK/2861 https://doi.org/10.1145/3449639.3459342 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|