Browse > Article
http://dx.doi.org/10.5392/JKCA.2020.20.11.636

Differential Evolution Algorithm based on Random Key Representation for Traveling Salesman Problems  

Lee, Sangwook (목원대학교 정보통신융합공학부)
Publication Information
The Journal of the Korea Contents Association / v.20, no.11, 2020 , pp. 636-643 More about this Journal
Abstract
The differential evolution algorithm is one of the meta-heuristic techniques developed to solve the real optimization problem, which is a continuous problem space. In this study, in order to use the differential evolution algorithm to solve the traveling salesman problem, which is a discontinuous problem space, a random key representation method is applied to the differential evolution algorithm. The differential evolution algorithm searches for a real space and uses the order of the indexes of the solutions sorted in ascending order as the order of city visits to find the fitness. As a result of experimentation by applying it to the benchmark traveling salesman problems which are provided in TSPLIB, it was confirmed that the proposed differential evolution algorithm based on the random key representation method has the potential to solve the traveling salesman problems.
Keywords
Differential Evolution Algorithm; Random Key Representation; Traveling Salesman Problems; Continuous Space Search; Discrete Space Problem;
Citations & Related Records
연도 인용수 순위
  • Reference
1 P. Larranaga, 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.   DOI
2 G. Finke, A. Claus, and E. Gunn, "A two-commodity network flow approach to the traveling salesman problem," Vol.41, pp.167-178, 1984.
3 P. Miliotis, "Using cutting planes to solve the symmetric Travelling Salesman problem," Mathematical Programming, Vol.15, No.1, pp.177-188, 1978.   DOI
4 S. Lin and B. W. Kernighan, "An effective heuristic 0algorithm for the traveling-salesman problem," O0perations Research, Vol.21, pp.498-516, 1973.   DOI
5 J. Kennedy, R. C. Eberhart, and Y. Shi, Swarm intelligence, morgan kaufmann publishers, Inc., San Francisco, CA, USA, 2001.
6 S. Kirkpatrick and G. Toulouse, "Configuration space analysis of travelling salesman problems," Le Journal de Physique, Vol.46, No.8, pp.1277-1292, 1985.   DOI
7 M. Dorigo and L. M. Gambardella, "Ant colony system: a coop erative learning approach to the traveling salesman problem," IEEE Transactions on Evolutionary Computation, Vol.1, No.1, pp.53-66, 1997.   DOI
8 S. Bhide, N. John, and M. R. Kabuka, "A Boolean Neural Network Approach for the Traveling Salesman Problem," IEEE Transactions on Computers, Vol.42, No.10, pp.1271-1278, 1993.   DOI
9 F. Glover, "Artificial intelligence, heuristic frameworks and tabu search," Managerial and Decision Economics, Vol.11, No.5, pp.365-375, 1990.   DOI
10 P. Larranaga, 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.   DOI
11 A. Hussain and Y. S. Muhammad, "Genetic Algorithm for Traveling Salesman Problem with Modified Cycle Crossover Operator," Computational Intelligence and Neuroscience, Vol.2017, Article ID 7430125, pp.1-7, 2017.
12 C. Fu, L. Zhang, X. Wang, and L. Qiao, "Solving TSP problem with improved genetic algorithm," AIP Conference Proceedings 1967, 040057, 2018.
13 J. C. Bean, "Genetic algorithm and random keys for sequencing and optimization," ORSA Journal on Computing, Vol.6, No.2, pp.154-160, 1994.   DOI
14 S Saud, H Kodaz, and I Babaoglu, "Solving travelling salesman problem by using optimization algorithms," KnE Social Sciences, Vol.3, No.3, pp.17-32, 2018.   DOI
15 I. M. Ali, D. Essam, and K. Kasmarik, "A novel design of differential evolution for solving discrete traveling salesman problems," Swarm Evolution Computation, Vol.52, Article 100607, 2020.
16 R. Strorn and K. Price, "Differential evolution - a simple and efficient heuristic for global optimization over continuous spaces," Journal of Global Optimization, Vol.11, No.4, pp.341-359, 1997.   DOI
17 http://comopt.ifi.uni-heidelberg.de/software/TSPLIB95/