# Heuristic for Maximizing Grouping Efficiency in the Cell Formation   Problem

**Authors:** Ilya Bychkov, Mikhail Batsyn, Panos M. Pardalos

arXiv: 1702.07266 · 2017-02-24

## TL;DR

This paper introduces a heuristic method for solving the Cell Formation Problem in Group Technology, significantly improving grouping efficiency solutions across various benchmark instances.

## Contribution

A new heuristic approach with an iterative improvement procedure that finds better solutions for the CFP than previously known methods.

## Key findings

- Achieved better solutions for 23 out of 24 benchmark instances.
- Effective heuristic applicable to large-scale CFP instances.
- Demonstrated the heuristic's robustness across different problem sizes.

## Abstract

In our paper we consider the Cell Formation Problem in Group Technology with grouping efficiency as an objective function. We present a heuristic approach for obtaining high-quality solutions of the CFP. The suggested heuristic applies an improvement procedure to obtain solutions with high grouping efficiency. This procedure is repeated many times for randomly generated cell configurations. Our computational experiments are performed for popular benchmark instances taken from the literature with sizes from 10x20 to 50x150. Better solutions unknown before are found for 23 instances of the 24 considered.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1702.07266/full.md

## References

46 references — full list in the complete paper: https://tomesphere.com/paper/1702.07266/full.md

---
Source: https://tomesphere.com/paper/1702.07266