REVIEW 2 cited by
Learning the Multiple Traveling Salesmen Problem with Permutation Invariant Pooling Networks
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
While there are optimal TSP solvers, as well as recent learning-based approaches, the generalization of the TSP to the Multiple Traveling Salesmen Problem is much less studied. Here, we design a neural network solution that treats the salesmen, cities and depot as three different sets of varying cardinalities. We apply a novel technique that combines elements from recent architectures that were developed for sets, as well as elements from graph networks. Coupled with new constraint enforcing output layers, a dedicated loss, and a search method, our solution is shown to outperform all the meta-heuristics of the leading solver in the field.
Forward citations
Cited by 2 Pith papers
-
Deep Reinforcement Learning Enabled Persistent Surveillance with Energy-Aware UAV-UGV Systems for Disaster Management Applications
A transformer DRL policy for persistent UAV-UGV surveillance, with drones recharging on a moving ground vehicle, beats OR-Tools heuristics and the Attention Model on simulated age-period objectives.
-
Learning-aided Bigraph Matching Approach to Multi-Crew Restoration of Damaged Power Networks Coupled with Road Transportation Networks
Learned incentive functions plus bipartite matching allocate repair crews across damaged power and transportation networks, restoring power faster than random policies and small mixed-integer optimization baselines in...
Discussion (0). Continue with ORCID to comment.