Zhenzhen Zhang

Neural Combinatorial Optimization for Robust Routing Problem with Uncertain Travel Times

We consider the robust routing problem with uncertain travel times under the min-max regret criterion, which represents an extended and robust version of the classic traveling salesman problem (TSP) and vehicle routing problem (VRP). The general budget uncertainty set is employed to capture the unce…