Reinforced Hybrid Genetic Algorithm for the Traveling Salesman Problem

07/09/2021
by   Jiongzhi Zheng, et al.
0

We propose a powerful Reinforced Hybrid Genetic Algorithm (RHGA) for the famous NP-hard Traveling Salesman Problem (TSP). RHGA combines reinforcement learning technique with the well-known Edge Assembly Crossover genetic algorithm (EAX-GA) and the Lin-Kernighan-Helsgaun (LKH) local search heuristic. With the help of the proposed hybrid mechanism, the genetic evolution of EAX-GA and the local search of LKH can boost each other's performance. And the reinforcement learning technique based on Q-learning further promotes the hybrid genetic algorithm. Experimental results on 138 well-known and widely used TSP benchmarks, with the number of cities ranging from 1,000 to 85,900, demonstrate the excellent performance of the proposed method.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/19/2014

A Powerful Genetic Algorithm for Traveling Salesman Problem

This paper presents a powerful genetic algorithm(GA) to solve the travel...
research
02/19/2004

Parameter-less Optimization with the Extended Compact Genetic Algorithm and Iterated Local Search

This paper presents a parameter-less optimization framework that uses th...
research
09/10/2014

An improved genetic algorithm with a local optimization strategy and an extra mutation level for solving traveling salesman problem

The Traveling salesman problem (TSP) is proved to be NP-complete in most...
research
08/17/2013

Graph Colouring Problem Based on Discrete Imperialist Competitive Algorithm

In graph theory, Graph Colouring Problem (GCP) is an assignment of colou...
research
11/30/2021

Task Assignment in Distributed Systems based on PSO Approach

In a distributed system, Task Assignment Problem (TAP) is a key factor f...
research
06/01/2023

Some Experiences with Hybrid Genetic Algorithms in Solving the Uncapacitated Examination Timetabling Problem

This paper provides experimental experiences on two local search hybridi...
research
02/02/2021

Clustering with Penalty for Joint Occurrence of Objects: Computational Aspects

The method of Holý, Sokol and Černý (Applied Soft Computing, 2017, Vol. ...

Please sign up or login with your details

Forgot password? Click here to reset