距離に基づく相互作用を用いた多点探索型組合せ最適化手法

DOI Web Site Web Site 被引用文献8件 参考文献28件

書誌事項

タイトル別名
  • Multi-Point Combinatorial Optimization Method with Distance Based Interaction
  • キョリ ニ モトズク ソウゴ サヨウ オ モチイタ タテン タンサクガタ クミアワセ サイテキカ シュホウ

この論文をさがす

説明

This paper proposes a multi-point combinatorial optimization method based on Proximate Optimality Principle (POP), which method has several advantages for solving large-scale combinatorial optimization problems. The proposed algorithm uses not only the distance between search points but also the interaction among search points in order to utilize POP in several types of combinatorial optimization problems. The proposed algorithm is applied to several typical combinatorial optimization problems, a knapsack problem, a traveling salesman problem, and a flow shop scheduling problem, in order to verify the performance of the proposed algorithm. The simulation results indicate that the proposed method has higher optimality than the conventional combinatorial optimization methods.

収録刊行物

被引用文献 (8)*注記

もっと見る

参考文献 (28)*注記

もっと見る

キーワード

詳細情報 詳細情報について

問題の指摘

ページトップへ