Optimization of Multi-Agent Flying Sidekick Traveling Salesman Problem over Road Networks
<|reference_start|>Optimization of Multi-Agent Flying Sidekick Traveling Salesman Problem over Road Networks: The mixed truck-drone delivery systems have attracted increasing attention for last-mile logistics, but real-world complexities demand a shift from single-agent, fully connected graph models to multi-agent systems operating on actual road networks. We introduce the multi-agent flying sidekick traveling salesman problem (MA-FSTSP) on road networks, extending the single truck-drone model to multiple trucks, each carrying multiple drones while considering full road networks for truck restrictions and flexible drone routes. We propose a mixed-integer linear programming model and an efficient three-phase heuristic algorithm for this NP-hard problem. Our approach decomposes MA-FSTSP into manageable subproblems of one truck with multiple drones. Then, it computes the routes for trucks without drones in subproblems, which are used in the final phase as heuristics to help optimize drone and truck routes simultaneously. Extensive numerical experiments on Manhattan and Boston road networks demonstrate our algorithm's superior effectiveness and efficiency, significantly outperforming both column generation and variable neighborhood search baselines in solution quality and computation time. Notably, our approach scales to more than 300 customers within a 5-minute time limit, showcasing its potential for large-scale, real-world logistics applications.<|reference_end|>
@article{yang2024optimization,
    title={Optimization of Multi-Agent Flying Sidekick Traveling Salesman Problem
  over Road Networks},
    author={Ruixiao Yang and Chuchu Fan},
    journal={arXiv preprint arXiv:2408.11187},
    year={2024},
    archivePrefix={arXiv},
    eprint={2408.11187},
    primaryClass={cs.RO cs.AI cs.MA}
}