Hybrid Pointer Networks for Traveling Salesman Problems Optimization

1 code implementation • 6 Oct 2021 • Ahmed Stohy, Heba-Tullah Abdelhakam, Sayed Ali, Mohammed Elhenawy, Abdallah A Hassan, Mahmoud Masoud, Sebastien Glaser, Andry Rakotonirainy

Our network significantly outperforms the original graph pointer network for small and large-scale problems increasing its performance for TSP50 from 5. 959 to 5. 706 without utilizing 2opt, Pointer networks, Attention model, and a wide range of models, producing results comparable to highly tuned and specialized algorithms.

Combinatorial Optimization Graph Embedding +1