Resolving the manufacturing cell design problem via hunting search

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Soto, R., Crawford, B., Olivares, R., & Pacheco, N. (2018). Resolving the manufacturing cell design problem via hunting search. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10868 LNAI, pp. 414–420). Springer Verlag. https://doi.org/10.1007/978-3-319-92058-0_40

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free