By Topic

A new design of genetic algorithm for bin packing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Iima, H. ; Kyoto Inst. of Technol., Japan ; Yakawa, T.

In this paper, a new design of genetic algorithm (GA) is proposed for solving the one-dimensional bin packing problem, which is to pack a given set of items into the minimum number of bins. GA should be designed in such a way that offspring inherit important factors of parents. Such a factor in this problem is the combination of items in a bin. Thus, our GA lays emphasis on the combination of items. Furthermore, heuristic methods, which are effective for the bin packing problem, are introduced into our GA for obtaining a better solution. The effectiveness of our GA is investigated through computational results for benchmark instances. It is confirmed from the computational results that our GA outperforms a tabu search based method and a variable neighborhood search from the viewpoint of accuracy of solution obtained.

Published in:

Evolutionary Computation, 2003. CEC '03. The 2003 Congress on  (Volume:2 )

Date of Conference:

8-12 Dec. 2003