TRAVELLING SALESMAN ALGORITHM APPLICATIONS

Hamizah Hanis binti Baharim #1, Mohamed Faidz Mohamed Said #2

# Universiti Teknologi MARA
70300 Seremban, Negeri Sembilan, MALAYSIA

1 hamizahbaharim@gmail.com
2 faidzms@ieee.org

 
Abstract—The Traveling Salesman Problem (TSP) is to find a shortest tour that stops at each city exactly once for a given list of cities and return back to the initial city. In this paper, some methods are studied in order to solve the Traveling Salesman Problem. This paper shows some theories that are related in solving the TSP. The aim of this paper is to show the applications and solution for the traveling salesman algorithm at the end of the paper.
Keyword: Travelling Salesman Algorithm Applications, TSP



REFERENCES

[1]	R. Zamani and S. K. Lau, "Embedding learning capability in Lagrangean relaxation," European Journal of Operational Research, pp. 82-88, 2010.

[2]	Y.-F. Liao, D.-H. Yau, and C.-L. Chen, "Evolutionary algorithm to traveling salesman problems," Computers & Mathematics with Applications, vol. 64, pp. 788-797, 2012.

[3]	B. Codenotti and L. Margara, "Traveling salesman problem and local search," Applied mathematics letters, vol. 5, pp. 69-71, 1992.

[4]	J. Schneider, C. Froschhammer, I. Morgenstern, T. Husslein, and J. M. Singer, "Searching for backbones—an efficient parallel algorithm for the traveling salesman problem," Computer Physics Communications, vol. 96, pp. 173-188, 1996.

[5]	M. G. A. Verhoeven, E. H. L. Aarts, and P. C. J. Swinkels, "A parallel 2-opt algorithm for the Traveling Salesman Problem," Future Generation Computer Systems, vol. 11, pp. 175-182, 3// 1995.

[6]	A. Zhou, F. Gao, and G. Zhang, "A decomposition based estimation of distribution algorithm," Computers and Mathematics with Applications 66, pp. 1857-1868, 2013.

[7]	Z. H. Ahmed, "An exact algorithm for the clustered travelling salesman," Operational Research Society of India pp. 215–228 2012.

[8]	V. A. Shim, K. C. Tan, J. Y. Chia, and J. K. Chong, "Evolutionary algorithms for solving multi-objective travelling salesman problem," Flexible services and manufacturing journal, vol. 23, pp. 207-241, 2011.

[9]	A. Baltz, M. El Ouali, G. Jäger, V. Sauerland, and A. Srivastav, "Exact and heuristic algorithms for the Travelling Salesman Problem with Multiple Time Windows and Hotel Selection," Journal of the Operational Research Society, vol. 66, pp. 615-626, 2014.

[10]	G. Ausiello, E. Feuerstein, S. Leonardi, L. Stougie, and M. Talamo, "Algorithms for the On-Line Travelling Salesman1," Algorithmica, vol. 29, pp. 560-581, 2001.

[11]	L. Shi, S. Ólafsson, and N. Sun, "New parallel randomized algorithms for the traveling salesman problem," Computers & Operations Research, vol. 26, pp. 371-394, 1999.

[12]	P. L. ˜naga, C. M. H. Kuijpers, R. H. Murga, I. Inza, and S. Dizdarevic, "Genetic Algorithms for the Travelling Salesman Problem," Arti?cial Intelligence Review, vol. 13, pp. 129-170, 1999.

[13]	A. Subramanian and M. Battarra, "An iterated local search algorithm for the Travelling Salesman Problem with Pickups and Deliveries," Journal of the Operational Research Society, vol. 64, pp. 402-409, 2012.

[14]	D. Marco and G. Luca Maria, "Ant colonies for the travelling salesman problem," BioSystems, vol. 43, pp. 73-81, 1997.