This paper focuses on modeling and solving the Manufacturing Cell Design Problem (MCDP) through a Algorithm (LCA). This problem considers the grouping of machines and parts into sets called cells. Each cell contains machines that process parts with the goal of minimizing the movements between cells. LCA represents problem solutions as teams, simulating their regular championship environment. During each week the teams generate new formations from an environment analysis both internal and external, in order to improve the performance of teams. We illustrate experimental results on well-known 90 benchmarks, where the global optimum is reached in almost all instances.
CITATION STYLE
Soto, R., Crawford, B., Olivares, R., & Romero Fernández, J. (2018). Solving the MCDP using a league championship algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10868 LNAI, pp. 447–453). Springer Verlag. https://doi.org/10.1007/978-3-319-92058-0_43
Mendeley helps you to discover research relevant for your work.