By Topic

A stochastic approach for the one-dimensional bin-packing problems

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)
Cheng-Yan Kao ; Nat. Taiwan Univ., Taipei, Taiwan ; Feng-Tse Lin

The authors present a novel stochastic approach called the annealing-genetic algorithm for the one-dimensional bin-packing problem. This approach incorporates genetic algorithms into simulated annealing (SA) to improve the performance of SA. The genetic approach to SA seems to facilitate the exhaustive and parallel treatment of the problem and to increase the probability of finding global minima. The empirical results show that the quality of the solution obtained with this approach is better than or equal to that of the FFD (first-fit-decreasing) in the average cases but is better than that of the FFD in all the known worst cases. Unlike the FFD, no nonmonotone anomaly has been found in the proposed approach

Published in:

Systems, Man and Cybernetics, 1992., IEEE International Conference on

Date of Conference:

18-21 Oct 1992