TỐI ƯU HÓA LỘ TRÌNH XE TẢI KẾT HỢP DRONE TRONG BÀI TOÁN GIAO HÀNG CHẶNG CUỐI DỰA TRÊN MÔ HÌNH CHẶNG HAI CHỈ SỐ

Abstract

This paper investigates the Flying Sidekick Traveling Salesman Problem (FSTSP), a breakthrough solution for last-mile logistics. We propose a Mixed-Integer Linear Programming (MILP) model based on a 2-index stage-based formulation. Unlike traditional arc-based models, this approach assigns customers to ordered stages, significantly reducing the number of binary variables and automatically eliminating subtour constraints. Numerical experiments on the Niels Agatz (2018) benchmark datasets with up to 45 customers demonstrate that the model achieves superior performance in terms of convergence time and solution quality. Finally, the study suggests a future research direction by integrating this model into the Construct-Merge-Solve & Adapt (CMSA) hybrid metaheuristic framework to address larger-scale problems.