@inproceedings{6293a4abc859404c9dddeb1cf444856e,
title = "Priority-based genetic local search and its application to the traveling salesman problem",
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.",
author = "Wei, {Jyh Da} and Lee, {D. T.}",
year = "2006",
doi = "10.1007/11903697_54",
language = "英语",
isbn = "3540473319",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "424--432",
booktitle = "Simulated Evolution and Learning - 6th International Conference, SEAL 2006, Proceedings",
address = "德国",
note = "6th International Conference Simulated Evolution and Learning, SEAL 2006 ; Conference date: 15-10-2006 Through 18-10-2006",
}