A reinforced hybrid genetic algorithm for the traveling salesman problem

DOI10.1016/j.cor.2023.106249arXiv2107.06870OpenAlexW4366779566MaRDI QIDQ6106563

Jiongzhi Zheng, Menglei Chen, Kun He, Jialun Zhong

Publication date: 3 July 2023

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2107.06870

zbMATH Keywords

combinatorial optimizationlocal searchtraveling salesman problemreinforcement learninghybrid genetic algorithm

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
• General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• Machine learning for combinatorial optimization: a methodological tour d'horizon
• Hybrid search with neighborhood reduction for the multiple traveling salesman problem
• A reinforcement learning approach to the orienteering problem with time windows
• Reinforcement learning for combinatorial optimization: a survey
• Computer Solutions of the Traveling Salesman Problem
• The Traveling-Salesman Problem and Minimum Spanning Trees
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

This page was built for publication: A reinforced hybrid genetic algorithm for the traveling salesman problem