An Efficient Adaptive Large Neighborhood Search Algorithm for the Flying Sidekick Traveling Salesman Problem

This paper investigates the Flying Sidekick Traveling Salesman Problem (FSTSP), and proposes an efficient Adaptive Large Neighborhood Search (ALNS) algorithm. Our proposed framework operates directly on a complete solution representation, eliminating the reconstruction step required by indirect encodings and making temporal information immediately accessible during the search process. A stage-based mechanism is introduced to efficiently … Read more

A 2-index Stage-based Formulation and a Construct-Merge-Solve & Adapt Algorithm for the Flying Sidekick Traveling Salesman Problem

In this work, we present the first 2-index stage-based formulation for the Flying Sidekick Traveling Salesman Problem (FSTSP). Additionally, we propose a Construct-Merge-Solve & Adapt (CMSA) algorithm designed to generate high-quality feasible solutions. Experimental results demonstrate that the proposed algorithm consistently produces good solutions in a fraction of the time required by state-of-the-art mixed-integer linear … Read more