Traveling Salesman Problem with Multiple Drones

@inproceedings{Tu2018TravelingSP,
  title={Traveling Salesman Problem with Multiple Drones},
  author={Phan Anh Tu and N. T. Dat and Pham Quang Dung},
  booktitle={SoICT 2018},
  year={2018}
}
  • Phan Anh Tu, N. T. Dat, Pham Quang Dung
  • Published in SoICT 2018
  • Computer Science
  • Combining trucks and drones in delivering parcels is an emerging research in recent years. In this paper, we investigate an extension of the TSP-D problem in which a truck travels with m (m > 1) drones (called TSP-mD) instead of one drone in TSP-D. We adapt the greedy randomized adaptive search procedure (GRASP) (proposed by Ha et al.) and propose an adaptive large neighborhood search (ALNS) heuristic to the resolution of this problem. Experimental results on different instances show that by… CONTINUE READING
    9 Citations
    Optimizing Drone-Assisted Last-Mile Deliveries: The Vehicle Routing Problem with Flexible Drones
    • Highly Influenced
    • PDF
    Commanding Cooperative UGV-UAV With Nested Vehicle Routing for Emergency Resource Delivery
    • PDF

    References

    SHOWING 1-3 OF 3 REFERENCES
    On the Min-cost Traveling Salesman Problem with Drone
    • 139
    • Highly Influential
    • PDF
    An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows
    • 1,153
    • Highly Influential
    • PDF
    An adaptive large neighborhood search heuristic for the Pickup and Delivery Problem with Time Windows and Scheduled Lines
    • 84
    • Highly Influential
    • PDF