Developing Programming Tools to Handle Traveling Salesman Problem by the Three Object-Oriented Languages. (23rd December 2014)

• Record Type: Journal Article
• Authors: Ismkhan, Hassan; Zamanifar, Kamran
• Other Names: Liu Baoding Academic Editor.
• Is Part Of: Applied computational intelligence and soft computing. Volume 2014(2014)
• Publication Date: 2014-12-23
• Subjects: Computational intelligence -- Periodicals; Soft computing -- Periodicals; 006.305
• DOI: 10.1155/2014/137928
• Languages: English
• ISSNs: 1687-9724

Abstract

Abstract : The traveling salesman problem (TSP) is one of the most famous problems. Many applications and programming tools have been developed to handle TSP. However, it seems to be essential to provide easy programming tools according to state-of-the-art algorithms. Therefore, we have collected and programmed new easy tools by the three object-oriented languages. In this paper, we present ADT (abstract data type) of developed tools at first; then we analyze their performance by experiments. We also design a hybrid genetic algorithm (HGA) by developed tools. Experimental results show that the proposed HGA is comparable with the recent state-of-the-art applications.