Nuriyeva, FidanKizilates, GozdeBerberler, Murat ErsenAidaZade, K2019-10-272019-10-272012978-1-4673-4502-6; 978-1-4673-4500-2https://hdl.handle.net/11454/453484th International Conference on Problems of Cybernetics and Informatics (PCI) -- SEP 12-14, 2012 -- Baku, AZERBAIJANIn this study, the three new heuristic algorithms which are proposed in [1] for the solution of traveling salesman problem is developed. In addition, the new versions of 2-opt and 3-opt algorithms are proposed. These algorithms are tested and their performances are compared with the well-known heuristic algorithms such as Nearest Neighbor, and Greedy algorithms.eninfo:eu-repo/semantics/closedAccesstraveling salesman problemheuristic algorithmslocal searchConference ObjectWOS:000320337500183N/AN/A