Escape from solutions stagnation. A study on ant system solving TSP

MaRDI QIDQ5116097zbMATHFDO

Authors Camelia-M. Pintea, Barna Laszlo Iantovics, Petrica Pop, Matthias Dehmer

Publication date 21 August 2020

zbMATH Keywords

graphsheuristicstraveling salesman problemant colony optimizaton

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial optimization (90C27)

Recommendations

• Research of ant colony algorithm on TSP problems
• scientific article; zbMATH DE number 1488087
• A new rank based version of the ant system. -- A computational study
• Ant colony optimization algorithms for solving transportation problems
• scientific article; zbMATH DE number 1487504

This page was built for publication: Escape from solutions stagnation. A study on ant system solving TSP

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