Open Access Open Access  Restricted Access Subscription or Fee Access

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

Nitesh M. Sureja, Dr. Ved Vyas Dwivedi, Dr. Sanjeev Kumar

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

Full Text:

PDF

References


M. Hao, Z. Sun, “Comparative Reaserch on Modern optimization Algorithms in solving the Traveling Salesman Problem using Scilab”.

M. M. Flood, “The Traveling Salesman Problem,” Operations Research, 1956.

Gerard Reinelt. The Traveling Salesman: Computational Solutions for TSP Applications.

YANG, X.-S., DEB, S. Cuckoo Search via Lévy flights. In Proc World Congr. on Nature & Biologically Inspired Computing (NaBIC 2009). India, 2009, p. 210-214.

K. N. ABDUL RANI, M. F. ABD MALEK, N. SIEW-CHIN, “Nature-inspired cuckoo search algorithm for side lobe Suppression in a Symmetric Linear Antenna Array”, Radioengineering, vol. 21, no. 3, September 2012

YANG, X.-S., DEB, S. Engineering optimization by cuckoo search. Int. J. Mathematical Modelling and Numerical Optimization, Dec 2010, vol. 1, no. 4, p. 330-343.

BLUM, C., ROLI, A. Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Comput. Surv., 2003, vol. 35, p. 268-308.

BROWN, C., LIEBOVITCH, L. S., GLENDON, R. Lévy flights in Dobe Ju/'hoansi foraging patterns. Human Ecol., 2007, vol. 35, p. 129-138.

REYNOLDS, A. M., FRYE, M. A. Free-flight odor tracking in Drosophila is consistent with an optimal intermittent scale-free search. PLoS One, 2007, vol. 2, p. e354.

PAVLYUKEVICH, I. Lévy flights, non-local search and simulated annealing. J. Comput. Physics, 2007, vol. 226, p. 1830-1844.

Lévy flight. Vol. 2011: Wikipedia, 2011

M. Dorigo, L. Gambardella, “Antcolonies for the Traveling salesman problem.” Biosystems 43 (1997): (73-81).

Y. Li, S. Gong, Dynamic ant colony optimizationfor TSP, Int J Adv ManufTechnol, Vol. 22, July 2003.

M. Dorigo, G Caro, The antcolony optimization Metaheuristics, new ideas in optimization, McGraw Hill, 1999.

A. Zhou, L. Kang, Z. Yan, Solving Dynamic TSP with Evolutionary Approach in Real Time, in: Proceedings of the congress on Evolutionary computation, Canberra, Australia, 8 – 12, December 2003, IEEE Press, 951 – 957,2003.

N. Sureja, B. Chawda, “Random Travelling Salesman Problem using SA,” International Journal of Emerging Technology and Advanced Engineering, Volume 2, Issue 4, April 2012

N.Sureja, Dr. Ved Vyay Dwivwdi, Dr. S. Kumar, “EAS-DTSP: An Improved Ant System Model for Dynamic Traveling Salesman (DTSP) Problem”, , CiiT International Journal of Artificial Intelligent Systems and Machine Learning, Vol 7, No (09), 2015

N.Sureja, Dr. Ved Vyay Dwivwdi, Dr. S. Kumar, “MASA-DTSP: An Improved Model for Dynamic Traveling Salesman (DTSP) Problem”, CiiT International Journal of Artificial Intelligent Systems and Machine Learning, Vol 7, No (08), 2015


Refbacks

  • There are currently no refbacks.