Structure oriented search algorithm to solve knapsack problems

Hiroki Yoshizawa, Shuji Hashimoto

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    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.

    Original languageEnglish
    Title of host publicationConference Proceedings - IEEE International Conference on Systems, Man and Cybernetics
    Pages5941-5946
    Number of pages6
    Volume6
    DOIs
    Publication statusPublished - 2004
    Event2004 IEEE International Conference on Systems, Man and Cybernetics, SMC 2004 - The Hague
    Duration: 2004 Oct 102004 Oct 13

    Other

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

    Keywords

    • Big-valley structure
    • Knapsack problem
    • Stochastic optimization
    • Structure oriented search algorithm

    ASJC Scopus subject areas

    • Engineering(all)

    Fingerprint Dive into the research topics of 'Structure oriented search algorithm to solve knapsack problems'. Together they form a unique fingerprint.

    Cite this