@article{(Open Science Index):https://publications.waset.org/pdf/17101,
	  title     = {Implementation of Heuristics for Solving Travelling Salesman Problem Using Nearest Neighbour and Minimum Spanning Tree Algorithms},
	  author    = {Fatma A. Karkory and  Ali A. Abudalmola},
	  country	= {},
	  institution	= {},
	  abstract     = {The travelling salesman problem (TSP) is a combinatorial optimization problem in which the goal is to find the shortest path between different cities that the salesman takes. In other words, the problem deals with finding a route covering all cities so that total distance and execution time is minimized. This paper adopts the nearest neighbor and minimum spanning tree algorithm to solve the well-known travelling salesman problem. The algorithms were implemented using java programming language. The approach is tested on three graphs that making a TSP tour instance of 5-city, 10 –city, and 229–city. The computation results validate the performance of the proposed algorithm.
},
	    journal   = {International Journal of Computer and Information Engineering},
	  volume    = {7},
	  number    = {10},
	  year      = {2013},
	  pages     = {1524 - 1534},
	  ee        = {https://publications.waset.org/pdf/17101},
	  url   	= {https://publications.waset.org/vol/82},
	  bibsource = {https://publications.waset.org/},
	  issn  	= {eISSN: 1307-6892},
	  publisher = {World Academy of Science, Engineering and Technology},
	  index 	= {Open Science Index 82, 2013},
	}