A Multiobjective optimization algorithm to solve the part feeding problem in mixed-model assembly lines

38Citations
Citations of this article
37Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Different aspects of assembly line optimization have been extensively studied. Part feeding at assembly lines, however, is quite an undeveloped area of research. This study focuses on the optimization of part feeding at mixed-model assembly lines with respect to the Just-In-Time principle motivated by a real situation encountered at one of the major automobile assembly plants in Spain. The study presents a mixed integer linear programming model and a novel simulated annealing algorithm-based heuristic to pave the way for the minimization of the number of tours as well as inventory level. In order to evaluate the performance of the algorithm proposed and validate the mathematical model, a set of generated test problems and two real-life instances are solved. The solutions found by both the mathematical model and proposed algorithm are compared in terms of minimizing the number of tours and inventory levels, as well as a performance measure called workload variation. The results show that although the exact mathematical model had computational difficulty solving the problems, the proposed algorithm provides good solutions in a short computational time. © 2014 Masood Fathi et al.

Cite

CITATION STYLE

APA

Fathi, M., Alvarez, M. J., Hassani Mehraban, F., & Rodríguez, V. (2014). A Multiobjective optimization algorithm to solve the part feeding problem in mixed-model assembly lines. Mathematical Problems in Engineering, 2014. https://doi.org/10.1155/2014/654053

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free