A New Algorithm Makes It Faster to Find the Shortest Paths

A canonical problem in computer science is to find the shortest route to every point in a network. A new approach beats the ...
IEEE

Deep Reinforcement Learning Algorithm Based on Graph Weight Multi-Pointer Network for Solving Multiobjective Traveling Salesman Problem

Abstract: The multiobjective traveling salesman problem (MOTSP) is a class of classical multiobjective combinatorial optimization problems (MOCOPs), attracting significant interest across various ...
IEEE

Towards Generalizable Meta-Deep Reinforcement Learning Algorithm for Multi-Objective Traveling Salesman Problems

Abstract: The multi-objective traveling salesman problem (MOTSP) is a representative class of multi-objective combinatorial optimization problems, with significant implications for both theoretical ...