Detail Two-Dimensional Loading Problem: Four Corner’s Heuristic Algorithm For Multiple Bins   Oleh:  Singgih, Ivan Kristianto ; Halim, Abdul Hakim Jenis: Article from Proceeding Dalam koleksi: APCOMS 2009: The 2nd Asia-Pacific Conference on Manufacturing System: Reconfigurable Manufacturing System for Facing Turbulent Manufacturing Environment, November 4th-5th, 2009, Yogyakarta, Indonesia, page IX.21-26. Topik: Two-Dimensional Loading; Four Corners’ Heuristic Algorithm Fulltext: APCOMS GIX-4.pdf (295.86KB) Isi artikel This research has developed a model for loading two-dimensional parts with the objective of maximizing hanger utilization. It is noticed this objective is equivalent to minimize the number of hangers used. The basic model used is the so-called Four Corners’ Heuristic Algorithm. This algorithm results better trim loss than the other two-dimensional loading algorithms. This basic model can be used to load parts into a single hanger problem. In real case, the total area of parts is larger than hanger’s area, and this will bring to a requirement of more than one hanger is needed. This research creates a parts grouping algorithm to achieve hanger utilization maximization. The output of parts grouping algorithm is used in two-dimensional loading algorithm. Both algorithms result hangers with high utilization. To assure the convergence of Four Corners’ Heuristic Algorithm solution, an elitist chromosome, which contains the best solution in each iteration, is calculated. Beside that, the Partially Mapped Crossover with repetition is developed to allow the existence of same parts in a chromosome. Opini Anda Klik untuk menuliskan opini Anda tentang koleksi ini! Kembali

Copyright © 2006, 2007 Unika Atma Jaya, all rights reserved