Neural Combinatorial Optimization for Robust Routing Problem with Uncertain Travel Times

The classic Traveling Salesman Problem (TSP) and V ehicle Routing Problem (VRP) represent fundamental NP-hard combinatorial optimization challenges. In these routing problems, an agent commences from a designated node and fulfills specific task requisites. The primary objective is to minimize the total travel time or cost of access.