Efficient Algorithm for Solving a Bag-packing Problem by Excluding Search Space

In the bag-packing problem, several items are selected so that the sum weight should be closest to the target weight. In order to obtain an optimal solution, all the candidate solutions must be enumerated. But when the number of candidate solutions increases, it takes too much time to obtain an opti...

Full description

Saved in:
Bibliographic Details
Published inTransactions of the Japan Society of Mechanical Engineers Series C Vol. 69; no. 688; pp. 3431 - 3438
Main Authors MURAKAMI, Yoshihiro, KURATA, Jyunichi, UCHIYAMA, Hironobu, TANIYA, Keigo, KAWAI, Masashi
Format Journal Article
LanguageEnglish
Japanese
Published The Japan Society of Mechanical Engineers 2003
Subjects
Bag-packing
Combinatorial Optimization Problem
Exclusion of Search Space
Online AccessGet full text

Cover

More Information
Summary:In the bag-packing problem, several items are selected so that the sum weight should be closest to the target weight. In order to obtain an optimal solution, all the candidate solutions must be enumerated. But when the number of candidate solutions increases, it takes too much time to obtain an optimal solution. So such enumeration method is not efficient. Therefore the following system is developed ; such conditions can be derived as would exclude useless, superfluous searches and by checking whether the conditions are satisfied or not, the number of candidate solutions that must be enumerated can be decreased. Many of the simulation results seem to prove the proposed system to be effective.
ISSN:0387-5024
1884-8354
DOI:10.1299/kikaic.69.3431