An imperialist competitive algorithm for a mixed-model assembly line sequencing problem

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.

► This paper presents a novel imperialist competitive algorithm to a just-in-time sequencing problem where variations of production rate are to be minimized.
► Performance of the proposed algorithm was compared against a genetic algorithm in small, medium and large problems.
► Experimental results show the proposed algorithm performance against genetic algorithm.