Get all the updates for this publication
Articles
A new approach for solving travelling salesman problem with fuzzy numbers using dynamic programmingPublished in IAEME Publication
2018
Volume: 9
Issue: 11
Pages: 954 - 966
Travelling Salesman Problem (TSP) is to detect the shortest closed tour such the teach city is visited exactly on ceinan n-city. The TSP problem is a special kind of an assignment model that eliminates sub-tours. In Dynamic Programming the optimum solution of a multivariable problem is obtained by decomposing sub-problem of a single variable. In this paper, Dynamic programming technique is applied to solve a Fuzzy Travelling Salesman Problem (FTSP) and MATLAB program is developed. © IAEME Publication.
Content may be subject to copyright.
About the journal
| Journal | International Journal of Mechanical Engineering and Technology |
|---|---|
| Publisher | IAEME Publication |
| ISSN | 09766340 |
Authors (2)
Dhanasekar S- A fuzzy inference system-an estimation of the quality of river water in Tamil Nadu
- Maximization of Lifetime of Wireless Sensor Network with Sensitive Power Dynamic Protocol
- Morin, a dietary bioflavonol suppresses monosodium urate crystal-induced inflammation in an animal model of acute gouty arthritis with reference to NLRP3 inflammasome, hypo-xanthine phospho-ribosyl transferase, and inflammatory mediators
- Fuzzy Hungarian MODI Algorithm to Solve Fully Fuzzy Transportation Problems
Kaliyappan M- Symbolic Computation of Adomian Polynomials Based on Rach’s Rule
- Solving time-fractional nonlinear coupled Boussinesq-Burgers equations arise in propagation of shallow water waves using adomian decomposition method
- Solving fuzzy assignment and fuzzy travelling salesman problems using R software
- Solving nonlinear integral equations and nonlinear integro-differential equations using laplace adomian decomposition method through sagemath
