{'fraction_non_alphanumeric': 0.015810276679841896, 'fraction_numerical': 0.003952569169960474, 'mean_word_length': 5.2809917355371905, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
An Ant Colony Optimization Approach for the Machine-Part Cell Formation Problem

In this paper, the problem of grouping machines and parts into cells (machine-part cell formation problem) is considered with the objective of minimizing grouping efficacy. An ant colony optimization algorithm is developed to solve such problem. In the proposed algorithm, solutions are constructed in a new manner, two heuristic algorithms are used to determine part families and machine cells and the similarity between parts is used as heuristic information. The proposed algorithm is experimented on 35 test problems from the literature which shows its advantage over existing algorithms. The algorithm improves the best known values of the grouping efficacy for 5 problems.