評価・診断に関するシンポジウム講演論文集
Online ISSN : 2424-3027
セッションID: 106
会議情報

巡回セールスマン問題におけるアニーリング法のハミルトニアン分解による未定乗数決定法の提案
*大塚 優菜高田 宗一朗
著者情報
会議録・要旨集 認証あり

詳細
抄録

Geographic Information System (GIS) is expected in order to plan of the optimal inspection path in water pipe network. The problem of inspection path optimization is formulated by Travel Salesman Problem (TSP). In generally, TSP is contained the constraint in order to obtain the proper inspection path. Moreover, the constraint is multiplied Lagrange multiplier. However, there isn’t the effective method in order to obtain the Lagrange multiplier. In this paper, in order to give a guide to the method of determining the Lagrange multiplier for TSP using the annealing optimization. Especially, we propose a method for determining the Lagrange multiplier based on the Hamiltonian decomposition focus on the appropriateness of the solution. First, the appropriateness of the solution is considered. Moreover, the determination method of Lagrange multiplier that focuses on large/small relation of the decomposition Hamiltonian is suggested. Moreover, Lagrange multiplier and the lowest eigenenergy dependence of the whole system are calculated. Lagrange multiplier dependence of the appearance probability of the annealing solution is investigated by numerical calculation.

著者関連情報
© 2019 一般社団法人 日本機械学会
前の記事 次の記事
feedback
Top