A multiple coefficients trial method to solve combinatorial optimization problems for simulated-annealing-based ising machines

Kota Takehara, Daisuke Oku, Yoshiki Matsuda, Shu Tanaka, Nozomu Togawa

研究成果: Conference contribution

抜粋

When solving a combinatorial optimization problem with Ising machines, we have to formulate it onto an energy function of Ising model. Here, how to determine the penalty coefficients in the energy function is a great concern if it includes constraint terms. In this paper, we focus on a traveling salesman problem (TSP, in short), one of the combinatorial optimization problems with equality constraints. Firstly, we investigate the relationship between the penalty coefficient and the accuracy of solutions in a TSP. Based on it, we propose a method to obtain a TSP quasi-optimum solution, which is called multiple coefficients trial method. In our proposed method, we use an Ising machine to solve a TSP by changing a penalty coefficient every trial, the TSP solutions can converge very fast in total. Compared to naive methods using simulated-annealing-based Ising machines, we confirmed that our proposed method can reduce the total number of annealing iterations to 1/10 to 1/1000 to obtain a quasi-optimum solution in 32-city TSPs.

元の言語English
ホスト出版物のタイトルProceedings - 2019 IEEE 9th International Conference on Consumer Electronics, ICCE-Berlin 2019
編集者Gordan Velikic, Christian Gross
出版者IEEE Computer Society
ページ64-69
ページ数6
ISBN(電子版)9781728127453
DOI
出版物ステータスPublished - 2019 9
イベント9th IEEE International Conference on Consumer Electronics, ICCE-Berlin 2019 - Berlin, Germany
継続期間: 2019 9 82019 9 11

出版物シリーズ

名前IEEE International Conference on Consumer Electronics - Berlin, ICCE-Berlin
2019-September
ISSN(印刷物)2166-6814
ISSN(電子版)2166-6822

Conference

Conference9th IEEE International Conference on Consumer Electronics, ICCE-Berlin 2019
Germany
Berlin
期間19/9/819/9/11

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Industrial and Manufacturing Engineering
  • Media Technology

フィンガープリント A multiple coefficients trial method to solve combinatorial optimization problems for simulated-annealing-based ising machines' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用

    Takehara, K., Oku, D., Matsuda, Y., Tanaka, S., & Togawa, N. (2019). A multiple coefficients trial method to solve combinatorial optimization problems for simulated-annealing-based ising machines. : G. Velikic, & C. Gross (版), Proceedings - 2019 IEEE 9th International Conference on Consumer Electronics, ICCE-Berlin 2019 (pp. 64-69). [8966167] (IEEE International Conference on Consumer Electronics - Berlin, ICCE-Berlin; 巻数 2019-September). IEEE Computer Society. https://doi.org/10.1109/ICCE-Berlin47944.2019.8966167