A hybrid multi-objective shuffled frog-leaping algorithm for a mixed-model assembly line sequencing problem

A hybrid multi-objective shuffled frog-leaping algorithm for a mixed-model assembly line sequencing problem

0.00 Avg rating0 Votes
Article ID: iaor20083725
Country: Netherlands
Volume: 53
Issue: 4
Start Page Number: 642
End Page Number: 666
Publication Date: Nov 2007
Journal: Computers & Industrial Engineering
Authors: ,
Keywords: heuristics, heuristics: genetic algorithms
Abstract:

In this paper, a mixed-model assembly line (MMAL) sequencing problem is studied. This type of production system is used to manufacture multiple products along a single assembly line while maintaining the least possible inventories. With the growth in customers' demand diversification, mixed-model assembly lines have gained increasing importance in the field of management. Among the available criteria used to judge a sequence in MMAL, the following three are taken into account: the minimization of total utility work, total production rate variation, and total setup cost. Due to the complexity of the problem, it is very difficult to obtain optimum solution for this kind of problems by means of traditional approaches. Therefore, a hybrid multi-objective algorithm based on shuffled frog-leaping algorithm and bacteria optimization are deployed. The performance of the proposed hybrid algorithm is then compared with three well-known genetic algorithms, i.e. PS-NC GA, NSGA-II, and SPEA-II. The computational results show that the proposed hybrid algorithm outperforms the existing genetic algorithms, significantly in large-sized problems.

Reviews

Required fields are marked *. Your email address will not be published.