Indian Journal of Science and Technology

Open Access Open Access  Restricted Access Subscription Access

A Framework for the Design and Analysis of an Evolutionary Algorithm for Multi Travelling Salesman Problem


Affiliations
1 Department of Mathematics, Sri Chandrasekharendra Saraswathi Viswa Mahavidyalaya SCSVMV University, Enathur, Kanchipuram – 631561, Tamil Nadu, India
2 Department of Mathematics Division, Vellore Institute of Technology (VIT) University, Vandalur - Kelambakkam Road, Chennai – 600127, Tamil Nadu, India
 

This paper mainly deals with the design of an evolutionary algorithm for a Multi Travelling Salesman problem. The solution for this problem in multi application fields becomes a highly NP hard type problems which is in need of an efficient solution. The aim of the study is to find an optimal schedule of a salesman which is formed as a multiple objective problem. The mathematical model for the Multi Objective in Multi Travelling salesman problem is stated with the corresponding notations. To get an optimal schedule an evolutionary based approach is proposed to meet the criteria.The proposed algorithm is modelled and stimulated as a program and tested with a suitable example. The output results are given as a grant chart, with the optimal sequence schedule of each salesman.

Keywords

And Approach, Criteria, Evolutionary, Expense, Minimized Minim Maximize, Multi Travelling, Optimal Schedule, Optimal, Profit, Salesman, Time The.
User

Abstract Views: 195

PDF Views: 0




  • A Framework for the Design and Analysis of an Evolutionary Algorithm for Multi Travelling Salesman Problem

Abstract Views: 195  |  PDF Views: 0

Authors

K. Bharathi
Department of Mathematics, Sri Chandrasekharendra Saraswathi Viswa Mahavidyalaya SCSVMV University, Enathur, Kanchipuram – 631561, Tamil Nadu, India
C. Vijayalakshmi
Department of Mathematics Division, Vellore Institute of Technology (VIT) University, Vandalur - Kelambakkam Road, Chennai – 600127, Tamil Nadu, India

Abstract


This paper mainly deals with the design of an evolutionary algorithm for a Multi Travelling Salesman problem. The solution for this problem in multi application fields becomes a highly NP hard type problems which is in need of an efficient solution. The aim of the study is to find an optimal schedule of a salesman which is formed as a multiple objective problem. The mathematical model for the Multi Objective in Multi Travelling salesman problem is stated with the corresponding notations. To get an optimal schedule an evolutionary based approach is proposed to meet the criteria.The proposed algorithm is modelled and stimulated as a program and tested with a suitable example. The output results are given as a grant chart, with the optimal sequence schedule of each salesman.

Keywords


And Approach, Criteria, Evolutionary, Expense, Minimized Minim Maximize, Multi Travelling, Optimal Schedule, Optimal, Profit, Salesman, Time The.



DOI: https://doi.org/10.17485/ijst%2F2016%2Fv9i48%2F140139