eprintid: 11637
rev_number: 2
eprint_status: archive
userid: 1
dir: disk0/00/01/16/37
datestamp: 2023-11-10 03:26:09
lastmod: 2023-11-10 03:26:09
status_changed: 2023-11-10 01:15:44
type: article
metadata_visibility: show
creators_name: Halim, A.H.
creators_name: Ismail, I.
title: Combinatorial Optimization: Comparison of Heuristic Algorithms in Travelling Salesman Problem
ispublished: pub
keywords: Ant colony optimization; Combinatorial optimization; Computational complexity; Genetic algorithms; Nearest neighbor search; Philosophical aspects; Problem solving; Simulated annealing; Tabu search; Traveling salesman problem; Trees (mathematics), Intensification and diversifications; Meta heuristic algorithm; Nearest neighbors; Optimization algorithms; Satisfactory solutions; Specific problems; Travelling salesman problem; Travelling salesman problem (TSP), Heuristic algorithms
note: cited By 76
abstract: 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.
date: 2019
publisher: Springer Netherlands
official_url: https://www.scopus.com/inward/record.uri?eid=2-s2.0-85034599867&doi=10.1007%2fs11831-017-9247-y&partnerID=40&md5=09f0f0dd53f74be695248768e2e93740
id_number: 10.1007/s11831-017-9247-y
full_text_status: none
publication: Archives of Computational Methods in Engineering
volume: 26
number: 2
pagerange: 367-380
refereed: TRUE
issn: 11343060
citation:   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