Filters








413 Hits in 4.9 sec

Property Analysis of Symmetric Travelling Salesman Problem Instances Acquired Through Evolution [chapter]

Jano I. van Hemert
<span title="">2005</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
We show how an evolutionary algorithm can successfully be used to evolve a set of difficult to solve symmetric travelling salesman problem instances for two variants of the Lin-Kernighan algorithm.  ...  problem.  ...  The author is supported through a TALENT-Stipendium awarded by the Netherlands Organization for Scientific Research (NWO).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-31996-2_12">doi:10.1007/978-3-540-31996-2_12</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/hku63qlxhzb2bnq4s37wsn5qf4">fatcat:hku63qlxhzb2bnq4s37wsn5qf4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20061008111248/http://www.vanhemert.co.uk/publications/evocop2005.Property_analysis_of_symmetric_travelling_salesman_problem_instances_acquired_through_evolution.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/6c/a8/6ca862959a8e14adfb7bf265ed3872e8a7acb646.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-31996-2_12"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Property analysis of symmetric travelling salesman problem instances acquired through evolution [article]

J.I. van Hemert
<span title="2005-02-28">2005</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We show how an evolutionary algorithm can successfully be used to evolve a set of difficult to solve symmetric travelling salesman problem instances for two variants of the Lin-Kernighan algorithm.  ...  sman problem.  ...  Acknowledgements The author is supported through a TALENT-Stipendium awarded by the Netherlands Organization for Scientific Research (NWO).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/cs/0502096v1">arXiv:cs/0502096v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/3brcdmwgqffxfhk2xisxo5ynum">fatcat:3brcdmwgqffxfhk2xisxo5ynum</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171008210940/https://core.ac.uk/download/pdf/2420532.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/47/b0/47b0033e3c5856ef7951c746684be2fc8d287d10.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/cs/0502096v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Phase Transition Properties of Clustered Travelling Salesman Problem Instances Generated with Evolutionary Computation [chapter]

Jano I. van Hemert, Neil B. Urquhart
<span title="">2004</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
When varying the number of clusters in these maps and, when solving the Euclidean symmetric travelling salesman person using Chained Lin-Kernighan, we observe a phase transition in the form of an easy-hard-easy  ...  This paper introduces a generator that creates problem instances for the Euclidean symmetric travelling salesman problem. To fit real world problems, we look at maps consisting of clustered nodes.  ...  Acknowledgements This work is supported by DEAL (Distributed Engine for Advanced Logistics) as project EETK01141 under the Dutch EET programme.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-30217-9_16">doi:10.1007/978-3-540-30217-9_16</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/kaar7vqaqnc6nlan4ekl5sxxue">fatcat:kaar7vqaqnc6nlan4ekl5sxxue</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190303154320/http://pdfs.semanticscholar.org/cc07/e67e3cedf761d381f401c8b1e06448eb6bc9.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/cc/07/cc07e67e3cedf761d381f401c8b1e06448eb6bc9.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-30217-9_16"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Expanding Neighborhood GRASP for the Traveling Salesman Problem

Yannis Marinakis, Athanasios Migdalas, Panos M. Pardalos
<span title="">2005</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/jkj6zja2ubhybmybu4bm5sgkwe" style="color: black;">Computational optimization and applications</a> </i> &nbsp;
The algorithm was tested on numerous benchmark problems from TSPLIB. The results were very satisfactory and for the majority of the instances the results were equal to the best known solution.  ...  The proposed GRASP algorithm has two phases: In the first phase the algorithm finds an initial solution of the problem and in the second phase a local search procedure is utilized for the improvement of  ...  The greedy algorithm is a simple one pass procedure for solving the traveling salesman problem.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10589-005-4798-5">doi:10.1007/s10589-005-4798-5</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/6mu5l22yh5ckpfjc5podd75csi">fatcat:6mu5l22yh5ckpfjc5podd75csi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20090205115542/http://yzgrafik.ege.edu.tr:80/~aybars/hcu/p47283467482051g.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/77/5d/775d6b4053430410ac28b2edd1358c05bcaa3391.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10589-005-4798-5"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Million city traveling salesman problem solution by divide and conquer clustering with adaptive resonance neural networks

