| dc.date.accessioned | 2022-05-20T20:45:07Z | |
| dc.date.accessioned | 2022-10-19T00:41:19Z | |
| dc.date.available | 2022-05-20T20:45:07Z | |
| dc.date.available | 2022-10-19T00:41:19Z | |
| dc.date.created | 2022-05-20T20:45:07Z | |
| dc.date.issued | 2018 | |
| dc.date.issued | 2018 | |
| dc.identifier | http://hdl.handle.net/10533/253873 | |
| dc.identifier | 1160455 | |
| dc.identifier.uri | https://repositorioslatinoamericanos.uchile.cl/handle/2250/4485025 | |
| dc.description.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 | |
| dc.language | eng | |
| dc.relation | 31° | |
| dc.relation | International Conference on Industrial, Engineering and Other Applications of Applied
Intelligent Systems, IEA/AIE | |
| dc.relation | instname: ANID | |
| dc.relation | reponame: Repositorio Digital RI2.0 | |
| dc.rights | http://creativecommons.org/licenses/by/3.0/cl/ | |
| dc.title | Solving the MCDP using a league championship algorithm | |
