Abstract
This paper presents the use of genetic algorithms (GA) for solving the dual bin packing problem using fuzzy objectives. In bin packing problems, a list, L of items is to be packed into a minimum number of bins. In dual bin packing the items are packed into a maximum number of bins, assuring a minimum weight for each bin. We consider a class which we call dynamic dual bin packing. As with online algorithms, the items must be packed sequentially, however seeing more than one item at a time. The number of bins being packed at any time is fixed. A bin is replaced by an empty one, as soon as it is filled. A GA is presented to solve this problem. The results show that the fuzzy packing scheme is essential to solving the problem, and due to the nature of the problem the GA behaves closely to that of a micro-GA.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
