z-logo
open-access-imgOpen Access
Solving TSP using DARO
Author(s) -
Nitin S. Choubey
Publication year - 2012
Publication title -
international journal of computer applications
Language(s) - English
Resource type - Journals
ISSN - 0975-8887
DOI - 10.5120/9311-3543
Subject(s) - computer science
Salesperson Problem is finding a Hamiltonian cycle with minimum weight. The paper presents solution travelling salesperson problem with Genetic Algorithm. Dynamic allocation of reproduction operators and social disaster technique are used for generating the population and based on the convergence analysis of evaluation process. The method is demonstrated and found to be effective in the data set for the cities in the state of Maharashtra.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom