Please use this identifier to cite or link to this item:
Title: Max-Min Ant System for Assembly Line Balancing Problem
Authors: Kriengkorakot, Nuchsara 
Pianthong, Nalin 
Pitakaso, Rapeepan 
Issue Date: 2007
Publisher: University of the Thai Chamber of Commerce
Source: Nuchsara Kriengkorakot, Nalin Pianthong, Rapeepan Pitakaso (2007) Max-Min Ant System for Assembly Line Balancing Problem.
Conference: Proceedings of the 2nd International Conference on Operations and Supply Chain Management 
Abstract: The assembly line balancing problem (ALBP) is knownas one of difficult combinatorial optimization problems.It has received a great attention over the year. Ingeneral, it consists of assigning tasks to an orderedsequence of stations such that the precedence relationsamong the tasks are satisfied and some performancemeasure is optimized.This paper presents the simple assembly line balancingproblem type I (SALBP-1; the number of workstationsis minimized for a given cycle time) using Max-MinAnt System (MMAS) method to find optimal or nearoptimal solutions that compared with the previouspublished research work. The performance of thismethod is measured by solving a large-scale ofbenchmark problems that available in the literature.From the results, the computational experiments showsthat the MMAS is quite effective and competitive withthe other metaheuristic method for this problem.
Rights: This work is protected by copyright. Reproduction or distribution of the work in any format is prohibited without written permission of the copyright owner.
Appears in Collections:conference_item

Files in This Item:
File Description SizeFormat 
2088fulltext.pdf186.41 kBAdobe PDFThumbnail
Show full item record Recommend this item

Google ScholarTM


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