An Improved Genetic Algorithm with Initial Population Strategy for Symmetric TSP

Mathematical Problems in Engineering

Volumn 2015, Issue , 2015, Pages

  Deng, Yong ^a   Liu, Yang ^b   Zhou, Deyun ^a  

^a NORTHWESTERN POLYTECHNICAL UNIVERSITY   (China)

^b SOUTHWEST UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL OPTIMIZATION; GENETIC ALGORITHMS; OPTIMIZATION; TRAVELING SALESMAN PROBLEM;

ALGORITHM FOR SOLVING; AVERAGE ERRORS; CLUSTER CENTERS; COMBINATORIAL OPTIMIZATION PROBLEMS; ERROR VALUES; INITIAL POPULATION; K-MEANS ALGORITHM; TRAVELING ROUTES;

CLUSTERING ALGORITHMS;

EID: 84945290194     PISSN: 1024123X     EISSN: 15635147     Source Type: Journal    
DOI: 10.1155/2015/212794     Document Type: Article

References (35)

1. G. Gutin and A. P. Punnen,TheTraveling Salesman Problemand Its Variations, vol. 12, Springer, 2002.
2. F. Liu and G. Zeng, "Study of genetic algorithm with reinforcement learning to solve the TSP," Expert Systems with Applications, vol. 36, no. 3, pp. 6995-7001, 2009.
3. K. Helsgaun, "Effective implementation of the Lin-Kernighan traveling salesman heuristic," European Journal of Operational Research, vol. 126, no. 1, pp. 106-130, 2000.
4. E. Ruiz, M. Albareda-Sambola, E. Fernndez, and M. G. C. Resende, "A biased random-key genetic algorithm for the capacitated minimum spanning tree problem," Computers & Operations Research, vol. 57, pp. 95-108, 2015.
5. X. Zhang, Y. Zhang, Y. Hu, Y. Deng, and S. Mahadevan, "An adaptive amoeba algorithm for constrained shortest paths," Expert Systems with Applications, vol. 40, no. 18, pp. 7607-7616, 2013.
6. H.-X. Huang, J.-C. Li, and C.-L. Xiao, "A proposed iteration optimization approach integrating backpropagation neural network with genetic algorithm," Expert Systems with Applications, vol. 42, no. 1, pp. 146-155, 2015.
7. X. Zhang, S. Mahadevan, and Y. Deng, "Physarum-inspired applications in graph-optimization problems," Parallel Processing Letters, vol. 25, no. 1, Article ID 1540005, 2015.
8. A. Adamatzky, L. Bull, and B. D. L. Costello, Unconventional Computing 2007, Luniver Press, 2007.
9. X. Zhang, A. Adamatzky, F. T. Chan et al. , "A biologically inspired network designmodel," Scientific Reports, vol. 5, Article ID 10794, 2015.
10. D. S. Johnson and L. A. McGeoch, "The traveling salesman problem: a case study in local optimization," in Local Search in Combinatorial Optimization, vol. 1, pp. 215-310, JohnWiley & Sons, 1997.
11. M. Dorigo and L. M. Gambardella, "Ant colonies for the travelling salesman problem," BioSystems, vol. 43, no. 2, pp. 73-81, 1997.
12. N. Mladenovi, R. Todosijevi, and D. Urosevi, "Two level General variable neighborhood search for attractive traveling salesman problem," Computers&Operations Research B, vol. 52, pp. 341-348, 2014.
13. K. Karabulut and M. Fatih Tasgetiren, "A variable iterated greedy algorithm for the traveling salesman problem with time windows," Information Sciences, vol. 279, pp. 383-395, 2014.
14. H. Braun, "On solving travelling salesman problems by genetic algorithms," in Parallel Problem Solving from Nature, pp. 129-133, Springer, 1991.
15. N. K. Pareek and V. Patidar, "Medical image protection using genetic algorithm operations," Soft Computing, 2014.
16. S. Roy, "Genetic algorithm based approach to solve travelling salesman problem with one point crossover operator," International Journal of Computers & Technology, vol. 10, no. 3, pp. 1393-1400, 2013.
17. M. Thakur, S. S. Meghwani, and H. Jalota, "A modified real coded genetic algorithm for constrained optimization," Applied Mathematics and Computation, vol. 235, pp. 292-317, 2014.
18. X. Zhang, Y. Deng, F. T. S. Chan, P. Xu, S. Mahadevan, and Y. Hu, "IFSJSP: a novel methodology for the job-shop scheduling problem based on intuitionistic fuzzy sets," International Journal of Production Research, vol. 51, no. 17, pp. 5100-5119, 2013.
19. S. M. Elsayed, R. A. Sarker, and D. L. Essam, "A new genetic algorithm for solving optimization problems," Engineering Applications of Artificial Intelligence, vol. 27, pp. 57-69, 2014.
20. V. Togan and A. T. Daloglu, "An improved genetic algorithm with initial population strategy and self-adaptive member grouping," Computers & Structures, vol. 86, no. 11-12, pp. 1204-1218, 2008.
21. J. Chen, S.-Y. Zhang, Z. Gao, and L.-X. Yang, "Feature-based initial population generation for the optimization of job shop problems," Journal of Zhejiang University SCIENCE C, vol. 11, no. 10, pp. 767-777, 2010.
22. D. Sharma, K. Deb, and N. N. Kishore, "Domain-specific initial population strategy for compliant mechanisms using customized genetic algorithm," Structural and Multidisciplinary Optimization, vol. 43, no. 4, pp. 541-554, 2011.
23. Z. H. Ahmed, "The ordered clustered travelling salesman problem: a hybrid genetic algorithm," The Scientific World Journal, vol. 2014, Article ID258207, 13 pages, 2014.
24. J. H. Holland, Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence, University ofMichigan Press, Ann Arbor, Mich, USA, 1975.
25. M. Albayrak and N. Allahverdi, "Development a new mutation operator to solve the traveling salesman problem by aid of genetic algorithms," Expert Systems with Applications, vol. 38, no. 3, pp. 1313-1320, 2011.
26. S. Lloyd, "Least squares quantization in PCM," IEEE Transactions on Information Theory, vol. 28, no. 2, pp. 129-137, 1982.
27. T. Kanungo, D. M. Mount, N. S. Netanyahu, C. D. Piatko, R. Silverman, and A. Y. Wu, "An efficient k-means clustering algorithm: analysis and implementation," IEEE Transactions on PatternAnalysis andMachine Intelligence, vol. 24,no. 7, pp. 881-892, 2002.
28. A. K. Jain, "Data clustering: 50 years beyond k-means," Pattern Recognition Letters, vol. 31, no. 8, pp. 651-666, 2010.
29. P. Larra�aga, C. M. H. Kuijpers, R. H. Murga, I. Inza, and S. Dizdarevic, "Genetic algorithms for the travelling salesman problem: a review of representations and operators," Artificial Intelligence Review, vol. 13, no. 2, pp. 129-170, 1999.
30. E. Osaba, R. Carballedo, F. Diaz, and A. Perallos, "Analysis of the suitability of using blind crossover operators in genetic algorithms for solving routing problems," in Proceedings of the 8th IEEE International Symposium on Applied Computational Intelligence and Informatics (SACI '13), pp. 17-22, IEEE, Timisoara, Romania, May 2013.
31. R. Hinterding, "Gaussian mutation and self-adaption for numeric genetic algorithms," in Proceedings of the IEEE International Conference on Evolutionary Computation, pp. 384-388, IEEE, December 1995.
32. G. Ulusoy, F. Sivrikaya-Srifoglu, and U. Bilge, "A genetic algorithm approach to the simultaneous scheduling of machines and automated guided vehicles," Computers & Operations Research, vol. 24, no. 4, pp. 335-351, 1997.
33. W. Sun, "A novel genetic admission control for real-time multiprocessor systems," in Proceedings of the International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT '09), pp. 130-137, IEEE, December 2009.
34. J. Kirk, Traveling Saleman Problem Genetic Algorithm, 2011, http://www. mathworks. com/matlabcentral/fileexchange/13680-traveling-salesman-problem-genetic-algorithm.
35. TSPLIB, 2014, https://www. iwr. uni-heidelberg. de/groups/comopt/software/TSPLIB95/.