An End-to-End Learning Approach for Solving Capacitated Location-Routing Problems 事件

An End-to-End Learning Approach for Solving Capacitated Location-Routing Problems arXiv:2511.02525v2 Announce Type: replace-cross Abstract: The capacitated location-routing problems (CLRPs) are classical problems in combinatorial optimization, which require simultaneously making location and routing decisions. In CLRPs, the complex constraints and the intricate relationships between various decisions make the problem challenging to solve. With the emergence of deep reinforcement learning (DRL),