Samuel A. Mulder, Donald C. Wunsch
<span title="">2003</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/oml24fsyizfuhn3rn5np75ubdi" style="color: black;">Neural Networks</a> </i> &nbsp;
The Traveling Salesman Problem (TSP) is a very hard optimization problem in the field of operations research.  ...  One of the main challenges with this problem is that standard, non-AI heuristic approaches such as the Lin -Kernighan algorithm (LK) and the chained LK variant are currently very effective and in wide  ...  Introduction The Traveling Salesman Problem (TSP) is one of the most studied problems in computer science literature.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0893-6080(03)00130-8">doi:10.1016/s0893-6080(03)00130-8</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/12850040">pmid:12850040</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vn3di3uhnfan3owmioxbpu5pzy">fatcat:vn3di3uhnfan3owmioxbpu5pzy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808192329/http://info.psu.edu.sa/psu/cis/mtounsi/~cs311/paper-18.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/c2/49/c2492ad80ef81b06ae846070c18a7b098b50a644.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0893-6080(03)00130-8"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

A survey of very large-scale neighborhood search techniques

Ravindra K. Ahuja, Özlem Ergun, James B. Orlin, Abraham P. Punnen
<span title="">2002</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/lx7dev2le5anbg6oarljwh7lie" style="color: black;">Discrete Applied Mathematics</a> </i> &nbsp;
Therefore, a practical approach for solving such problems is to employ heuristic (approximation) algorithms that can ÿnd nearly optimal solutions within a reasonable amount of computation time.  ...  Many optimization problems of practical interest are computationally intractable.  ...  We ÿrst consider the traveling salesman problem. The Lin-Kernighan algorithm and its variants are widely believed to be the best heuristics for the TSP.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0166-218x(01)00338-9">doi:10.1016/s0166-218x(01)00338-9</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/q75y577kdbcdffh46dafrb47uq">fatcat:q75y577kdbcdffh46dafrb47uq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20060906081731/http://www.ise.ufl.edu/ahuja/PAPERS/Ahuja-VLSNSurvey-DAM2002.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/b7/5f/b75fcd72453de06911b175a218cd40ceb4058214.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0166-218x(01)00338-9"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Combining simulated annealing with local search heuristics

Olivier C. Martin, Steve W. Otto
<span title="">1996</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/kov3rwzipzf2dmxyohqwfpxrsm" style="color: black;">Annals of Operations Research</a> </i> &nbsp;
For the traveling salesman problem with randomly distributed cities in a square, the procedure improves on 3-opt by 1.6%, and on Lin-Kernighan local search by 1.3%.  ...  For the partitioning of sparse random graphs of average degree equal to 5, the improvement over Kernighan-Lin local search is 8.9%. For both CO problems, we obtain new best heuristics.  ...  This work was supported in part by the grants DOE-FG03-85ER25009, MDA972-88-J-1004, NSF-ECS-8909127, and by a NATO travel grant.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/bf02601639">doi:10.1007/bf02601639</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/mtlpomzmfrehppka5ghzwho5hm">fatcat:mtlpomzmfrehppka5ghzwho5hm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190303091400/http://pdfs.semanticscholar.org/b2e7/8f9654b4d28556c0b2dca338572bf1681bb6.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/b2/e7/b2e78f9654b4d28556c0b2dca338572bf1681bb6.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/bf02601639"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Large-step markov chains for the TSP incorporating local search heuristics

Olivier Martin, Steve W Otto, Edward W Felten
<span title="">1992</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/z7xgofryqjgkxjlwzlky45v4li" style="color: black;">Operations Research Letters</a> </i> &nbsp;
We have tested this on the Euclidean Traveling Salesman Problem, improving 3-opt by over 1.6% and Lin-Kernighan by 1.3%.  ...  I Introduction Given N cities labeled by i = 1, N , separated by distances d i j , the Traveling Salesman Problem (TSP) consists in finding the shortest tour, i.e., the shortest  ...  Acknowledgements We thank David Johnson and Bill Cook for sharing their results with us and for discussions.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0167-6377(92)90028-2">doi:10.1016/0167-6377(92)90028-2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/3gqgdwjkqvhlnir7zgpfbzpm2e">fatcat:3gqgdwjkqvhlnir7zgpfbzpm2e</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170921225202/http://digitalcommons.ohsu.edu/cgi/viewcontent.cgi?article=1014&amp;context=csetech" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/00/d6/00d67155ed2ff06fccfeb47ab59a3dff6825d73b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0167-6377(92)90028-2"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Survey of Methods of Solving TSP along with its Implementation using Dynamic Programming Approach

