Structure oriented search algorithm to solve knapsack problems

Hiroki Yoshizawa, Shuji Hashimoto

    研究成果: Conference contribution

    抄録

    In this paper, we analyze the landscape of knapsack problems and propose a new search method called structure oriented search algorithm (SOSA). The heuristic search methods such as a simulated annealing and a genetic algorithm can be applied to complex optimization problems such as combinatorial ones. However, these methods are often redundant and inefficient. The key idea of the SOSA is approximating the landscape structure of the search space, so that the sampling domain can be directly moved to the promising region. The numerical experiments to solve knapsack problems have been conducted and the results are compared with that of genetic algorithms. The experimental results show the effectiveness of our method from the viewpoint of accuracy and calculation cost.

    本文言語English
    ホスト出版物のタイトルConference Proceedings - IEEE International Conference on Systems, Man and Cybernetics
    ページ5941-5946
    ページ数6
    6
    DOI
    出版ステータスPublished - 2004
    イベント2004 IEEE International Conference on Systems, Man and Cybernetics, SMC 2004 - The Hague
    継続期間: 2004 10 102004 10 13

    Other

    Other2004 IEEE International Conference on Systems, Man and Cybernetics, SMC 2004
    CityThe Hague
    Period04/10/1004/10/13

    ASJC Scopus subject areas

    • Engineering(all)

    フィンガープリント 「Structure oriented search algorithm to solve knapsack problems」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

    引用スタイル