Abstract: Imperialist Competitive Algorithm (ICA) is a recent
meta-heuristic method that is inspired by the social evolutions for
solving NP-Hard problems. The ICA is a population-based algorithm
which has achieved a great performance in comparison to other metaheuristics.
This study is about developing enhanced ICA approach to
solve the Cell Formation Problem (CFP) using sequence data. In
addition to the conventional ICA, an enhanced version of ICA,
namely EICA, applies local search techniques to add more
intensification aptitude and embed the features of exploration and
intensification more successfully. Suitable performance measures are
used to compare the proposed algorithms with some other powerful
solution approaches in the literature. In the same way, for checking
the proficiency of algorithms, forty test problems are presented. Five
benchmark problems have sequence data, and other ones are based on
0-1 matrices modified to sequence based problems. Computational
results elucidate the efficiency of the EICA in solving CFP problems.
Abstract: Cell formation is the first step in the design of cellular
manufacturing systems. In this study, a general purpose
computational scheme employing a hybrid tabu search algorithm as
the core is proposed to solve the cell formation problem and its
variants. In the proposed scheme, great flexibilities are left to the
users. The core solution searching algorithm embedded in the scheme
can be easily changed to any other meta-heuristic algorithms, such as
the simulated annealing, genetic algorithm, etc., based on the
characteristics of the problems to be solved or the preferences the
users might have. In addition, several counters are designed to control
the timing of conducting intensified solution searching and diversified
solution searching strategies interactively.