Stefan Hougardy and Xianghui Zhong have provided hard to solve instances of the Euclidean traveling salesman problem. LKH's performance on these instances is reported here. The lengths of the current best tours are tabulated here.ĭavid Soler has provided 126 asymmetric instances with known optima. LKH currently holds the record for all instances with unknown optima. Their sizes range from 1,000 to 10,000,000 cities. The DIMACS TSP Challenge (2000) provided many benchmark instances. Furthermore, the algorithm has improved the best known solutions for a series of large-scale instances with unknown optima, among these a 1,904,711-city instance ( World TSP). LKH has produced optimal solutions for all solved problems we have been able to obtain including a 109399-city instance (at the time of writing, the largest nontrivial instance solved to optimality). Even though the algorithm is approximate, optimal solutions are produced with an impressively high frequency. LKH is an effective implementation of the Lin-Kernighan heuristic for solving the traveling salesman problem.Ĭomputational experiments have shown that LKH is highly effective. Next depending on the circumstances select one of the following:Ī: Select to install the driver from CD-ROMī: Select to install from the folder where the software was installed on your PC A: Installing the driver from CD-ROMĬlick the button and find the CD-ROM drive then select the folder entitled. Specify the location of the device driver. After the "Update Driver Software" window has appeared, click "Browse my computer for driver software". * If the driver has been installed properly will appear in the device manager as shown in Step 7 below. If the message still does not appear, it is possible that something is wrong with the USB terminal on the PC or on the device, or a broken wire in the USB cable. * If that message does not appear, please check to make sure there are batteries in the connected device or that the device's power is ON.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |