| Document Date: 2004-11-10 21:04:25
Open Document File Size: 580,33 KBShare Result on Facebook
City Indianapolis / New York / / Company Finding Near-Optimal Solutions / LK TOURS / ORSA Journal / / Country United States / / / Facility University of California Berkeley / library of Applegate et al. / / IndustryTerm local search algorithm / local search techniques / child completion algorithm / local search stalls / heuristic algorithm / genetic algorithm / et al. algorithm / approximation algorithm / local search / genetic algorithms / local search algorithms / local search implementation / local search method / search space / approximate solutions / conventional algorithms / / OperatingSystem Solaris operating system / / Organization University of California / National Science Foundation / DOE office of Scientific Computing / / Person Alistair Sinclair / Dan Bonachea / John Wiley / R. Bixby / V / / / Position traveling salesman / candidate for comparison with AMS / salesman / / Product Lin-Kernighan / / ProgrammingLanguage TSP / C++ / / ProvinceOrState California / New York / / Technology Iterated Lin-Kernighan algorithm / local search algorithm / Lin-Kernighan local search algorithm / COMPARISON TO BOESE ET AL. ALGORITHM / 1.2 LOCAL SEARCH ALGORITHMS / 5 5.1 BEHAVIOR OF THE ALGORITHM / 2-opt-based Boese et al. algorithm / child completion algorithm / Boese et al. algorithm / local search algorithms / 94720 smcpeak@acm.org GENETIC ALGORITHMS / 3.3 THE FITNESS FUNCTION The AMS algorithm / operating system / TSP approximation algorithm / described algorithm / TSP algorithms / Lin-Kernighan algorithm / AMS algorithm / / URL http /
SocialTag |
An Improved Adaptive Multi-Start Approach to Finding Near-Optimal Solutions to the Euclidean TSP Dan Bonachea Computer Science Dept. University of California