A NEW HYBRID HEURISTIC ALGORITHM FOR SOLVING TSP

Authors : Gözde KIZILATEŞ, Fidan NURİYEVA

Pages : 143-148

View : 15 | Download : 9

Publication Date : 2015-05-05

Article Type : Research Paper

Abstract :T h e Travelin g Sale s ma n P roble m (T S P ) i s a n i m p ortan t a n d well known co m b inat o ri y al opti- mization proble m . The g o al of t h e p robl e m is to find the shortest t o u r t h at visit s eac h cit y in a given list exa c tly once and then retur n s to the start i ng cit y . Alt h ough t h e d e finition of t h e travelling sale s man probl e m is eas y , it b elongs to N P-Hard cla s s. In this pa p er, a new h y brid heuri s t ic algorithm based on Nea r est Neighbour (NN) a n d Greed y heu r isti c algori t h m s i s p r o po sed fo r s o lvin g t h e T SP . T h is propos e d h y brid h e u ristic algo r ithm i s c o m p ared w i th NN and Gr e edy heuristi cs. The ex p e r i m ental results s h ow that the proposed a l g orithm is e fficient
Keywords : Gezgin satıcı problemi, Hibrid sezgisel algoritma, Yakın komşu algoritması, Açgözlü algoritma