WASET
	@article{(Open Science Index):https://publications.waset.org/pdf/4699,
	  title     = {A Comparison between Heuristic and Meta-Heuristic Methods for Solving the Multiple Traveling Salesman Problem },
	  author    = {San Nah Sze and  Wei King Tiong},
	  country	= {},
	  institution	= {},
	  abstract     = {The multiple traveling salesman problem (mTSP) can be used to model many practical problems. The mTSP is more complicated than the traveling salesman problem (TSP) because it requires determining which cities to assign to each salesman, as well as the optimal ordering of the cities within each salesman's tour. Previous studies proposed that Genetic Algorithm (GA), Integer Programming (IP) and several neural network (NN) approaches could be used to solve mTSP. This paper compared the results for mTSP, solved with Genetic Algorithm (GA) and Nearest Neighbor Algorithm (NNA). The number of cities is clustered into a few groups using k-means clustering technique. The number of groups depends on the number of salesman. Then, each group is solved with NNA and GA as an independent TSP. It is found that k-means clustering and NNA are superior to GA in terms of performance (evaluated by fitness function) and computing time.   },
	    journal   = {International Journal of Mathematical and Computational Sciences},
	  volume    = {1},
	  number    = {1},
	  year      = {2007},
	  pages     = {13 - 16},
	  ee        = {https://publications.waset.org/pdf/4699},
	  url   	= {https://publications.waset.org/vol/1},
	  bibsource = {https://publications.waset.org/},
	  issn  	= {eISSN: 1307-6892},
	  publisher = {World Academy of Science, Engineering and Technology},
	  index 	= {Open Science Index 1, 2007},
	}