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: | Quoc Trung Dinh, Duc Dong Do, Minh Hoàng Hà |
---|---|
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!
|
Similar Items
-
The min-cost parallel drone scheduling vehicle routing problem
by: Minh Anh Nguyen, et al.
Published: (2021) -
A two-stage RNN-based deep reinforcement learning approach for solving the parallel machine scheduling problem with due dates and family setups
by: Funing, Li, et al.
Published: (2023) -
ADTs, Data structures and problem solving with C++ /
by: Nyhoff, Larry
Published: (2006) -
Java, Java, Java: Object-Oriented Problem Solving
by: Morelli, Ralph, et al.
Published: (2022) -
Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery
by: Duc Minh, Vu, et al.
Published: (2022)