UM  > Faculty of Science and Technology  > DEPARTMENT OF ELECTROMECHANICAL ENGINEERING
A new optimization method, the algorithm of changes, for Bin Packing Problem
Sik-Chung Tam1; Hou-Kuan Tam2; Lap-Mou Tam2,3; Tong Zhang1
2010-12-31
Conference NameProceedings 2010 IEEE 5th International Conference on Bio-Inspired Computing: Theories and Applications, BIC-TA 2010
Source Publication2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)
Pages994-999
Conference Date23-26 Sept. 2010
Conference PlaceChangsha, China
Abstract

The Bin Packing Problem (BPP) is one of the classic NP-hard problems in combinatorial optimization. It is difficult to find the optimal solution even though the size of the problem is small. Many researchers applied the traditional evolutionary algorithm, Genetic Algorithms (GA), Evolution Strategy (ES) etc. to solve the BPP problem in recent research. In this study, a new optimization algorithm, Algorithm of Changes (AOC), was proposed for the BPP problems. The algorithm was developed by the authors based on the concept of I Ching. It is a work with originality. The hexagram operators in I Ching were generalized to binary string case and an iterative procedure which imitated the I Ching inference was also introduced in this study. With the data taken from OR-Library, the AOC method was applied for finding the optimal solution (i.e. the minimum number of bins used) of three BPP problems. All the results found by the AOC method were compared with the other optimization methods shown in the past studies. Overall, the AOC method was shown to provide the optimal solution for all the BPP problems, and even superior to the other evolutionary heuristic methods. © 2010 IEEE.

KeywordOptimization Algorithm Of Changes Bin Packing Problem Genetic Algorithms
DOIhttp://doi.org/10.1109/BICTA.2010.5645122
URLView the original
Fulltext Access
Citation statistics
Document TypeConference paper
CollectionDEPARTMENT OF ELECTROMECHANICAL ENGINEERING
DEPARTMENT OF MATHEMATICS
Affiliation1.Department of Mathematics, Faculty of Science and Technology, University of Macau Macau, China
2.Department of Electromechanical Engineering, Faculty of Science and Technology, University of Macau Macau, China
3.Institute for the Development and Quality, Macau, China
First Author AffilicationFaculty of Science and Technology
Recommended Citation
GB/T 7714
Sik-Chung Tam,Hou-Kuan Tam,Lap-Mou Tam,et al. A new optimization method, the algorithm of changes, for Bin Packing Problem[C],2010:994-999.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Sik-Chung Tam]'s Articles
[Hou-Kuan Tam]'s Articles
[Lap-Mou Tam]'s Articles
Baidu academic
Similar articles in Baidu academic
[Sik-Chung Tam]'s Articles
[Hou-Kuan Tam]'s Articles
[Lap-Mou Tam]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Sik-Chung Tam]'s Articles
[Hou-Kuan Tam]'s Articles
[Lap-Mou Tam]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.