EUVIMEDEUVIMED entdecken
Crossref

Pointerformer: Deep Reinforced Multi-Pointer Transformer for the Traveling Salesman Problem

Yan Jin, Yuandong Ding, Xuanhao Pan, Kun He, Li Zhao, Tao Qin, Lei Song, Jiang Bian

Proceedings of the AAAI Conference on Artificial Intelligence · 26.06.2023 · 37 (7) · 8132-8140

DOI: 10.1609/aaai.v37i7.25982 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Proceedings of the AAAI Conference on Artificial Intelligence, online erschienen am 26.06.2023. Verfasst von Yan Jin und 7 weiteren Autor:innen. Die Arbeit wurde bisher 49-mal zitiert (Crossref).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Traveling Salesman Problem (TSP), as a classic routing optimization problem originally arising in the domain of transportation and logistics, has become a critical task in broader domains, such as manufacturing and biology. Recently, Deep Reinforcement Learning (DRL) has been increasingly employed to solve TSP due to its high inference efficiency. Nevertheless, most of existing end-to-end DRL algorithms only perform well on small TSP instances and can hardly generalize to large scale because of the drastically soaring memory consumption and computation time along with the enlarging problem scale. In this paper, we propose a novel end-to-end DRL approach, referred to as Pointerformer, based on multi-pointer Transformer. Particularly, Pointerformer adopts both reversible residual network in the encoder and multi-pointer network in the decoder to effectively contain memory consumption of the encoder-decoder architecture. To further improve the performance of TSP solutions, Pointerformer employs a feature augmentation method to explore the symmetries of TSP at both training and inference stages as well as an enhanced context embedding approach to include more comprehensive context information in the query. Extensive experiments on a randomly generated benchmark and a public benchmark have shown that, while achieving comparative results on most small-scale TSP instances as state-of-the-art DRL approaches do, Pointerformer can also well generalize to large-scale TSPs.

Zitieren

APA

Jin, Y., Ding, Y., Pan, X., He, K., Zhao, L., Qin, T., Song, L., & Bian, J. (2023). Pointerformer: Deep Reinforced Multi-Pointer Transformer for the Traveling Salesman Problem. Proceedings of the AAAI Conference on Artificial Intelligence, 37(7), 8132-8140. https://doi.org/10.1609/aaai.v37i7.25982

Vancouver

Jin Y, Ding Y, Pan X, He K, Zhao L, Qin T, et al. Pointerformer: Deep Reinforced Multi-Pointer Transformer for the Traveling Salesman Problem. Proceedings of the AAAI Conference on Artificial Intelligence. 2023;37(7):8132-8140. doi:10.1609/aaai.v37i7.25982

BibTeX
@article{Jin2023,
  author = {Jin, Yan and Ding, Yuandong and Pan, Xuanhao and He, Kun and Zhao, Li and Qin, Tao and Song, Lei and Bian, Jiang},
  title = {Pointerformer: Deep Reinforced Multi-Pointer Transformer for the Traveling Salesman Problem},
  journal = {Proceedings of the AAAI Conference on Artificial Intelligence},
  year = {2023},
  volume = {37},
  number = {7},
  pages = {8132--8140},
  doi = {10.1609/aaai.v37i7.25982}
}
Kostenlos starten →