Skip to search formSkip to main contentSkip to account menu

Lin–Kernighan heuristic

Known as: Lin-Kernighan, Lin–Kernighan algorithm, Lin-Kernighan heuristic 
In combinatorial optimization, Lin–Kernighan is one of the best heuristics for solving the symmetric travelling salesman problem. Briefly, it… 
Wikipedia (opens in a new tab)

Related topics

Related topics

6 relations
2-opt3-optKernighan–Lin algorithmLocal search (optimization)

Broader (2)

Combinatorial optimizationTravelling salesman problem

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
A Multi-objective Version of the Lin-Kernighan Heuristic for the Traveling Salesman Problem
The Lin and Kernighan’s algorithm for the single objective Traveling Salesman Problem (TSP) is one of the most efficient… 
2017
2017
O problema do caixeiro viajante com passageiros
Este trabalho apresenta um modelo de compartilhamento de assentos veicular de modo a reduzir os custos de viagem de motoristas e… 
2014
2014
Comparing a hybrid branch and bound algorithm with evolutionary computation methods, local search and their hybrids on the TSP
Benchmarking is one of the most important ways to investigate the performance of metaheuristic optimization algorithms. Yet, most… 
2011
2011
Lin Shu and"May Fourth"Cultural
As the stick to classical position and the"May Fourth"New Cultural Movement clever design,LinShu and"May Fourth" New Culture… 
2009
2009
The Lin-Kernighan Algorithm Driven by Chaotic Neurodynamics for Large Scale Traveling Salesman Problems
The traveling salesman problem (TSP) is one of the typical ${\cal NP}$-hard problems. Then, it is inevitable to develop an… 
2004
2004
Phase Transition Properties of Clustered Travelling Salesman Problem Instances Generated with Evolutionary Computation
This paper introduces a generator that creates problem instances for the Euclidean symmetric travelling salesman problem. To fit… 
2004
2004
Współczynniki bezpieczeństwa lin wyciągowych nośnych
2000
2000
An Improved Adaptive Multi-Start Approach to Finding Near-Optimal Solutions to the Euclidean TSP
We present an "adaptive multi-start" genetic algorithm for the Euclidean traveling salesman problem that uses a population of… 
1994
1994
Distributed Mapping of SPMD Programs with a Generalized Kernighan-Lin Heuristic
Mapping a parallel algorithm onto a parallel computer is known to be NP-hard. In this paper we propose a parallel mapping… 
Highly Cited
1993
Highly Cited
1993
Variable-Depth Search for the Single-Vehicle Pickup and Delivery Problem with Time Windows
We consider a single depot and a set of customers with known demands, each of which must be picked up and delivered at specified… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)