کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
1697649 1012087 2013 9 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
An imperialist competitive algorithm for a mixed-model assembly line sequencing problem
موضوعات مرتبط
مهندسی و علوم پایه سایر رشته های مهندسی کنترل و سیستم های مهندسی
پیش نمایش صفحه اول مقاله
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.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Manufacturing Systems - Volume 32, Issue 1, January 2013, Pages 46–54
نویسندگان
, ,