Study on Free Search for Combinatorial Optimization Problem

Abstract:

An algorithm based on free search is proposed for the combinatorial optimization problems. In this algorithm, a feasible solution is converted into a full permutation of all the elements and a transformation of one solution into another solution can be interpreted the transformation of one permutation into another permutation. Then, the algorithm is combined with intersection elimination. The discrete free search algorithm greatly improves the convergence rate of the search process and enhances the quality of the results. The experiment results on TSP standard data show that the performance of the proposed algorithm is increased by about 2.7% than that of the genetic algorithm.

• Periodical: Applied Mechanics and Materials (Volumes 411-414)
• Pages: 1904-1910
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.411-414.1904
• Online since: September 2013
• Authors: Kai Zhong Jiang*, Tian Bo Wang, Zhong Tuan Zheng, Yu Zhou
• Keywords: Free Search, Intelligent Algorithm, Intersection Elimination, TSP Problem

References

[1] KALIN P, GUY L. Free search-a comparative analysis, Information Science, vol. 172: pp.173-193, (2005).

[2] Omran MGH, Engelbrecht AP. Free search differential evolution. In: Proceedings of IEEE congress on evolutionary computation. Trondheim, Norway: IEEE; 18–21 May 2009. p.110–7.

DOI: 10.1109/cec.2009.4982937

[3] Penev K. Free search—a model of adaptive intelligence. Int. Conf. on Adaptive and Intelligent Systems, Klagenfurt, Austria, Sep. 2009; 92-7.

[4] Guang-Yu Z, Jin-Bao W, Hong G. Research and improvement of free search algorithm. Int. Conf. on Artificial Intelligence and Computational Intelligence, Shanghai, China, Sep. 2009; 235-9.

[5] Wang Y, Yin J. Enhanced decision making free search. In: Proceedings of world conference on science and engineering. Singapore: Elsevier; 14–16 October 2011, in press.

[6] Ya-ling Z, Hua-ping C, Hao S, Rui X. Minimizing makespan for single batch processing machine with non-identical job sizes using a novel algorithm free search. Int. Conf. on Information Technology and Computer Science, Beijing, China, Aug. 2009; 179-83.

DOI: 10.1109/itcs.2009.43

[7] Hui Z, Dan-mei L, Shi-huang S, Chen X. A novel intelligent estimation algorithm in WSN location based on free search. Int. Conf. on Wireless Communications, Networking and Mobile Computing, Hawaii, USA, Sep. 2007; 2629-32.

DOI: 10.1109/wicom.2007.654

[8] Eiben A. E. & Smith, J. E. Introduction to Evolutionary Computing (Natural Computing Series). Springer Netherland 2003, Verlag.

[9] Dorigo, M., Gambardella, L.M. Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem, IEEE Trans. On Evolutionary Computation, vol 1, no. 1, pp.53-66, April (1997).

DOI: 10.1109/4235.585892

[10] Eberhart, C. , Kennedy, J. A new optimizer using particle swarm theory. In Proc. Sixth Intl. Symposium on Micro Machine and Human Science, Nagoya, Japan, 1995, pp.39-43.

DOI: 10.1109/mhs.1995.494215

[11] Penev, Kalin and Littlefair, Guy. Free Search – a Novel Heuristic Method. In: Proceedings of the PREP 2003. PREP, pp.133-134.

[12] Penev, Kalin, Cihan Dagli. Free Search and Differential Evolution towards Dimensions Number Change. Intelligent Engineering Systems through Artificial Neural Networks, Vol. 16, pp.37-42, (2006).

DOI: 10.1115/1.802566.paper6