Using 2-Opt based evolution strategy for travelling salesman problem

DOI10.11121/IJOCTA.01.2016.00268zbMath1426.90215OpenAlexW2337482471MaRDI QIDQ5273163

Sezai Tokat, Erdal Aydemir, Kenan Karagul

Publication date: 5 July 2017

Published in: An International Journal of Optimization and Control: Theories & Applications (IJOCTA) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.11121/ijocta.01.2016.00268

zbMATH Keywords

TSPHSharmony searchtravelling salesman problems2-OptTSPLIB(\(\mu+1\)) evolution strategy

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

This page was built for publication: Using 2-Opt based evolution strategy for travelling salesman problem