Title
An Imperialist Competitive Algorithm to Solve the Manufacturing Cell Design Problem
Date Issued
01 January 2018
Access level
metadata only access
Resource Type
journal article
Author(s)
Crawford B.
Olivares R.
Ortega H.
Almonacid B.
Pontificia Universidad Católica de Valparaíso
Publisher(s)
Springer Verlag
Abstract
The manufacturing cell design problem is part of the cellular manufacturing system and it has been widely studied as an optimization problem. It consists of grouping machines in parts into manufacturing cells in order to minimize the inter-cell movements. In recent years, different approximate methods have been used to solve this problem. In this paper, we propose a new approximate method inspired on the phenomenon of the colonial age, called imperialist competitive algorithm. In the colonial age, the most powerful countries competed to conquer colonies for increasing their power, where the country with highest power was considered the imperialist one. We performed several experiments on a set of 90 instances, where the proposed approach is able to produce optimal values for the whole set of tested instances.
Start page
102
End page
113
Volume
662
Language
English
OCDE Knowledge area
Ingeniería de sistemas y comunicaciones Ingeniería industrial
Scopus EID
2-s2.0-85029588839
ISBN
9783319676203
Source
Advances in Intelligent Systems and Computing
Resource of which it is part
Advances in Intelligent Systems and Computing
ISSN of the container
21945357
ISBN of the container
978-331967620-3
Conference
International Conference on Computational Methods in Systems and Software, CoMeSySo 2017
Sponsor(s)
CONICYT/FONDEF/IDeA Pontificia Universidad Católica de Chile
Sources of information: Directorio de Producción Científica Scopus