NeuFACO: Neural Focused Ant Colony Optimization for Traveling Salesman Problem
This study presents Neural Focused Ant Colony Optimization (NeuFACO), a non-autoregressive framework for the Traveling Salesman Problem (TSP) that combines advanced reinforcement learning with enhanced Ant Colony Optimization (ACO). NeuFACO employs Proximal Policy Optimization (PPO) with entropy regularization to train a graph neural network for instance-specific heuristic guidance, which is integrated into an optimized ACO framework featuring candidate lists, restricted tour refinement, and scalable local search. By leveraging amortized inference alongside ACO stochastic exploration, NeuFACO efficiently produces high-quality solutions across diverse TSP instances.
Code (0)
등록된 구현이 없습니다.
Tasks
Reinforcement LearningGraph Neural NetworkSimilar Papers 제목 키워드 기반
A new approach in dynamic traveling salesman problem: a hybrid of ant colony optimization and descending gradient
Nowadays swarm intelligence-based algorithms are being used widely to optimize the dynamic traveling salesman problem (DTSP). In this paper, we have used mixed method of Ant Colony Optimization (AOC)and gradient descent …
Traveling Salesman ProblemAn Improved ACS Algorithm for the Solutions of Larger TSP Problems
Solving large traveling salesman problem (TSP) in an efficient way is a challenging area for the researchers of computer science. This paper presents a modified version of the ant colony system (ACS) algorithm called Red…
Combinatorial OptimizationTraveling Salesman ProblemThe Generalized Traveling Salesman Problem solved with Ant Algorithms
A well known N P-hard problem called the Generalized Traveling Salesman Problem (GTSP) is considered. In GTSP the nodes of a complete undirected graph are partitioned into clusters. The objective is to find a minimum cos…
Traveling Salesman ProblemUsing Ants as a Genetic Crossover Operator in GLS to Solve STSP
Ant Colony Algorithm (ACA) and Genetic Local Search (GLS) are two optimization algorithms that have been successfully applied to the Traveling Salesman Problem (TSP). In this paper we define new crossover operator then r…
Traveling Salesman ProblemImproving Ant Colony Optimization Efficiency for Solving Large TSP Instances
Ant Colony Optimization (ACO) is a family of nature-inspired metaheuristics often applied to finding approximate solutions to difficult optimization problems. Despite being significantly faster than exact methods, the AC…
CPUTraveling Salesman Problem