Solving Traveling Salesman Problem by Marker Method

TL;DR

This paper introduces a novel mutation operator based on the marker method that improves solutions for the Traveling Salesman Problem by selecting the nearest neighbor among all near neighbors.

Contribution

The paper proposes a new mutation operator utilizing the marker method to enhance heuristic solutions for the Traveling Salesman Problem.

Findings

The marker method effectively improves solution quality.

Nearest neighbor selection reduces tour length.

The approach outperforms traditional mutation methods.

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.