Using genetic algorithms to solve quality-related bin packing problem

The Bin Packing Problem is an industrial problem which involves grouping items into appropriate bin to minimize the cost and number of used bins. It provides a solution for assigning parts to optimize some predefined measures of productivity. In this study, Ion Plating (IP) industry requires similar approach on allocating production jobs into batches for producing better quality products and enabling to meet customer deadlines. The aim of this paper is to (i) develop a Bin Packing Genetic Algorithms (BPGA) with different weighting combinations, taking into account the quality of product and service; (ii) improve the production efficiency by reducing the production unit cost in IP. Genetic Algorithm was chosen because it is one of the best heuristics algorithms on solving optimization problems. In the case studies, industrial data of a precious metal finishing company was used to simulate the proposed BPGA model, and the computational results were compared with these industrial data. The results from three different weighting combinations demonstrated that fewer resources would be required by applying the proposed model in solving BP problem in the Ion Plating Cell. © 2005 Elsevier Ltd. All rights reserved.link_to_subscribed_fulltex