Artificial Intelligent Systems and Machine Learning

Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

CS-DTSP:A Model for Dynamic Traveling Salesman (DTSP) Problem


Affiliations
1 NIMS Institute of Engineering and Technology, Nims University, Jaipur, Rajasthan, India
2 Noble Group of Institutions, Junagadh, Gujarat, India
3 Department of Information Technology, NIMS Institute of Engineering and Technology, Nims University, Jaipur, Rajasthan, India
     

   Subscribe/Renew Journal


Cuckoo Search is a recently developed, novel and competitive Nature Inspired Optimization algorithm used for solving various linear and discrete combinatorial optimization problems. It is already applied to the problems like PCB Drilling, finding optimal features, optimizing the parameters of various classifiers including Neural Network, RBF, SVM parameters, finding optimizing cluster centers, job scheduling, find optimal path and many more in the different domains including industry, health sector, wireless sensor network, image processing and others. Due to its proven capacity in solution quality, accuracy and other parameters, in this paper we present a cuckoo search based model to solve Dynamic Traveling Salesman Problem. The results obtained are compared with the results obtained with the other models proposed for the same problem. Results obtained are very good in terms of all related parameters.

Keywords

Cuckoo Search Algorithm, Combinatorial Optimization, Dynamic Traveling Salesman Problem, Nature Inspired Algorithms, Random Walk.
User
Subscription Login to verify subscription
Notifications
Font Size

Abstract Views: 239

PDF Views: 3




  • CS-DTSP:A Model for Dynamic Traveling Salesman (DTSP) Problem

Abstract Views: 239  |  PDF Views: 3

Authors

Nitesh M. Sureja
NIMS Institute of Engineering and Technology, Nims University, Jaipur, Rajasthan, India
Ved Vyas Dwivedi
Noble Group of Institutions, Junagadh, Gujarat, India
Sanjeev Kumar
Department of Information Technology, NIMS Institute of Engineering and Technology, Nims University, Jaipur, Rajasthan, India

Abstract


Cuckoo Search is a recently developed, novel and competitive Nature Inspired Optimization algorithm used for solving various linear and discrete combinatorial optimization problems. It is already applied to the problems like PCB Drilling, finding optimal features, optimizing the parameters of various classifiers including Neural Network, RBF, SVM parameters, finding optimizing cluster centers, job scheduling, find optimal path and many more in the different domains including industry, health sector, wireless sensor network, image processing and others. Due to its proven capacity in solution quality, accuracy and other parameters, in this paper we present a cuckoo search based model to solve Dynamic Traveling Salesman Problem. The results obtained are compared with the results obtained with the other models proposed for the same problem. Results obtained are very good in terms of all related parameters.

Keywords


Cuckoo Search Algorithm, Combinatorial Optimization, Dynamic Traveling Salesman Problem, Nature Inspired Algorithms, Random Walk.