An Effective Implementation of the Lin-Kernighan Traveling Salesman Heuristic Keld Helsgaun E-mail: Department of Computer Science Roskilde University

Source URL: webhotel4.ruc.dk

Network Analysis and Modeling CSCI 5352, Fall 2013 Prof. Aaron Clauset Problem Set 6, duepts total) Recall that the Kernighan-Lin heuristic begins with a random partition of the

Source URL: tuvalu.santafe.edu

Revisiting Elitism in Ant Colony Optimization Tony White, Simon Kaegi, Terri Oda School of Computer Science, Carleton University 1125 Colonel By Drive, Ottawa, Ontario, Canada K1S 5B6 , skaegi@sym

Source URL: terri.zone12.com

• Theoretical computer science
• Ant colony optimization algorithms
• Stochastic optimization
• Travelling salesman problem
• Ant
• Swarm behaviour
• Mathematical optimization
• Algorithm
• Lin–Kernighan heuristic
• Mathematics
• Applied mathematics
• Operations research

Memetic Algorithms for the Traveling Salesman Problem

Source URL: www.complex-systems.com

• Travelling salesman problem
• Mathematical optimization
• Operations research
• Cybernetics
• Genetic algorithms
• Memetic algorithm
• Lin–Kernighan heuristic
• Greedy algorithm
• Christofides algorithm
• Mathematics
• Applied mathematics
• Theoretical computer science

An Improved Adaptive Multi-Start Approach to Finding Near-Optimal Solutions to the Euclidean TSP Dan Bonachea Computer Science Dept. University of California

Source URL: www.cs.berkeley.edu

• Travelling salesman problem
• Operations research
• Mathematical optimization
• Combinatorial optimization
• Computational complexity theory
• Lin–Kernighan heuristic
• Genetic algorithm
• Simulated annealing
• Search algorithm
• Mathematics
• Applied mathematics
• Theoretical computer science

PARALLEL GENETIC ALGORITHM IN COMBINATORIAL OPTIMIZATION Heinz Muhlenbein GMD Schloss Birlinghoven D-5205 Sankt Augustin 1

Source URL: muehlenbein.org

• Genetic algorithms
• Operations research
• Search algorithms
• Mathematical optimization
• Cybernetics
• Travelling salesman problem
• Evolutionary algorithm
• Lin–Kernighan heuristic
• Genetic operator
• Mathematics
• Applied mathematics
• Theoretical computer science

TSP – Infrastructure for the Traveling Salesperson Problem Michael Hahsler Kurt Hornik

Source URL: cran.r-project.org

• Travelling salesman problem
• NP-complete problems
• Operations research
• Combinatorial optimization
• Approximation algorithms
• Nearest neighbour algorithm
• Concorde TSP Solver
• Lin–Kernighan heuristic
• Heuristic function
• Theoretical computer science
• Mathematics
• Applied mathematics

Package ‘TSP’ September 6, 2013 Type Package Title Traveling Salesperson Problem (TSP) Version[removed]Date[removed]

Source URL: cran.r-project.org

• Applied mathematics
• NP-complete problems
• Operations research
• Combinatorial optimization
• Approximation algorithms
• Concorde TSP Solver
• Nearest neighbour algorithm
• Lin–Kernighan heuristic
• Concorde
• Theoretical computer science
• Mathematics
• Travelling salesman problem

PDF Document

Source URL: www.akira.ruc.dk

• Combinatorial optimization
• Travelling salesman problem
• Computational complexity theory
• Operations research
• Lin–Kernighan heuristic
• Algorithm
• Optimization problem
• Branch and bound
• NP-complete
• Theoretical computer science
• Mathematics
• Applied mathematics

PDF Document

Source URL: pellefantus.googlepages.com

• Applied mathematics
• Mathematical optimization
• Combinatorial optimization
• Operations research
• Heuristics
• Lin–Kernighan heuristic
• 3-opt
• 2-opt
• Heuristic function
• Mathematics
• Travelling salesman problem
• Theoretical computer science