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

MASA-DTSP: An Improved 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


The Memetic algorithms (MA) are computational models inspired by the Cultural Revolution. Robustness, scalability and simplicity are the advantages of Memetic algorithms. By looking at this strength of MA, they are very much suitable for solving some combinatorial optimization problems which falls in the category of NP-hard problems. In this paper, we propose MA based optimization model for Dynamic Traveling Salesman Problem (DTSP), to achieve overall higher system performance and better throughput.

During implementation, results are obtained with number of randomly generated Traveling Salesman Problem instances, measured in terms of required time, quality and path length. It has been observed that the proposed model works well in terms of quality and path length. As it uses Simulated Annealing, it is found little bit less effective in terms of time.


Keywords

Memetic Algorithms, Simulated Annealing, Dynamic Traveling Salesman Problem (DTSP), Optimization Problems.
User
Subscription Login to verify subscription
Notifications
Font Size

Abstract Views: 249

PDF Views: 3




  • MASA-DTSP: An Improved Model for Dynamic Traveling Salesman (DTSP) Problem

Abstract Views: 249  |  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


The Memetic algorithms (MA) are computational models inspired by the Cultural Revolution. Robustness, scalability and simplicity are the advantages of Memetic algorithms. By looking at this strength of MA, they are very much suitable for solving some combinatorial optimization problems which falls in the category of NP-hard problems. In this paper, we propose MA based optimization model for Dynamic Traveling Salesman Problem (DTSP), to achieve overall higher system performance and better throughput.

During implementation, results are obtained with number of randomly generated Traveling Salesman Problem instances, measured in terms of required time, quality and path length. It has been observed that the proposed model works well in terms of quality and path length. As it uses Simulated Annealing, it is found little bit less effective in terms of time.


Keywords


Memetic Algorithms, Simulated Annealing, Dynamic Traveling Salesman Problem (DTSP), Optimization Problems.