Study of genetic algorithm with reinforcement learning to solve the TSP

Authors:
Fei Liu;Guangzhou Zeng
Affiliations:
School of Computer Science and Technology, Shandong University, Shandong, Jinan 250061, China;School of Computer Science and Technology, Shandong University, Shandong, Jinan 250061, China
Venue:
Expert Systems with Applications: An International Journal
Year:
2009

Citing 6
Cited 8

A study of permutation crossover operators on the traveling salesman problem

Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
AllelesLociand the Traveling Salesman Problem

Proceedings of the 1st International Conference on Genetic Algorithms
Advanced Correlation Analysis of Operators for the Traveling Salesman Problem

PPSN III Proceedings of the International Conference on Evolutionary Computation. The Third Conference on Parallel Problem Solving from Nature: Parallel Problem Solving from Nature
Improving EAX with restricted 2-opt

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
How autonomy oriented computing (AOC) tackles a computationally hard optimization problem

AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
An evolutionary algorithm for large traveling salesman problems

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Reinforcement learning based resource allocation in business process management

Data & Knowledge Engineering
Parallelized genetic ant colony systems for solving the traveling salesman problem

Expert Systems with Applications: An International Journal
Genetic regulatory network-based symbiotic evolution

Expert Systems with Applications: An International Journal
A new geometric shape-based genetic clustering algorithm for the multi-depot vehicle routing problem

Expert Systems with Applications: An International Journal
A hybrid algorithm based on tabu search and ant colony optimization for k-minimum spanning tree problems

Expert Systems with Applications: An International Journal
Solving the traveling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniques

Expert Systems with Applications: An International Journal
A Hybrid Genetic Algorithm for the Bottleneck Traveling Salesman Problem

ACM Transactions on Embedded Computing Systems (TECS) - Special Issue on Modeling and Verification of Discrete Event Systems
Review: Cloud computing service composition: A systematic literature review

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	12.06

Visualization

Abstract

TSP (traveling salesman problem) is one of the typical NP-hard problems in combinatorial optimization problem. An improved genetic algorithm with reinforcement mutation, named RMGA, was proposed to solve the TSP in this paper. The core of RMGA lies in the use of heterogeneous pairing selection instead of random pairing selection in EAX and the construction of reinforcement mutation operator, named RL-M, by modifying the Q-learning algorithm and applying it to those individual generated from modified EAX. The experimental results on small and large size TSP instances in TSPLIB (traveling salesman problem library) have shown that RMGA could almost get optimal tour every time in reasonable time and thus outperformed the known EAX-GA and LKH in the quality of solutions and the running time.