Solving Traveling Salesman Problem by Marker Method

07/22/2013
by   Masoumeh Vali, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

research
03/21/2007

A Note on Approximate Nearest Neighbor Methods

A number of authors have described randomized algorithms for solving the...
research
08/24/2010

A Simple CW-SSIM Kernel-based Nearest Neighbor Method for Handwritten Digit Classification

We propose a simple kernel based nearest neighbor approach for handwritt...
research
05/28/2023

k-NNN: Nearest Neighbors of Neighbors for Anomaly Detection

Anomaly detection aims at identifying images that deviate significantly ...
research
11/25/2022

Doubly robust nearest neighbors in factor models

In this technical note, we introduce an improved variant of nearest neig...
research
11/08/2012

Nearest Neighbor Value Interpolation

This paper presents the nearest neighbor value (NNV) algorithm for high ...
research
03/08/2017

Leveraging Sparsity for Efficient Submodular Data Summarization

The facility location problem is widely used for summarizing large datas...
research
10/16/2017

Large Scale Graph Learning from Smooth Signals

Graphs are a prevalent tool in data science, as they model the inherent ...

Please sign up or login with your details

Forgot password? Click here to reset