Bernd Freisleben, Peter Merz  Home/Search
Context Related
| informatik.unisiegen.de/pu...icec96.ps informatik.unisiegen.de...icec96.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: uc.edu/~mnoschan/sale (more) From: uc.edu/~mnoschan/sale Homepages: B.Freisleben |
Rate this article:      (best)Comment on this article |
Abstract: The combination of local search heuristics and genetic algorithms is a promising approach for finding nearoptimum solutions to the traveling salesman problem (TSP). In this paper, an approach is presented in which local search techniques are used to find local optima in a given TSP search space, and genetic algorithms are used to search the space of local optima in order to find the global optimum. New genetic operators for realizing the proposed approach are described, and the quality and... (Update)
Similar documents based on text: More All
0.3: Fitness Landscapes, Memetic Algorithms and Greedy Operators.. - Merz, Freisleben (1998) (Correct)
0.3: New Genetic Local Search Operators for the Traveling Salesman .. - Freisleben, Merz (1996) (Correct)
0.2: Improved Large-Step Markov Chain Variants for the Symmetric TSP - Inki Hong Andrew (1995) (Correct)
BibTeX entry: (Update)
B. Freisleben and P. Merz, "Genetic local search algorithm for solving symmetric and asymmetric traveling salesman problems," Proceedings of IEEE International Conference on Evolutionary Computation, IEEE-EC 96, 1996, IEEE Press, pp. 616-621. http://citeseer.ist.psu.edu/freisleben96genetic.html More
@inproceedings{ freisleben96genetic,
author = "Bernd Freisleben and Peter Merz",
title = "A Genetic Local Search Algorithm for Solving Symmetric and Asymmetric Traveling Salesman Problems",
booktitle = "International Conference on Evolutionary Computation",
pages = "616-621",
year = "1996",
url = "citeseer.ist.psu.edu/freisleben96genetic.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NP-Co.. (context) - Garey, Johnson - 1979
1051 Optimization and Machine Learning (context) - Goldberg, in - 1989
124 TSPLIB--- A Traveling Salesman Problem Library (context) - Reinelt - 1991
106 The Traveling Salesman Problem: A Guided Tour of Combinatori.. (context) - Lawler, Lenstra et al. - 1985
98 Local Optimization and the Traveling Salesman Problem (context) - Johnson - 1990
84 The Traveling Salesman: Computational Solutions for TSP Appl.. (context) - Reinelt - 1994
79 A New Adaptive Multi-Start Technique for Combinatorial Globa.. (context) - Boese, Muddu - 1994
78 Fast Algorithms for Geometric Traveling Salesman Problems (context) - Bentley - 1992
76 Kluwer Academic Publishers (context) - van Laarhoven, Aarts et al. - 1987
62 Large-Step Markov Chains for the Traveling Salesman Problem - Martin, Otto et al. - 1991
55 Incorporating Problem Specific Knowledge into Genetic Algori.. (context) - Grefenstette - 1987
38 Genetic Local Search Algorithms for the Traveling Salesman P.. (context) - Ulder, Aarts et al. - 1990
28 An Effective Heuristic Algorithm for the Travelling Salesman.. (context) - Lin, Kernighan - 1973
22 Ant-Q: A Reinforcement Learning Approach to the Traveling Sa.. - Gambardella, Dorigo - 1995
19 Cost versus Distance in the Traveling Salesman Problem - Boese - 1995
[Article contains additional citations not shown here]
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.ececs.uc.edu/~mnoschan/sale.html): More
Evolution in Time and Space - The Parallel Genetic Algorithm - Mühlenbein (1991) (Correct)
Martin Zachariasen and Martin Dam - Department Of (Correct)
Combining Simulated Annealing with Local Search Heuristics - Martin, Otto (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC