A Novel Metaheuristic for Travelling Salesman Problem | Zendy

Vahid Zharfi | Zendy; Abolfazl Mirzazadeh | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Novel Metaheuristic for Travelling Salesman Problem

Author(s) -

Vahid Zharfi,

Abolfazl Mirzazadeh

Publication year - 2013

Publication title -

journal of industrial engineering

Language(s) - English

Resource type - Journals

eISSN - 2314-4890

pISSN - 2314-4882

DOI - 10.1155/2013/347825

Subject(s) - travelling salesman problem , metaheuristic , mathematical optimization , vehicle routing problem , combinatorial optimization , heuristic , extremal optimization , computer science , routing (electronic design automation) , 2 opt , lin–kernighan heuristic , traveling purchaser problem , optimization problem , parallel metaheuristic , mathematics , computer network , meta optimization

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research