📄 IJAERD-OJS-5966
Different methodology for solving travelling salesman problem
| Author(s) | : | Mehul Ahir, Ravi kanjwani, Mahida Digvijaysinh |
| Institution | : | Department of Information Technology, Sigma Institute of Engineering |
| Published In | : | Vol. 4, Issue 13 — January 2017 |
| Page No. | : | - |
| Domain | : | Engineering |
| Type | : | Research Paper |
| ISSN (Online) | : | 2348-4470 |
| ISSN (Print) | : | 2348-6406 |
Abstract
Travelling salesman problem there are three methodology which we had covered in our paper.1) genericproblem 2) neural network 3) ant colony. Finds applications in wide domains. It is a well known NP Hard problem. . Acomparative analysis is done for the standard travelling salesman problem. .It is found that there are threemethodologies are used for solving traveling salesman problem which are respectively ant colony, natural network, andgeneric problem.
🕮 How to Cite
Mehul Ahir, Ravi kanjwani, Mahida Digvijaysinh, “Different methodology for solving travelling salesman problem”, International Journal of Advance Engineering and Research Development (IJAERD), Vol. 4, Issue 13, pp. -, January 2017.
Related Papers
Compact Tunable SIW Cavity Resonator Design for Ku-Band Applications
Hassan Al-Kuwari
