( ISSN 2277 - 9809 (online) ISSN 2348 - 9359 (Print) ) New DOI : 10.32804/IRJMSH

Impact Factor* - 6.2311


**Need Help in Content editing, Data Analysis.

Research Gateway

Adv For Editing Content

   No of Download : 56    Submit Your Rating     Cite This   Download        Certificate

SOFT COMPUTING TECHNIQUE: FOR TRAVELLING SALESMAN PROBLEM

    1 Author(s):  JUGMENDRA SINGH

Vol -  6, Issue- 9 ,         Page(s) : 263 - 268  (2015 ) DOI : https://doi.org/10.32804/IRJMSH

Abstract

Travelling salesman problem (TSP) is a combinatorial optimization problem. It is NP hard problem and TSP is the most intensively studied problem in the area of optimization. There are a number of approximation algorithms and heuristics proposed in the literature which can yield to good solutions. But with the increase in the number of cities, the complexity of the problem goes on increasing. There are a number of soft computing techniques that can be used to solve extremely large sized problems with millions of cities.

1. Adewole Philip, Akinwale Adio Taofiki and Otunbanowo Kehinde, “A Genetic Algorithm for Solving Travelling Salesman Problem”, International Journal of Advanced Computer Science and Applications, 2011, Vol. (2), No. (1).
2. Alka Singh Bhagel and Ritesh Rastogi, “Effective Approaches for Solving Large Travelling Salesman Problems with Small Populations”, International Journal of Advances in Engineering Research (IJAER), 2011, Vol. (1), Issue (1).
3. Chetan Chudasama, S. M. Shah and Mahesh Panchal, “Comparison of Parents Selection Methods of Genetic Algorithm for TSP”, International Conference on Computer Communication and Networks (CSI- COMNET), 2011.
4. Huilian FAN, “Discrete Particle Swarm Optimization for TSP based on Neighbourhood”, Journal of Computational Information Systems, 2010, pp. 3407-3414
5. Ivan Brezina Jr. Zuzana and Cickova, “Solving the Travelling Salesman Problem using the Ant colony Optimization”, Management Information Systems, 2011, Vol. (6), No. (4).
6. J. H., Holland, “Adaptation in Natural and Artificial Systems”, Univ. of Michigan Press, 1975.
7. J., Kingdon, “Intelligent Systems and Financial Forecasting”, Springer Verlag, London 1997.
8. Milena Karova, Vassil Smarkov and Stoyan Penev, “Genetic operator’s crossover and mutation in solving the TSP probem”, International Conference on Computer Systems and Technologies (CompSysTech), 2005.
9. Naveen Kumar, Karambir and Rajiv Kumar, “A Genetic Algorithm Approach To Study Travelling Salesman Problem”, Journal of Global Research in Computer Science, 2012, Vol. 3, No. (3).
10. Varshika Dwivedi, Taruna Chauhan, Sanu Saxena and Princie Agrawal, “Travelling Salesman Problem using Genetic Algorithm”, International Journal of Computer Applications(IJCA), 2012, pp. 25-30.
11. Z., Michalewicz, “Genetic Algorithms & Data Structures = Evolution Programs”, Springer-Verlag, Berlin 1996.

*Contents are provided by Authors of articles. Please contact us if you having any query.






Bank Details