S. Lin and B. Kernighan. An effective heuristic algorithm for the tsp. Operations Research, 21:498--516, 1971.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....Insert 13 ( TFI TOpt 2 ln n 0:16) 2 Opt 11.3 14.6 (not polynomial; O(n 2 ) for each exchange test) Lin Kernighan 3 26.9 (not polynomial) multiple LK (10) 0.5 268.7 (not polynomial) 1. 2 The Lin Kernighan Algorithm The tour improvement heuristic of Lin and Kernighan was published in [LK71] in 1971 and is still the most efficient TSP algorithm in practice. It is a tour improvement heuristic, that exchanges a variable number of edges and uses nearest neighbor properties for the construction of new subtours. The quality of its solution depends on the start tour used. The standard ....

S. Lin and B. W. Kernighan. An effective heuristic algorithm for the TSP. Operations Research, 21:498--516, 1971.

....areas of supply chain management, airline flight crew scheduling, and scheduling for manufacturing and assembly. For particular combinatorial optimization problems, such as the TSP, many years of research have produced several good general purpose heuristics, such as the Lin Kernighan heuristic (Lin Kernighan, 1971). General purpose heuristics have also been discovered for combinatorial search problems such as boolean satisfiability (GSAT, Selman, Levesque, Mitchell, 1992) For specific application problems, domain specific heuristics can usually be discovered. For example, Zweben, Daun, and Deale (1994) ....

Lin, S., & Kernighan, B. W. (1971). An effective heuristic algorithm for the TSP. Operations Research, 21, 498--516.

.... tour identified by each heuristic, and the second column is the improvement on the solution as obtained by the 2 opt heuristic (the 2 opt heuristic is an exhaustive exploration of all the permutations obtainable by exchanging 2 cities) Comparisons have been carried out also with the LinKernighan [27] improvement of the first column solutions, which has been able to reduce the length of any tour to 420 (or 421, depending on the starting solution provided by the basic algorithms) Note how ant cycle consistently outperformed 2 opt, while its efficacy i.e. the effectiveness it has in finding ....

S.Lin, B.W.Kernighan, "An effective Heuristic Algorithm for the TSP," Operations Research, 21, 498--516, 1973.

....and Gambardella Ant colonies for the traveling salesman problem 8 noncommunicating cases. These results show that communication among ants (mediated by trail) is useful. Although when applied to the symmetric TSP ACS is not competitive with specialized heuristic methods like Lin Kernighan (Lin and Kernighan, 1973), its performance can become very interesting when applied to a slightly different problem; in this article we reported some results on the asymmetric TSP. An extended version of ACS has recently been applied to the quadratic assignment problem (Dorigo, Gambardella and Taillard, 1997) it was able ....

....problem solutions. There are many ways in which ACS can be improved so that the number of tours needed to reach a comparable performance level can diminish, making its application to larger problem instances feasible. First, a local optimization heuristic like 2 opt, 3 opt or Lin Kernighan (Lin and Kernighan, 1973) can be embedded in the ACS algorithm (this is a standard approach to improve efficiency of general purpose algorithms like EC, SA, NNs, as discussed in (Johnson and McGeoch, in press) In the experiments presented in this article, local optimization was just used to improve on the best results ....

Lin, S. and Kernighan, B.W., 1973, An effective Heuristic Algorithm for the TSP. Operations Research, 21, 498--516.

....by exchanging 2 cities) Comparisons have been carried out also with the Lin7 Tests were run on a IBM compatible PC with 80286 Intel processor. 8 In this case distances between towns are integer numbers and are computed according to the standard code proposed in [31] 21 Kernighan [27] improvement of the first column solutions, which has been able to reduce the length of any tour to 420 (or 421, depending on the starting solution provided by the basic algorithms) Note how ant cycle consistently outperformed 2 opt, while its efficacy i.e. the effectiveness it has in finding ....

S.Lin, B.W.Kernighan, "An effective Heuristic Algorithm for the TSP," Operations Research, 21, 498--516, 1973.

.... of the best tour identified by each heuristic, in the second and third columns the improvement on the corresponding first column solution as obtained by the 2 opt (exhaustive exploration of all the permutations obtainable from the basic one by exchanging 2 cities) and the Lin Kernighan heuristics [14], respectively. Note how Ant cycle consistently outperformed 2 opt, while its efficacy i.e. the effectiveness it has in finding very good solutions can be compared with that of Lin Kernighan (even if our algorithm requires a longer computational time) Table II Performance of Ant cycle ....

S.Lin, B.W.Kernighan, "An effective Heuristic Algorithm for the TSP," Operations Research, vol.21, pp.498-516, 1973.

No context found.

S. Lin and B. Kernighan. An effective heuristic algorithm for the tsp. Operations Research, 21:498--516, 1971.

No context found.

S. Lin and B. Kernighan. An effective heuristic algorithm for the tsp. Operations Research, 21:498--516, 1971.

No context found.

S. Lin and B. Kernighan. An effective heuristic algorithm for the tsp. Operations Research, 21:498--516, 1971.

No context found.

S. Lin and B. Kernighan. An effective heuristic algorithm for the tsp. Operations Research, 21:498--516, 1971.

No context found.

S. Lin and B. Kernighan. An effective heuristic algorithm for the tsp. Operations Research, 21:498--516, 1971.

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