2017/01/10 by Ilya Bychkov, Bychkov, Ilya, Mikhail Batsyn +4
Computer Science · Engineering · #Advanced Manufacturing and Logistics Optimization #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Optimization and Packing Problems #Urban and Freight Transport Logistics #cs.DM
paper · pdf · doi:10.48550/arxiv.1702.07266
15 pages, 7 tables
arxiv created 2017/01/10 · openalex publication_date 2017/01/10 · arxiv updated 2017/02/24 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.