Study of genetic algorithm with reinforcement learning to solve the TSP

Expert Systems with Applications

Volumn 36, Issue 3 PART 2, 2009, Pages 6995-7001

  Liu, Fei ^a   Zeng, Guangzhou ^a  

^a SHANDONG UNIVERSITY   (China)

Author keywords

Genetic algorithm; Heterogeneous pairing selection; Reinforcement mutation; TSP (traveling salesman problem)

Indexed keywords

COMBINATORIAL OPTIMIZATION; COMPUTATIONAL COMPLEXITY; GENETIC ALGORITHMS; LEARNING ALGORITHMS; REINFORCEMENT LEARNING;

COMBINATORIAL OPTIMIZATION PROBLEMS; HETEROGENEOUS PAIRING SELECTION; MUTATION OPERATORS; OPTIMAL TOURS; Q-LEARNING ALGORITHMS; QUALITY OF SOLUTION; RANDOM PAIRING; TSP (TRAVELING SALESMAN PROBLEM);

TRAVELING SALESMAN PROBLEM;

EID: 58349100863     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2008.08.026     Document Type: Article

References (21)

1. Ben-nian W., et al. RMGA: A reinforcement learning based genetic algorithm. Acta Electronica Sinica 34 5 (2006) 856-860 866
2. Chan, C. H., Lee, S. A., & Kao, C. Y., et al. (2005). Improving EAX with restricted 2-opt. In Genetic and evolutionary computation conference (pp. 1471-1476). Washington DC, USA.
3. Dorigo M., and Gambardella L.M. Ant colonies for the traveling salesman problem. BioSystems 43 2 (1997) 73-81
4. Dzubera J., and Whitley D. Advanced correlation analysis of operators for the traveling salesman problem. In: Davidor Y., Schwefel H.P., and Manner R. (Eds). Parallel problem solving from nature-PPSN III (1994), Springer-Verlag, New York 68-77
5. Freisleben, B., & Merz, P. (1996). A genetic local search algorithm for solving symmetric and asymmetric traveling salesman problems. In Proceedings of the IEEE international conference on evolutionary computation (pp. 616-621).
6. Freisleben B., and Merz P. Memetic algorithms for the traveling salesman problem. Complex Systems 13 4 (2001) 297-3345
7. Gambardella L.M., and Dorigo M. Ant-Q: A reinforcement learning approach to the traveling salesman problem. Proceedings of the ML-95, 12th international conference on machine learning (1995), Morgan Kaufmann 252-260
8. Goldberg, D. E., & Lingle, R. (1985). Alleles, loci, and the traveling salesman problem. In Proceedings of the international conference on genetic algorithms and their applications (pp. 154-159).
9. Gorges-Schleuter, M. (1997). Asparagos96 and the traveling salesman problem. In Proceedings of the IEEE international conference on evolutionary computation (pp. 171-174).
10. In: Gutin G., and Punnen A.P. (Eds). The traveling salesman problem and its variations (2002), Kluwer
11. Helsgaun K. An effective implementation of the Lin-Kernighan traveling salesman heuristic. European Journal of Operational Research 126 1 (2000) 106-130
12. Johnson D.S., and McGeoch L.A. The traveling salesman problem: A case study in local optimization. In: Aarts E.H.L., and Lenstra J.K. (Eds). Local search in combinatorial optimization (1997), John Wiley and Sons, Chichester, England 215-310
13. Jung, S., & Moon, B. (2001). The natural crossover for the 2D Euclidean TSP. In Proceedings of the Genetic and evolutionary computation conference (pp. 1003-1010).
14. Nagata, Y., & Kobayashi, S. (1997). Edge assembly crossover: A high-power genetic algorithm for the traveling salesman problem. In Proceedings of the 7th international conference on genetic Algorithms (ICGA) (pp. 450-457).
15. Nagata Y., and Kobayashi S. An analysis of edge assembly crossover for the traveling salesman problem. IEEE Transactions on Systems, Man and Cybernetics (1999) 628-633
16. Nguyen, H. D., Yoshihara, I., Yamamori, K., & Yasunaga, M. (2002). Greedy genetic algorithms for symmetric and asymmetric TSPs. IPSY transactions on mathematical modeling and applications (Vol. 43, no. SIG10(TOM7), pp. 165-175).
17. Oliver, I., Smith, D., & Holland, J. (1987). A study of permutation crossover operators on the traveling salesman problem. In Proceedings of the second international conference on genetic algorithms (pp. 224-230).
18. Reinelt G. TSPLIB:A traveling salesman problem library. ORSA Journal on Computing 3 3 (1991) 376-384
19. Tsai H.-K., et al. An evolutionary algorithm for large traveling salesman problems. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics 34 4 (2004) 1718-1729
20. Wu B., and Shi Z.Z. An ant colony algorithm based partition algorithm for TSP. Chinese Journal of Computers 24 12 (2001) 328-1333
21. Xie, Xiao-Feng., & Liu, Jiming (2006). How autonomy oriented computing (AOC) tackles a computationally hard optimization problem. In AAMAS'06, May 8-12, Hakodate, Hokkaido, Japan (pp. 646-653).