An Imperialist Competitive Algorithm to Solve the Manufacturing Cell Design Problem

Ricardo Soto; Broderick Crawford; Rodrigo Olivares; Héctor Ortega; Boris Almonacid

doi:10.1007/978-3-319-67621-0_9

An Imperialist Competitive Algorithm to Solve the Manufacturing Cell Design Problem

Ricardo Soto, Broderick Crawford, Rodrigo Olivares, Héctor Ortega, Boris Almonacid

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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.

Original language	English
Title of host publication	Applied Computational Intelligence and Mathematical Methods - Computational Methods in Systems and Software 2017
Editors	Radek Silhavy, Petr Silhavy, Zdenka Prokopova
Publisher	Springer Verlag
Pages	102-113
Number of pages	12
ISBN (Print)	9783319676203
DOIs	https://doi.org/10.1007/978-3-319-67621-0_9
State	Published - 2018
Externally published	Yes
Event	International Conference on Computational Methods in Systems and Software, CoMeSySo 2017 - Vsetin, Czech Republic Duration: 12 Sep 2017 → 14 Sep 2017

Publication series

Name	Advances in Intelligent Systems and Computing
Volume	662
ISSN (Print)	2194-5357

Conference

Conference	International Conference on Computational Methods in Systems and Software, CoMeSySo 2017
Country/Territory	Czech Republic
City	Vsetin
Period	12/09/17 → 14/09/17

Keywords

Imperialist competitive algorithm
Manufacturing cell design problem
Metaheuristics

Access to Document

10.1007/978-3-319-67621-0_9

Cite this

Soto, R., Crawford, B., Olivares, R., Ortega, H., & Almonacid, B. (2018). An Imperialist Competitive Algorithm to Solve the Manufacturing Cell Design Problem. In R. Silhavy, P. Silhavy, & Z. Prokopova (Eds.), Applied Computational Intelligence and Mathematical Methods - Computational Methods in Systems and Software 2017 (pp. 102-113). (Advances in Intelligent Systems and Computing; Vol. 662). Springer Verlag. https://doi.org/10.1007/978-3-319-67621-0_9

Soto, Ricardo ; Crawford, Broderick ; Olivares, Rodrigo et al. / An Imperialist Competitive Algorithm to Solve the Manufacturing Cell Design Problem. Applied Computational Intelligence and Mathematical Methods - Computational Methods in Systems and Software 2017. editor / Radek Silhavy ; Petr Silhavy ; Zdenka Prokopova. Springer Verlag, 2018. pp. 102-113 (Advances in Intelligent Systems and Computing).

@inproceedings{93b08e6c02714c0f978f345aa624e095,

title = "An Imperialist Competitive Algorithm to Solve the Manufacturing Cell Design Problem",

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.",

keywords = "Imperialist competitive algorithm, Manufacturing cell design problem, Metaheuristics",

author = "Ricardo Soto and Broderick Crawford and Rodrigo Olivares and H{\'e}ctor Ortega and Boris Almonacid",

note = "Funding Information: Broderick Crawford is supported by Grant CONICYT/FONDECYT/REGULAR/ 1171243. Ricardo Soto is supported by Grant CONICYT/FONDECYT/REGULAR/ 1160455. Rodrigo Olivares is supported by CONICYT/FONDEF/IDeA/ID16I10449 and Postgraduate Grant Pontificia Universidad Cat{\'o}lica de Valpar{\'a}ıso (INF-PUCV 2015-2017). Finally, Boris Almonacid are supported by Postgraduate Grant Pontificia Universidad Cat{\'o}lica de Valpar{\'a}ıso, Chile (INF-PUCV 2015). Publisher Copyright: {\textcopyright} 2018, Springer International Publishing AG.; null ; Conference date: 12-09-2017 Through 14-09-2017",

year = "2018",

doi = "10.1007/978-3-319-67621-0_9",

language = "English",

isbn = "9783319676203",

series = "Advances in Intelligent Systems and Computing",

publisher = "Springer Verlag",

pages = "102--113",

editor = "Radek Silhavy and Petr Silhavy and Zdenka Prokopova",

booktitle = "Applied Computational Intelligence and Mathematical Methods - Computational Methods in Systems and Software 2017",

}

Soto, R , Crawford, B, Olivares, R, Ortega, H & Almonacid, B 2018, An Imperialist Competitive Algorithm to Solve the Manufacturing Cell Design Problem. in R Silhavy, P Silhavy & Z Prokopova (eds), Applied Computational Intelligence and Mathematical Methods - Computational Methods in Systems and Software 2017. Advances in Intelligent Systems and Computing, vol. 662, Springer Verlag, pp. 102-113, International Conference on Computational Methods in Systems and Software, CoMeSySo 2017, Vsetin, Czech Republic, 12/09/17. https://doi.org/10.1007/978-3-319-67621-0_9

An Imperialist Competitive Algorithm to Solve the Manufacturing Cell Design Problem. / Soto, Ricardo ; Crawford, Broderick; Olivares, Rodrigo et al.

Applied Computational Intelligence and Mathematical Methods - Computational Methods in Systems and Software 2017. ed. / Radek Silhavy; Petr Silhavy; Zdenka Prokopova. Springer Verlag, 2018. p. 102-113 (Advances in Intelligent Systems and Computing; Vol. 662).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - An Imperialist Competitive Algorithm to Solve the Manufacturing Cell Design Problem

AU - Soto, Ricardo

AU - Crawford, Broderick

AU - Olivares, Rodrigo

AU - Ortega, Héctor

AU - Almonacid, Boris

N1 - Funding Information: Broderick Crawford is supported by Grant CONICYT/FONDECYT/REGULAR/ 1171243. Ricardo Soto is supported by Grant CONICYT/FONDECYT/REGULAR/ 1160455. Rodrigo Olivares is supported by CONICYT/FONDEF/IDeA/ID16I10449 and Postgraduate Grant Pontificia Universidad Católica de Valparáıso (INF-PUCV 2015-2017). Finally, Boris Almonacid are supported by Postgraduate Grant Pontificia Universidad Católica de Valparáıso, Chile (INF-PUCV 2015). Publisher Copyright: © 2018, Springer International Publishing AG.

PY - 2018

Y1 - 2018

N2 - 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.

AB - 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.

KW - Imperialist competitive algorithm

KW - Manufacturing cell design problem

KW - Metaheuristics

UR - http://www.scopus.com/inward/record.url?scp=85029588839&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-67621-0_9

DO - 10.1007/978-3-319-67621-0_9

M3 - Conference contribution

AN - SCOPUS:85029588839

SN - 9783319676203

T3 - Advances in Intelligent Systems and Computing

SP - 102

EP - 113

BT - Applied Computational Intelligence and Mathematical Methods - Computational Methods in Systems and Software 2017

A2 - Silhavy, Radek

A2 - Silhavy, Petr

A2 - Prokopova, Zdenka

PB - Springer Verlag

Y2 - 12 September 2017 through 14 September 2017

ER -

Soto R , Crawford B, Olivares R, Ortega H, Almonacid B. An Imperialist Competitive Algorithm to Solve the Manufacturing Cell Design Problem. In Silhavy R, Silhavy P, Prokopova Z, editors, Applied Computational Intelligence and Mathematical Methods - Computational Methods in Systems and Software 2017. Springer Verlag. 2018. p. 102-113. (Advances in Intelligent Systems and Computing). doi: 10.1007/978-3-319-67621-0_9

An Imperialist Competitive Algorithm to Solve the Manufacturing Cell Design Problem

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this