Table of Contents
Journal of Industrial Engineering
Volume 2013, Article ID 347825, 5 pages
Research Article

A Novel Metaheuristic for Travelling Salesman Problem

Industrial Engineering Department, Faculty of Engineering, Kharazmi University, Tehran 31979-37551, Iran

Received 30 April 2013; Accepted 3 July 2013

Academic Editor: Alan Chan

Copyright © 2013 Vahid Zharfi and Abolfazl Mirzazadeh. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


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.