Searching the components of the solution: The factor-based random search algorithm for ETSP

DOI10.1007/BF02900869MaRDI QIDQ4229560zbMATH OpenOpenAlexFDO

Authors Tao Guo, Lishan Kang, Jun Zhou, Qifang Fu

Publication date 26 May 1999

Published in Wuhan University Journal of Natural Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02900869

zbMATH Keywords

genetic algorithmrandom search algorithm

Mathematics Subject Classification ID

Searching and sorting (68P10) Learning and adaptive systems in artificial intelligence (68T05) Parallel algorithms in computer science (68W10)

Recommendations

• Genetic algorithms for the traveling salesman problem
• A random-key genetic algorithm for the generalized traveling salesman problem
• An Efficient Genetic Algorithm for the Traveling Salesman Problem
• Computational algorithms based on random search for solving global optimization problems
• Greedy randomized adaptive search procedures

Cites work

• Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem
• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• The traveling salesman problem: An overview of exact and approximate algorithms

Cited in

(1)

• ETSP

This page was built for publication: Searching the components of the solution: The factor-based random search algorithm for ETSP

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4229560)