Using 2-Opt based evolution strategy for travelling salesman problem | Zendy

Kenan Karagül | Zendy; Erdal Aydemir | Zendy; Sezai Tokat | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Using 2-Opt based evolution strategy for travelling salesman problem

Author(s) -

Kenan Karagül,

Erdal Aydemir,

Sezai Tokat

Publication year - 2016

Publication title -

an international journal of optimization and control theories and applications (ijocta)

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.287

H-Index - 6

eISSN - 2146-5703

pISSN - 2146-0957

DOI - 10.11121/ijocta.01.2016.00268

Subject(s) - travelling salesman problem , harmony search , roulette , mathematical optimization , 2 opt , fitness proportionate selection , vertex (graph theory) , computer science , algorithm , mathematics , genetic algorithm , theoretical computer science , graph , fitness function , geometry

Harmony search algorithm that matches the (µ+1) evolution strategy, is a heuristic method simulated by the process of music improvisation. In this paper, a harmony search algorithm is directly used for the travelling salesman problem. Instead of conventional selection operators such as roulette wheel, the transformation of real number values of harmony search algorithm to order index of vertex representation and improvement of solutions are obtained by using the 2-Opt local search algorithm. Then, the obtained algorithm is tested on two different parameter groups of TSPLIB. The proposed method is compared with classical 2-Opt which randomly started at each step and best known solutions of test instances from TSPLIB. It is seen that the proposed algorithm offers valuable solutions.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research