Hybrid genetic ant colony algorithm for traveling salesman problem

DOI10.3724/SP.J.1087.2008.02084MaRDI QIDQ3647499zbMATH OpenFDO

Authors Jing-Rong Xu, Yun Li, Haitao Liu, Pan Liu

Publication date 22 November 2009

Published in Journal of Computer Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3724/SP.J.1087.2008.02084

zbMATH Keywords

ant colony algorithmgenetic algorithmheuristic genetic informationpheromoneTSP

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• An efficient hybrid ant colony system for the Generalized Traveling Salesman Problem
• scientific article; zbMATH DE number 2092224
• GENI ants for the traveling salesman problem
• A reinforced hybrid genetic algorithm for the traveling salesman problem
• HYBRID NEWTON-RAPHSON GENETIC ALGORITHM FOR THE TRAVELING SALESMAN PROBLEM
• Hybrid genetic algorithm for undirected traveling salesman problems with profits
• An experimental study of a hybrid genetic algorithm for the maximum traveling salesman problem

Cited in

(5)

• A new hybrid heuristic approach for solving large traveling salesman problem
• Using a combination of the ant algorithm and an immune algorithm to solve TSP
• A genetic and ant colony collaborative optimization algorithm based on information entropy and chaos theory
• scientific article; zbMATH DE number 2092224 (Why is no real title available?)
• A new hybrid algorithm for solving large scale TSP

This page was built for publication: Hybrid genetic ant colony algorithm for traveling salesman problem

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