Large-scale routing often requires visiting clusters of nodes in a prescribed order, giving rise to the Ordered Clustered Traveling Salesman Problem (OCTSP). Optimizing each cluster independently seems natural, but misses non-local dependencies. We introduce the COMPASS algorithm for OCTSP, which combines search with l...
Ido Greenberg, Hugo Linsenmaier, P. Sielski et al.· 0 citations
This work introduces an optimization framework where a reinforcement learning agent is trained on prior instances and quickly generates initial solutions, which are then further optimized by a genetic algorithm, enabling real-time and interactive routing at scale.
Ido Greenberg, P. Sielski, Hugo Linsenmaier et al.· Communications AI & Computin...· 1 citation
Dimension reduction for dynamical systems is standard practice, and the standard route is spectral: model the transfer (Koopman) operator by its leading modes. We show that on systems assembled from several weakly interacting components --- a structure common in physical and biological settings --- this may either requ...
Mark Kozdoba, Shie Mannor· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.