2009•Unpublished venueRequires access

Genetic algorithm for Traveling Salesman Problem: Using modified Partially-Mapped Crossover operator

Vijendra Singh, S. Choudhary

Abstract

This paper addresses an attempt to evolve genetic algorithm by a particular modified partially mapped crossover method to make it able to solve the Traveling Salesman Problem. Which is type of NP-hard combinatorial optimization problems. The main objective is to look a better GA such that solves TSP with shortest tour. First we solve the TSP by using PMX (Goldberg and Lingle, 1985) and then a modified PMX to evolve a GA.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 13 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Travelling salesman problem, Crossover, Genetic algorithm, Operator (biology), Mathematical optimization, Computer science, Algorithm, Combinatorial optimization