PLoS ONE (Jan 2021)

Hybrid pointer networks for traveling salesman problems optimization.

  • Ahmed Stohy,
  • Heba-Tullah Abdelhakam,
  • Sayed Ali,
  • Mohammed Elhenawy,
  • Abdallah A Hassan,
  • Mahmoud Masoud,
  • Sebastien Glaser,
  • Andry Rakotonirainy

DOI
https://doi.org/10.1371/journal.pone.0260995
Journal volume & issue
Vol. 16, no. 12
p. e0260995

Abstract

Read online

In this work, we proposed a hybrid pointer network (HPN), an end-to-end deep reinforcement learning architecture is provided to tackle the travelling salesman problem (TSP). HPN builds upon graph pointer networks, an extension of pointer networks with an additional graph embedding layer. HPN combines the graph embedding layer with the transformer's encoder to produce multiple embeddings for the feature context. We conducted extensive experimental work to compare HPN and Graph pointer network (GPN). For the sack of fairness, we used the same setting as proposed in GPN paper. The experimental results show that our network significantly outperforms the original graph pointer network for small and large-scale problems. For example, it reduced the cost for travelling salesman problems with 50 cities/nodes (TSP50) from 5.959 to 5.706 without utilizing 2opt. Moreover, we solved benchmark instances of variable sizes using HPN and GPN. The cost of the solutions and the testing times are compared using Linear mixed effect models. We found that our model yields statistically significant better solutions in terms of the total trip cost. We make our data, models, and code publicly available https://github.com/AhmedStohy/Hybrid-Pointer-Networks.