A Novel Metaheuristic for Travelling Salesman Problem
Joint Authors
Mirzazadeh, Abolfazl
Zharfi, Vahid
Source
Journal of Industrial Engineering
Issue
Vol. 2013, Issue 2013 (31 Dec. 2013), pp.1-5, 5 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2013-07-18
Country of Publication
Egypt
No. of Pages
5
Main Subjects
Engineering Sciences and Information Technology
Science
Abstract EN
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.
American Psychological Association (APA)
Zharfi, Vahid& Mirzazadeh, Abolfazl. 2013. A Novel Metaheuristic for Travelling Salesman Problem. Journal of Industrial Engineering،Vol. 2013, no. 2013, pp.1-5.
https://search.emarefa.net/detail/BIM-464672
Modern Language Association (MLA)
Zharfi, Vahid& Mirzazadeh, Abolfazl. A Novel Metaheuristic for Travelling Salesman Problem. Journal of Industrial Engineering No. 2013 (2013), pp.1-5.
https://search.emarefa.net/detail/BIM-464672
American Medical Association (AMA)
Zharfi, Vahid& Mirzazadeh, Abolfazl. A Novel Metaheuristic for Travelling Salesman Problem. Journal of Industrial Engineering. 2013. Vol. 2013, no. 2013, pp.1-5.
https://search.emarefa.net/detail/BIM-464672
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-464672
