Solving the MCDP using a league championship algorithm

Abstract

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. Keywords: League Championship Algorithm Manufacturing Cell Design Problem · Metaheuristics Combinatorial optimization