WASET
	@article{(Open Science Index):https://publications.waset.org/pdf/10002754,
	  title     = {Enhanced Imperialist Competitive Algorithm for the Cell Formation Problem Using Sequence Data},
	  author    = {S. H. Borghei and  E. Teymourian and  M. Mobin and  G. M. Komaki and  S. Sheikh},
	  country	= {},
	  institution	= {},
	  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.},
	    journal   = {International Journal of Industrial and Manufacturing Engineering},
	  volume    = {9},
	  number    = {10},
	  year      = {2015},
	  pages     = {3532 - 3541},
	  ee        = {https://publications.waset.org/pdf/10002754},
	  url   	= {https://publications.waset.org/vol/106},
	  bibsource = {https://publications.waset.org/},
	  issn  	= {eISSN: 1307-6892},
	  publisher = {World Academy of Science, Engineering and Technology},
	  index 	= {Open Science Index 106, 2015},
	}