A parametric hybrid method for the traveling salesman problem

DOI10.3390/MCA18030459zbMath1390.90468OpenAlexW2189435634MaRDI QIDQ1649273

Gözde Kızılates, Fidan Nuriyeva

Publication date: 5 July 2018

Published in: Mathematical \& Computational Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/mca18030459

zbMATH Keywords

traveling salesman problemGreedy algorithmnearest neighbor algorithmhyper heuristic algorithmparametric hybrid algorithm

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Uses Software

• Unnamed Item

This page was built for publication: A parametric hybrid method for the traveling salesman problem