An imperialist competitive algorithm for a mixed-model assembly line sequencing problem |
| |
Authors: | Hadi Moradi M. Zandieh |
| |
Affiliation: | 1. Engineering Faculty, Zarghan Branch, Islamic Azad University, Zarghan, Iran;2. Department of Industrial Management, Management and Accounting Faculty, Shahid Beheshti University, G.C., Tehran, Iran |
| |
Abstract: | This paper presents a novel imperialist competitive algorithm (ICA) to a just-in-time (JIT) sequencing problem where variations of production rate are to be minimized. This type of problem is NP-hard. Up to now, some heuristic and meta-heuristic approaches are proposed to minimize the production rates variation. This paper presents a novel algorithm for optimization which inspired by imperialistic competition in real world. Sequences of products where minimize the production rates variation is desired. Performance of the proposed ICA was compared against a genetic algorithm (GA) in small, medium and large problems. Experimental results show the ICA performance against GA. |
| |
Keywords: | Mixed-model assembly line Production rate variation Imperialism competition Just-in-time |
本文献已被 ScienceDirect 等数据库收录! |
|