Open AccessA Comparison of Exhaustive, Heuristic and Genetic Algorithm for Travelling Salesman Problem in PROLOG
Author(s) -
Nur Ariffin Mohd Zin,
Siti Norul Huda Sheikh Abdullah,
Noor Faridatul Ainun Zainal,
Esmayuzi Ismail
Publication year - 2012
Publication title -
international journal on advanced science engineering and information technology
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.216
H-Index - 22
eISSN - 2460-6952
pISSN - 2088-5334
DOI - 10.18517/ijaseit.2.6.244
Subject(s) - travelling salesman problem , tree traversal , heuristic , genetic algorithm , closeness , mathematical optimization , path (computing) , computer science , null move heuristic , lin–kernighan heuristic , algorithm , prolog , 2 opt , mathematics , theoretical computer science , mathematical analysis , programming language
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom