@article{(Open Science Index):https://publications.waset.org/pdf/9998593,
	  title     = {Block Based Imperial Competitive Algorithm with Greedy Search for Traveling Salesman Problem},
	  author    = {Meng-Hui Chen and  Chiao-Wei Yu and  Pei-Chann Chang },
	  country	= {},
	  institution	= {},
	  abstract     = {Imperial competitive algorithm (ICA) simulates a multi-agent algorithm. Each agent is like a kingdom has its country, and the strongest country in each agent is called imperialist, others are colony. Countries are competitive with imperialist which in the same kingdom by evolving. So this country will move in the search space to find better solutions with higher fitness to be a new imperialist. The main idea in this paper is using the peculiarity of ICA to explore the search space to solve the kinds of combinational problems. Otherwise, we also study to use the greed search to increase the local search ability. To verify the proposed algorithm in this paper, the experimental results of traveling salesman problem (TSP) is according to the traveling salesman problem library (TSPLIB). The results show that the proposed algorithm has higher performance than the other known methods.
},
	    journal   = {International Journal of Computer and Information Engineering},
	  volume    = {8},
	  number    = {5},
	  year      = {2014},
	  pages     = {864 - 870},
	  ee        = {https://publications.waset.org/pdf/9998593},
	  url   	= {https://publications.waset.org/vol/89},
	  bibsource = {https://publications.waset.org/},
	  issn  	= {eISSN: 1307-6892},
	  publisher = {World Academy of Science, Engineering and Technology},
	  index 	= {Open Science Index 89, 2014},
	}