Abstract: This paper proposes a Multiple Population Adaptive Memetic Algorithm (MPAMA) for efficient Traveling Salesman Problem (TSP) optimization, integrating genetic algorithms with 2-opt local ...

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 ...

This package solves the Traveling Salesman Problem with Drone (TSP-D) with 1 truck and 1 drone. This implements the Divide-Partition-and-Search (DPS) algorithm and the Deep Reinforcement Learning (DRL ...

Asymmetric TSP is a type of TSP that is on a directed graph which means paths may not exist in both directions between nodes or the distances might be different. Based on simulated annealing, this ...