ScholarLens Back to search
2005•Unpublished venueRequires access

Solving traveling salesman problem by using a local evolutionary algorithm

Xuan Wang, Yuanxiang Li

Open publisher page 14 citations

Abstract

This paper introduces a new local evolutionary algorithm (LEA) and uses it to solve the traveling salesman problem. The algorithm incorporates speediness of local search methods in neighborhood search with robustness of evolutionary methods in global search in order to obtain global optimum. The experimental results show that the algorithm is of potential to obtain global optimum or more accurate solutions than other evolutionary methods for the TSP.

About this research paper

What this paper is about

This paper introduces a new local evolutionary algorithm (LEA) and uses it to solve the traveling salesman problem. The algorithm incorporates speediness of local search methods in neighborhood search with robustness of evolutionary methods in global search in order to obtain global optimum. The experimental results show that the algorithm is of potential to obtain global optimum or more accurate solutions than other evolutionary methods for the TSP.

Why it matters

OpenAlex reports 14 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

This paper introduces a new local evolutionary algorithm (LEA) and uses it to solve the traveling salesman problem. The algorithm incorporates speediness of local search methods in neighborhood search with robustness of evolutionary methods in global search in order to obtain global optimum. The experimental results show that the algorithm is of potential to obtain global optimum or more accurate solutions than other evolutionary methods for the TSP.

Key concepts: Travelling salesman problem, Evolutionary algorithm, 2-opt, Robustness (evolution), Mathematical optimization, Computer science, Local search (optimization), Evolutionary computation

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Solving traveling salesman problem by using a local evolutionary algorithm — Research Paper | ScholarLens