Solving Traveling Salesman Problem by Marker Method
Neural and Evolutionary Computing
2013-07-23 v1 Data Structures and Algorithms
Optimization and Control
Abstract
In this paper we use marker method and propose a new mutation operator that selects the nearest neighbor among all near neighbors solving Traveling Salesman Problem.
Keywords
Cite
@article{arxiv.1307.5674,
title = {Solving Traveling Salesman Problem by Marker Method},
author = {Masoumeh Vali},
journal= {arXiv preprint arXiv:1307.5674},
year = {2013}
}