A Novel Metaheuristic for Travelling Salesman Problem. (18th July 2013)

• Record Type: Journal Article
• Authors: Zharfi, Vahid; Mirzazadeh, Abolfazl
• Other Names: Chan Alan Academic Editor.
• Is Part Of: Journal of industrial engineering. Volume 2013(2013)
• Publication Date: 2013-07-18
• Subjects: Industrial engineering -- Periodicals; Industrial engineering; Periodicals; 620
• DOI: 10.1155/2013/347825
• Languages: English
• ISSNs: 2314-4882

Abstract

Abstract : One of the well-known combinatorial optimization problems is travelling salesman problem (TSP). This problem is in the fields of logistics, transportation, and distribution. TSP is among the NP-hard problems, and many different metaheuristics are used to solve this problem in an acceptable time especially when the number of cities is high. In this paper, a new meta-heuristic is proposed to solve TSP which is based on new insight into network routing problems.