This project implements a solution for the Travelling Salesman Problem (TSP) using bitmasking and dynamic programming. It calculates the shortest possible route that visits every city exactly once and ...

Abstract: Metaheuristic algorithms have demonstrated strong effectiveness in solving complex real-world optimization problems. This paper presents two discrete metaheuristic approaches for the ...

Abstract: The traveling salesman problem is a classical and challenging optimization problem in combinatorial optimization, widely applied in logistics and path planning. To address this problem ...

In modern logistics, combining traditional trucks with drones can significantly reduce delivery times. The truck acts as a moving launchpad, performing deliveries ...