Chetan Chauhan, Ravindra Gupta, Kshitij Pathak
<span title="2012-08-30">2012</span> <i title="Foundation of Computer Science"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/b637noqf3vhmhjevdfk3h5pdsu" style="color: black;">International Journal of Computer Applications</a> </i> &nbsp;
In this paper, we survey the various methods/techniques available to solve traveling salesman problem and analyze it to make critical evaluation of their time complexities.  ...  An implementation of the traveling salesman problem using dynamic programming is also presented in this paper which generates optimal answer and tested with 25 cities and it executes in reasonable time  ...  This method has been successful in finding optimal solutions of large instances of a closely related problem, the Symmetric Traveling Salesman Problem (STSP).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5120/8189-1550">doi:10.5120/8189-1550</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5neo2o6eabb6rei356fy47q54i">fatcat:5neo2o6eabb6rei356fy47q54i</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170215035840/http://research.ijcaonline.org:80/volume52/number4/pxc3881550.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/3e/e6/3ee6025ad1f76449ffdef0b9db20f4ca4367176a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5120/8189-1550"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Evolving Combinatorial Problem Instances That Are Difficult to Solve

Jano I. van Hemert
<span title="">2006</span> <i title="MIT Press - Journals"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/b7u6fu546fgplmudjzcn5zqqme" style="color: black;">Evolutionary Computation</a> </i> &nbsp;
The technique is applied in three important domains of combinatorial optimisation, binary constraint satisfaction, Boolean satisfiability, and the travelling salesman problem.  ...  Problem instances acquired through this technique are more difficult than ones found in popular benchmarks.  ...  The author expresses his gratitude to Mark Collins for the long discussions on the difficulty of Boolean satisfiability. Last, he thanks the reviewers for their detailed and constructive comments.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1162/evco.2006.14.4.433">doi:10.1162/evco.2006.14.4.433</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/17109606">pmid:17109606</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/togz2qqffrcptjkiwwbke42vl4">fatcat:togz2qqffrcptjkiwwbke42vl4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170829235749/http://www.vanhemert.co.uk/publications/EC-Evolving_combinatorial_problem_instances_that_are_difficult_to_solve.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f8/42/f8428542c3fede902d79c452abd96b1c72921c69.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1162/evco.2006.14.4.433"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> mitpressjournals.org </button> </a>

Tunnelling Crossover Networks for the Asymmetric TSP [chapter]

Nadarajen Veerapen, Gabriela Ochoa, Renato Tinós, Darrell Whitley
<span title="">2016</span> <i title="Springer International Publishing"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
They are compared to networks sampled through the Chained Lin-Kernighan heuristic across 25 instances.  ...  This paper provides the first analysis of the Asymmetric Travelling Salesman Problem using local optima networks.  ...  All data generated during this research are openly available from the Stirling Online Repository for Research Data (hdl.handle.net/11667/75).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-45823-6_93">doi:10.1007/978-3-319-45823-6_93</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5jmeufkp25cuxnbfmtdx2nqivu">fatcat:5jmeufkp25cuxnbfmtdx2nqivu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180722150401/https://dspace.stir.ac.uk/bitstream/1893/24061/1/tunnelling-crossover-networks%20(4).pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/04/38/0438c294326ef532cdc1282a8140d5c41c8d00bc.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-45823-6_93"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Understanding TSP Difficulty by Learning from Evolved Instances [chapter]

Kate Smith-Miles, Jano van Hemert, Xin Yu Lim
<span title="">2010</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
Instances of the Travelling Salesman Problem (TSP) are evolved using an evolutionary algorithm to produce distinct classes of instances that are intentionally easy or hard for certain algorithms.  ...  A comprehensive set of features is used to characterise instances of the TSP, and the impact of these features on difficulty for each algorithm is analysed.  ...  This approach has been demonstrated on the Travelling Salesman Problem, and two variants of the Lin-Kernighan heuristic, to great effect.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-13800-3_29">doi:10.1007/978-3-642-13800-3_29</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/mgowrkd2ibgajfvhrn4bx2hf64">fatcat:mgowrkd2ibgajfvhrn4bx2hf64</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200321095943/https://www.cs.colostate.edu/~howe/cs540/hws/smith-miles-TSP.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/0d/1e/0d1e54e0fe8ee4355098146aea9fcfe268a3762a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-13800-3_29"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Evolutionary algorithm for the k-interconnected multi-depot multi-traveling salesmen problem

