|  Papadimitriou C H, Steglitz K. Combinatorial Optimization:Algorithms and Complexity. India: Dover Publications, 1998. Garey M R, Graham R L, Johnson D S. Some NP-completegeometric problems. In Proc. the 8th Annual ACM Sympo-sium on Theory of Computing, May 1976, pp.10-22. Ozcan E, Erenturk M. A brief review of memetic algorithmsfor solving Euclidean 2D traveling salesman problem. In Proc.the 13th Turkish Symposium on Artificial Intelligence andNeural Networks, June 2004, pp.99-108. Sankoff D, Zheng C, Mu~noz A, Yang Z, Adam Z, Warren R,Choi V, Zhu Q. Issues in the reconstruction of gene order evo-lution. Journal of Computer Science and Technology, 2010,25(1): 10-25. Black T, Fogel D B, Michalewicz Z. Handbook on Evolution-ary Computation. USA: Oxford University Press, 1997. Laporte G. The vehicle routing problem: An overview of ex-act and approximate algorithms. European Journal of Oper-ational Research, 1992, 59(3): 345-358. Onwubolu G C, Clerc M. Optimal path for automated drillingoperations by a new heuristic approach using particle swarmoptimization. International Journal of Production Research,2004, 42 (3): 473-491. Affenzeller M, Wanger S. A self-adaptive model for selectivepressure handling within the theory of genetic algorithms. InProc. the 9th EUROCAST, February 2003, pp.384-393. Budinich M. A self-organizing neural network for the trav-eling salesman problem that is competitive with simulatedannealing. Neural Computation, 1996, 8(2): 416-424. Liu G, He Y, Fang Y, Oiu Y. A novel adaptive search strat-egy of intensification and diversification in tabu search. InProc. International Conference on Neural Networks and Sig-nal Processing, December 2003, pp.428-431. Bianchi L, Knowles J, Bowler N. Local search for the proba-bilistic traveling salesman problem: Correction to the 2-p-optand 1-shift algorithms. European Journal of Operational Re-search, 2005, 162(1): 206-219. Chu S C, Roddick J F, Pan J S. Ant colony system with com-munication strategies. Information Sciences, 2004, 167 (1-4):63-76. Leung K S, Jin H D, Xu Z B. An expanding self-organizingneural network for the traveling salesman problem. Neuro-computing, 2004, 62: 267-292. Kirkpatrick S, Gelatt Jr. C D, Vecchi M P. Optimization bysimulated annealing. Science, 1983, 220(4598): 671-680. Grefenstette J, Gopal R, Rosimaita B, Gucht D V. Geneticalgorithms for the traveling salesman problem. In Proc. Int.Conf. Genetics Algorithms and Their Applications, October1985, pp.160-168. Braun H. On solving traveling salesman problems by geneticalgorithm. In Lecture Notes in Computer Science 496, Schwe-fel H P, Männer R (eds.), Springer-Verlag, pp.129-133. Michalewicz Z. Genetic Algorithms + Data Structures = Evo-lution Programs (3rd edition). Berlin, Germany: Springer-Verlag, 1996. Fan J, Li D. An overview of data mining and knowledge dis-covery. Journal of Computer Science and Technology, 1998,13(4): 348-368. Moscato P, Norman M G. A memetic approach for the trav-eling salesman problem implementation of a computationalecology for combinatorial optimization on message-passingsystems. In Proc. International Conference on Parallel Com-puting and Transputer Application, Sept. 1992, pp.177-186. Oliver I M, Smith D J, Holland J R C. A study of permutationcrossovers on the TSP. In Proc. the 2nd International Con-ference on Genetic Algorithm and Their Applications, July1987, pp.224-230. Whitely L D, Starkweather T, Fuquay D'A. Scheduling prob-lems and traveling salesman: The genetic edge recombinationoperator. In Proc. the 3rd International Conference on Ge-netic Algorithms, June 1988, pp.133-140. Mühlenbein H, Gorges-Schleuter M, Krämer O. Evolution al-gorithms in combinatorial optimization. Parallel Computing,1988, 7(1): pp.65-85. Nagata Y, Kobayashi S. Edge assembly crossover: A high-power genetic algorithm for the travelling salesman problem.In Proc. the 7th International Conference on Genetic Algo-rithms, July 1997, pp.450-457. Tao G, Michalewicz Z. Inver-over operator for the TSP. InProc. the 5th Int. Conf. Parallel Problem Solving from Na-ture, September 1998, pp.803-812. Johnson D S, McGeoch L A. The traveling salesman problem:A case study in local optimization. In Local Search in Com-binatorial Optimization, Aarts E, Lenstra J K (eds.), JohnWiley and Sons, Ltd., 1997, pp.215-310. Zou P, Zhou Z,Wan Y Y, Chen G L, Gu J. New meta-heuristicfor combinatorial optimization problems: Intersection basedscaling. Journal of Computer Science and Technology, 2004,19(6): 740-751. Merz P. A comparison of memetic recombination operatorsfor the traveling salesman problem. In Proc. the Genetic andEvolutionary Computation Conference, July 2002, pp.472-479. Baraglia R, Hidalgo J I, Perego R. A hybrid heuristic for thetraveling salesman problem. IEEE Transactions on Evolu-tionary Computation, 2001, 5(6): 613-622. Tsai H K, Yang J M, Tsai Y F, Kao C Y. Some issues ofdesigning genetic algorithms for traveling salesman problems.Soft Computing, 2004, 8(10): 689-697. Goldberg D E, Korb B, Deb K. Messy genetic algorithms:Motivation, analysis, and first results. Complex Syst., 1989,3(5): 493-530. Goldberg D E, Deb K, Kargupta H, Hank G. Rapid accurateoptimization of difficult problems using fast messy genetic al-gorithms. In Proc. the 5th Int. Conf. Genetic Algorithms,June 1993, pp.56-64. Kujazew D, Golberg D E. OMEGA-ordering messy GA: Solv-ing permutation problems with the fast messy genetic algo-rithm and random keys. In Proc. Genetic Evolutionary Com-putation Conf., July 2000, pp.181-188. Zaritsky A, Sipper M. The preservation of favored build-ing blocks in the struggle for fitness: The Puzzle Algo-rithm. IEEE Transactions on Evolutionary Computation,2004, 8(5): 443-455. Chang P C, Chen S H, Fan C Y. Mining gene structures toinject artificial chromosomes for genetic algorithm in singlemachine scheduling problems. Applied Soft Computing, 2008,8(1): 767-777. Chang P C, Chen S H, Fan C Y, Chan C L. Genetic al-gorithm with artificial chromosomes for multi-objective flowshop scheduling problems. Applied Mathematics and Compu-tation, 2008, 205(2): 550-561. Chang P C, Chen S H, Fan C Y, Mani V. Generating ar-tificial chromosomes with probability control in genetic algo-rithm for machine scheduling problems. Annals of Operations Research, 2010, 180(1): 197-211. Kantardzic M. Data Mining: Concepts, Models, Methods,and Algorithms. Totowa, USA, Wiley-IEEE Press, 2003. Sangkavichitr C, Chongstitvatana P. Fragment as a smallevidence of the building blocks existence. In Exploitationof Linkage Learning in Evolutionary Algorithms, Chen YP (ed.), Adaptation, Learning, and Optimization, Springer-Verlag Berlin Heidelberg, 2010, pp.5-44. Dorigo M, Gambardella L M. Ant colony system: A coop-erative learning approach to the traveling salesman prob-lem. IEEE Transactions on Evolutionary Computation, 1997,1(1): 53-66. Narendra P M, Fukunaga K. A branch and bound algorithmfor feature subset selection. IEEE Transactions on Comput-ers, 1977, C-26(9): 917-922. Skellam J G. Studies in statistical ecology: I. Spatial pattern.Biometrica, 1952, 39(3/4): 346-362. Pasti R, de Castro L N. A Neuro-immune network for solvingthe traveling salesman problem. In Proc. International JointConference on Neural Networks, July 2006, 6: 3760-3766. Somhom S, Modares A, Enkawa T. A self-organizing modelfor the travelling salesman problem. Journal of the Opera-tional Research Society, 1997, 48: 919-928. Smith J, Fogarty T C. Recombination strategy adaptation viaevolution of gene linkage. In Proc. the IEEE Conference onEvolutionary Computation, USA, May 1996, pp.826-831. Hahsler M, Hornik K. TSP-Infrastructure for the travelingsalesperson problem. Journal of Statistical Software, 2007,23(2): 1-21. Yao X. An empirical study of genetic operators in geneticalgorithms. Microprocessing and Microprogramming, 1993,38(1-5): 707-714. Dai H W, Yang Y, Li C, Shi J, Gao S, Tang Z. Quantum in-terference crossover-based clonal selection algorithm and itsapplication to travelling salesman problem. IEICE Trans.Inf. & Syst., 2009, E92.D(1): 78-85. Chang P C, Huang W H, Ting C J. Developing a varietal GAwith ESMA strategy for solving the pick and place problemin printed circuit board assembly line. Journal of IntelligentManufacturing, 2010, DOI: 10.1007/s10845-010-0461-9.