Art

J-GLOBAL ID：201902277492205808   Reference number：19A0897779

Solving Combinatorial Optimization Problems Using Deep Learning

深層学習を用いた巡回セールスマン問題の解法

Author (2)： MIKI SHOUMA (関西大 大学院) ,  EBARA HIROYUKI (関西大)
Material： 情報処理学会論文誌ジャーナル(Web)
Volume： 60  Issue： 2  Page： 651-659 (WEB ONLY)  Publication year： Feb. 15, 2019 
JST Material Number： U0452A  ISSN： 1882-7764  Document type： Article
Article type： 原著論文  Country of issue： Japan (JPN)  Language： JAPANESE (JA)

Thesaurus term： *traveling salesman problem ,  *combinatorial optimization problem ,  machine learning ,  neural network(biomodel) ,  optimum route ,  local search method
Semi thesaurus term： deep learning ,  convolutional neuralnetwork ,  optimum route

JST classification (3)： Network methods  (KA03040X) ,  Other methods of operations research  (KA03070E) ,  Artificial intelligence  (JE08000Z)

Reference (15)：

• Helsgaun, K.: General k-opt submoves for the Lin-Kernighan TSP heuristic, Mathematical Programming Computation, Vol.1, No.2, pp.119-163 (online), DOI: 10.1007/s12532-009-0004-6 (2009).
• Nagata, Y. and Kobayashi, S.: A Powerful Genetic Algorithm Using Edge Assembly Crossover for the Traveling Salesman Problem, INFORMS Journal on Computing, Vol.25, No.2, pp.346-363 (online), DOI: 10.1287/ijoc.1120.0506 (2013).
• Isola, P., Zhu, J.-Y., Zhou, T. and Efros, A.A.: Image-to-Image Translation with Conditional Adversarial Networks, CVPR 2017, arXiv:1611.07004 (2016).
• Radford, A., Metz, L. and Chintala, S.: Unsupervised Representation Learning with Deep Convolutional Generative Adversarial Networks, arXiv preprint arXiv:1511.06434 (2015).
• Silver, D., Huang, A., Maddison, C.J., et al.: Mastering the game of Go with deep neural networks and tree search, Nature, Vol.529, pp.484-489 (2016) (online), available from http://dx.doi.org/10.1038/nature16961.

Terms in the title (3)： 深層学習 ,  巡回セールスマン問題 ,  解法