文件名称:LKHTSP
介绍说明－－下载内容均来自于网络，请自行研究使用
由Helsgaun改进的Lin-Kernighan局部启发搜索算法（LKH）求解大规模TSP问题，使用Java语言实现，具有强大的求解TSP性能。-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.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
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
......\...\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