Bibliographic Details
| Title: |
Evolutionary based heuristic for bin packing problem |
| Authors: |
Stawowy, Adam1 astawowy@zarz.agh.edu.pl |
| Source: |
Computers & Industrial Engineering. Sep2008, Vol. 55 Issue 2, p465-474. 10p. |
| Subjects: |
Mathematical optimization, Operations research, Algorithms, Industrial engineering |
| Abstract: |
Abstract: In this paper, we investigate the use of evolutionary based heuristic to the one-dimensional bin packing problem (BPP). Unlike other evolutionary heuristics used with optimization problems, a non-specialized and non-hybridized algorithm is proposed and analyzed for solving BPP. The algorithm uses a modified permutation with separators encoding scheme, unique concept of separators’ movements during mutation, and separators removal as a technique of problem size reduction. The set of experiments confirmed that the proposed approach is comparable to much more complicated algorithms. [Copyright &y& Elsevier] |
|
Copyright of Computers & Industrial Engineering is the property of Pergamon Press - An Imprint of Elsevier Science and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