Carlos E. Andrade, Flávio K. Miyazawa, Mauricio G.C. Resende
<span title="">2013</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/fdhfwmjdwjbvxo6zc7cdt5hi7q" style="color: black;">Proceeding of the fifteenth annual conference on Genetic and evolutionary computation conference - GECCO &#39;13</a> </i> &nbsp;
We introduce the k-Interconnected Multi-Depot Multi-Traveling Salesmen Problem, a new problem that resembles some network design and location routing problems but carries the inherent difficulty of not  ...  Lin and Kernighan [16] generalize these methods resulting in one of best heuristics for the traveling salesman problem.  ...  This heuristic is known as the Chained Lin-Kernighan procedure. In [14] several refinements of Lin-Kernighan are described.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2463372.2463434">doi:10.1145/2463372.2463434</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/gecco/AndradeMR13.html">dblp:conf/gecco/AndradeMR13</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/54s7o6bct5bxxh3vwsgjg3rc3u">fatcat:54s7o6bct5bxxh3vwsgjg3rc3u</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20130409153313/http://www2.research.att.com/~mgcr/doc/brkga-k-IMDMTSP.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ff/2f/ff2f7012ac4e5cacb96b0a427200ca9a62436f78.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2463372.2463434"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

An effective implementation of the Lin–Kernighan traveling salesman heuristic

Keld Helsgaun
<span title="">2000</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2fqqu5s6wbgk5gcucpt3wqm3gy" style="color: black;">European Journal of Operational Research</a> </i> &nbsp;
This report describes an implementation of the Lin-Kernighan heuristic, one of the most successful methods for generating optimal or nearoptimal solutions for the symmetric traveling salesman problem.  ...  Furthermore, the algorithm has improved the best known solutions for a series of large-scale problems with unknown optima, among these an 85900-city problem.  ...  Introduction The Lin-Kernighan heuristic [1] is generally considered to be one of the most effective methods for generating optimal or near-optimal solutions for the symmetric traveling salesman problem  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0377-2217(99)00284-2">doi:10.1016/s0377-2217(99)00284-2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ank3v3z2one2djqlk3rfsxttly">fatcat:ank3v3z2one2djqlk3rfsxttly</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180722023943/http://www.akira.ruc.dk/%7Ekeld/research/LKH/LKH-2.0/DOC/LKH_REPORT.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/e3/bd/e3bda84a829c75864bbeffe99ba90fa876b5ef07.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0377-2217(99)00284-2"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Optimization by Thermal Cycling

A. Möbius, A. Neklioudov, A. Díaz-Sánchez, K. H. Hoffmann, A. Fachat, M. Schreiber
<span title="1997-12-01">1997</span> <i title="American Physical Society (APS)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/pkmpevvs3bgkhal5dvrmsu5mvq" style="color: black;">Physical Review Letters</a> </i> &nbsp;
We demonstrate for the traveling salesman problem that this algorithm is far more efficient than usual simulated annealing; our implementation can compete concerning speed with recent, very fast genetic  ...  One of the most popular is the traveling salesman problem (TSP): how to find the shortest roundtrip through a given set of cities.  ...  We demonstrate for the traveling salesman problem that this algorithm is far more efficient than usual simulated annealing; our implementation can compete concerning speed with recent, very fast genetic  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1103/physrevlett.79.4297">doi:10.1103/physrevlett.79.4297</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xqkd2fk45vcupkpmwd6yzkkw54">fatcat:xqkd2fk45vcupkpmwd6yzkkw54</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171007202523/https://core.ac.uk/download/pdf/2377181.pdf" title="fulltext PDF download [not primary version]" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <span style="color: #f43e3e;">&#10033;</span> <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/07/ce/07ce52f942739b6c869b4d5799562d1b3c314717.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1103/physrevlett.79.4297"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> aps.org </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 413 results