relation: https://khub.utp.edu.my/scholars/11637/
title: Combinatorial Optimization: Comparison of Heuristic Algorithms in Travelling Salesman Problem
creator: Halim, A.H.
creator: Ismail, I.
description: The Travelling Salesman Problem (TSP) is an NP-hard problem with high number of possible solutions. The complexity increases with the factorial of n nodes in each specific problem. Meta-heuristic algorithms are an optimization algorithm that able to solve TSP problem towards a satisfactory solution. To date, there are many meta-heuristic algorithms introduced in literatures which consist of different philosophies of intensification and diversification. This paper focuses on 6 heuristic algorithms: Nearest Neighbor, Genetic Algorithm, Simulated Annealing, Tabu Search, Ant Colony Optimization and Tree Physiology Optimization. The study in this paper includes comparison of computation, accuracy and convergence. © 2017, CIMNE, Barcelona, Spain.
publisher: Springer Netherlands
date: 2019
type: Article
type: PeerReviewed
identifier:   Halim, A.H. and Ismail, I.  (2019) Combinatorial Optimization: Comparison of Heuristic Algorithms in Travelling Salesman Problem.  Archives of Computational Methods in Engineering, 26 (2).  pp. 367-380.  ISSN 11343060     
relation: https://www.scopus.com/inward/record.uri?eid=2-s2.0-85034599867&doi=10.1007%2fs11831-017-9247-y&partnerID=40&md5=09f0f0dd53f74be695248768e2e93740
relation: 10.1007/s11831-017-9247-y
identifier: 10.1007/s11831-017-9247-y