1. bookVolumen 5 (2015): Edición 4 (October 2015)
Detalles de la revista
License
Formato
Revista
eISSN
2449-6499
Primera edición
30 Dec 2014
Calendario de la edición
4 veces al año
Idiomas
Inglés
Acceso abierto

Optimization of Traveling Salesman Problem Using Affinity Propagation Clustering and Genetic Algorithm

Publicado en línea: 29 Oct 2015
Volumen & Edición: Volumen 5 (2015) - Edición 4 (October 2015)
Páginas: 239 - 245
Detalles de la revista
License
Formato
Revista
eISSN
2449-6499
Primera edición
30 Dec 2014
Calendario de la edición
4 veces al año
Idiomas
Inglés

[1] Liao Y.-F., Yau D.-H., Chen C.-L., Evolutionary algorithm to traveling salesman problems, Computers & Mathematics with Applications, Vol. 64, Issue 5, pages 788-797, 2012.10.1016/j.camwa.2011.12.018Search in Google Scholar

[2] Leung, K.S., Jin H.D., & Xu, Z.B., An expanding self-organizing neural network for the traveling salesman problem, Neurocomputing, 62, 267-292. Masutti, T.A.S., & de Castro, L.N. (2004).10.1016/j.neucom.2004.02.006Search in Google Scholar

[3] Masutti, T.A.S., & de Castro, L.N., A selforganizing neural network using ideas from the immune system to solve the traveling salesman problem, Information Sciences, Vol. 179, Issue 10, pages 1454-1468, April 2009.10.1016/j.ins.2008.12.016Search in Google Scholar

[4] Lo, C.C., & Hsu, C.C., Annealing framework with learning memory, IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans, Vol. 28, Issue 5, pages 648-661, 1998.10.1109/3468.709611Search in Google Scholar

[5] Jayalakshmi, G.A., & Sathiamoorthy, A hybrid genetic algorithm - A new approach to solve traveling salesman problem, International Journal of Computational Engineering Science, Vol. 2, Issue 2, pages 339-355, 2001.10.1142/S1465876301000350Search in Google Scholar

[6] Tsai, H.K., Yang, J.M., Tsai, Y.F., & Kao, C.Y., Heterogeneous election genetic algorithms for traveling salesman problems, Engineering Optimization, Vol. 35, Issue 3, pages 297-311, 2003.10.1080/0305215031000109622Search in Google Scholar

[7] Dorigo, M., & Gambardella, L.M., Ant colony system: A cooperative learning approach to the traveling salesman problem, IEEE Transactions on Evolutionary Computation, Vol. 1, Issue 1, pages 53-66, 1997.10.1109/4235.585892Search in Google Scholar

[8] Liu, J.L., Rank-based ant colony optimization applied to dynamic traveling salesman problems, Engineering Optimization, Vol. 37, Issue 8, pages 831-847, 2005.10.1080/03052150500340504Search in Google Scholar

[9] Puris, A., Bello, R., & Herrera, Analysis of the efficacy of a two-stage methodology for ant colony optimization: Case of study with TSP and QAP, Expert Systems with Applications, Vol. 37, Issue 7, pages 5443-5453, 2010.10.1016/j.eswa.2010.02.069Search in Google Scholar

[10] Laporte, G., & Palekar U, Some applications of the clustered travelling salesman problem, The Journal of the Operational Research Society, Vol. 53, Issue 9, pages 972-976, 2002.10.1057/palgrave.jors.2601420Search in Google Scholar

[11] Anily, S., Bramel, J., & Hertz, A., A 5/3- approximation algorithm for the clustered traveling salesman tour and path problems, Operations Research Letters, Vol. 24, Issue1, pages 29-35, 1999.10.1016/S0167-6377(98)00046-7Search in Google Scholar

[12] Ding Chao, Cheng Ye, He Miao, Two-Level Genetic Algorithm for Clustered Traveling Salesman Problem with Application in Large-Scale TSPs, Tsinghua Science & Technology, Vol. 12, Issue 4, Pages 459-465, August 2007.10.1016/S1007-0214(07)70068-8Search in Google Scholar

[13] Tanasanee Phienthrakul, Clustering Evolutionary Computation for Solving Travelling Salesman Problems, International Journal of Advanced Computer Science and Information Technology (IJACSIT), Vol. 3, Issue 3, Page: 243-262, 2014.Search in Google Scholar

[14] B. J. Frey and D. Dueck. Response to Comment on Clustering by Passing Messages Between Data Points. Science, Vol. 319, Issue 5864, pages 726, 8 February 2008.10.1126/science.1151268Search in Google Scholar

[15] Goldberg, D. E. 1989a, Genetic Algorithms in Search, Optimization, and Machine Learning, Reading, MA: Addison-Wesley.Search in Google Scholar

[16] B. Hassanabadi, C.Shea, L.Zhang, S.Valaee, Clustering in Vehicular Ad Hoc Networks using Affinity Propagation, Original Research Article Ad Hoc Networks, Vol. 13, Part B, Feb. 2014, Pages 535-548.10.1016/j.adhoc.2013.10.005Search in Google Scholar

[17] F. Torrent-Fontbona, V. Muoz, B. Lpez Solving large immobile location-allocation by affinity propagation and simulated annealing, Expert Systems with Applications, Vol. 40, Issue 11, 1 Sep. 2013, Pages 4593-4599.10.1016/j.eswa.2013.01.065Search in Google Scholar

[18] http://www2.iwr.uniheidelberg.de/groups/comopt/software/TSPLIB9 5/tsp/Search in Google Scholar

Artículos recomendados de Trend MD

Planifique su conferencia remota con Sciendo