Title
Resolving the manufacturing cell design problem via hunting search
Date Issued
01 January 2018
Access level
metadata only access
Resource Type
conference paper
Author(s)
Crawford B.
Olivares R.
Pacheco N.
Pontificia Universidad Católica de Valparaíso
Publisher(s)
Springer Verlag
Abstract
The Manufacturing Cell Design Problems consists in divide a production plant into cells, through which the machines and their processed parts are grouped. The main goal is to build an optimal design that reduces the movements of parts among cells. In this paper, we resolve this problem using a recent population-based metaheuristic called Hunting Search. This technique is inspired by the behavior of a herd of animals working together to hunt a prey. The experimental results demonstrate the efficiency of the proposed approach, which reach all global optimums for a set of 27 well-known instances.
Start page
414
End page
420
Volume
10868 LNAI
Language
English
OCDE Knowledge area
Sistemas de automatización, Sistemas de control Ingeniería industrial
Scopus EID
2-s2.0-85049044894
Source
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Resource of which it is part
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN of the container
03029743
ISBN of the container
9783319920573
Conference
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Sponsor(s)
Acknowledgment. Ricardo Soto is supported by Grant CONICYT/FONDECYT/ REGULAR/1160455. Broderick Crawford is supported by Grant CONICYT/ FONDECYT/REGULAR/1171243. Rodrigo Olivares is supported by CONICYT/ FONDEF/IDeA/ID16I10449, FONDECYT/STIC-AMSUD/17STIC-03, FONDE-CYT/MEC/MEC80170097, and Postgraduate Grant Pontificia Universidad Católica de Valparáıso (INF - PUCV 2015-2018).
Sources of information: Directorio de Producción Científica Scopus