Journal ArticleOPEN ACCESS

A Tabu Search Approximation for finding the Shortest distance using Traveling Salesman Problem

  • Rashid Khan M
  • Asadujjaman M
IOSR Journal of Mathematics (2016) 12(05) 80-84
DOI: 10.9790/5728-1205058084
N/ACitations
Citations of this article
14Readers
Mendeley users who have this article in their library.

Abstract

… search method for optimizing problem such as Traveling Salesman Problem (TSP). The main purpose of this work is to understand the symmetric TSP, solve this problem by using Tabu …

Cite

CITATION STYLE

APA

Rashid Khan, Md. M.-U.-, & Asadujjaman, Md. (2016). A Tabu Search Approximation for finding the Shortest distance using Traveling Salesman Problem. IOSR Journal of Mathematics, 12(05), 80–84. https://doi.org/10.9790/5728-1205058084

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free