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

1 被引用数 (Scopus)

抄録

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
CityBerlin
Period19/9/819/9/11

ASJC Scopus subject areas

  • 電子工学および電気工学
  • 産業および生産工学
  • メディア記述

フィンガープリント

「A multiple coefficients trial method to solve combinatorial optimization problems for simulated-annealing-based ising machines」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル