Priority-Based genetic local search and its application to the traveling salesman problem

Authors:
Jyh-Da Wei;D. T. Lee
Affiliations:
Institute of Information Science, Academia Sinica, Taipei, Taiwan;Institute of Information Science, Academia Sinica, Taipei, Taiwan
Venue:
SEAL'06 Proceedings of the 6th international conference on Simulated Evolution And Learning
Year:
2006

Citing 3
Cited 0

A genetic local search algorithm for random binary constraint satisfaction problems

SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 1
Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators

Artificial Intelligence Review
A New Genetic Algorithm with Local Search Method for Degree-Constrained Minimum Spanning Tree Problem

ICCIMA '03 Proceedings of the 5th International Conference on Computational Intelligence and Multimedia Applications

Quantified Score

Hi-index	0.01

Visualization

Abstract

Genetic algorithms and genetic local search are population based general-purpose search algorithms. Nevertheless, most of combinatorial optimization problems have critical requirements in their definition and are usually not easy to solve due to the difficulty in gene encoding. The traveling salesman problem is an example that requires each node to be visited exactly once. In this paper, we propose a genetic local search method with priority-based encoding. This method retains generality in applications, supports schema analysis during searching process, and is verified to gain remarkable search results for the traveling salesman problem.