Welcome![Sign In][Sign Up]
Location:
Downloads SourceCode Mathimatics-Numerical algorithms Algorithm
Title: LKHTSP Download
 Description: Helsgaun improved the Lin-Kernighan local search algorithm (LKH) for solving large scale TSP problem, use the Java language, solving the TSP with a strong performance.
 Downloaders recently: [More information of uploader mls237new]
 To Search: LKH helsgaun delaunay
  • [2opt] - the local optimization algorithm
  • [3-OptimalBinaryTree] - most binary search tree formation proces
  • [modifidedGAforTSP] - Improved GA to solve TSP problems, the i
  • [gpcpp4] - Genetic Programming C source code, which
  • [Tsp] - a tsp problem for solving tsp with rando
  • [BABA] - TSP Soulution using branch and bound
  • [MakeDensityBasedClusterer.java.tar] - Based on the local search ability, the c
  • [tree] - 构造N个城市连接的最少生成树.假设有n个城市,要实现n个城市之间连接的最小生成树
  • [LHK_Algorithm] - LKH Algorithm, the fastest algorithm for
  • [local_search] - The use of local search algorithm travel
File list (Check if you may need any files):
LKHTSP\DOC\LKH-2.0_PARAMETERS.pdf
......\...\LKH-2.0_USER_GUIDE.pdf
......\...\LKH_REPORT.pdf
......\...\TSPLIB_DOC.pdf
......\SRC\Activate.c
......\...\AddCandidate.c
......\...\AddExtraCandidates.c
......\...\AddTourCandidates.c
......\...\AdjustCandidateSet.c
......\...\AllocateStructures.c
......\...\Ascent.c
......\...\Best2OptMove.c
......\...\Best3OptMove.c
......\...\Best4OptMove.c
......\...\Best5OptMove.c
......\...\BestKOptMove.c
......\...\Between.c
......\...\Between_SL.c
......\...\Between_SSL.c
......\...\BridgeGain.c
......\...\BuildKDTree.c
......\...\C.c
......\...\CandidateReport.c
......\...\ChooseInitialTour.c
......\...\Connect.c
......\...\CreateCandidateSet.c
......\...\CreateDelaunayCandidateSet.c
......\...\CreateQuadrantCandidateSet.c
......\...\Delaunay.c
......\...\Distance.c
......\...\Distance_SPECIAL.c
......\...\eprintf.c
......\...\Excludable.c
......\...\Exclude.c
......\...\FindTour.c
......\...\Flip.c
......\...\Flip_SL.c
......\...\Flip_SSL.c
......\...\Forbidden.c
......\...\FreeStructures.c
......\...\fscanint.c
......\...\Gain23.c
......\...\GenerateCandidates.c
......\...\GeoConversion.c
......\...\GetTime.c
......\...\GreedyTour.c
......\...\Hashing.c
......\...\Heap.c
......\...\INCLUDE\Delaunay.h
......\...\.......\GainType.h
......\...\.......\GeoConversion.h
......\...\.......\Hashing.h
......\...\.......\Heap.h
......\...\.......\LKH.h
......\...\.......\Segment.h
......\...\.......\Sequence.h
......\...\IsCandidate.c
......\...\IsCommonEdge.c
......\...\KSwapKick.c
......\...\LinKernighan.c
......\...\LKHmain.c
......\...\Make2OptMove.c
......\...\Make3OptMove.c
......\...\Make4OptMove.c
......\...\Make5OptMove.c
......\...\Makefile
......\...\MakeKOptMove.c
......\...\malloc.c
......\...\MergeBetterTourWithBestTour.c
......\...\MergeWithTour.c
......\...\Minimum1TreeCost.c
......\...\MinimumSpanningTree.c
......\...\NormalizeNodeList.c
......\...\NormalizeSegmentList.c
......\...\OrderCandidateSet.c
......\...\PatchCycles.c
......\...\printff.c
......\...\PrintParameters.c
......\...\qsort.c
......\...\Random.c
......\...\ReadCandidates.c
......\...\ReadLine.c
......\...\ReadParameters.c
......\...\ReadPenalties.c
......\...\ReadProblem.c
......\...\RecordBestTour.c
......\...\RecordBetterTour.c
......\...\RemoveFirstActive.c
......\...\ResetCandidateSet.c
......\...\RestoreTour.c
......\...\SegmentSize.c
......\...\Sequence.c
......\...\SFCTour.c
......\...\SolveDelaunaySubproblems.c
......\...\SolveKarpSubproblems.c
......\...\SolveKMeansSubproblems.c
......\...\SolveRoheSubproblems.c
......\...\SolveSFCSubproblems.c
......\...\SolveSubproblem.c
......\...\SolveSubproblemBorderProblems.c
    

CodeBus www.codebus.net