The shortest Chinese traveling salesman circuit

Source: Internet
Author: User

The shortest Chinese traveling salesman circuit

 Using the method of calculating multi-node Hamiltonian ring, we calculate the traveling salesman circuit of China which is of interest to us.1Beijing 4Shijiazhuang 5Taiyuan 6Hohhot  24Yinchuan   25Lanzhou  26Xining 27Urumqi  31Lhasa   28Chengdu  30Kunming   29Guizhou 22Nanning +Haikou   20Guangzhou    19Changsha    14Nanchang   15Fuzhou    16Taipei    13Hangzhou    2Shanghai    11Nanjing   12Hefei    18Wuhan    23Xian   17Zhengzhou    10Jinan   3Tianjin    7Shenyang 8Changchun    9Harbin1Beijing. GetOptimal results of traveling salesman loop in China14800, should be so far the shortest China traveling salesman circuit, hope will be able to use the genetic algorithm of friends pointing, see the genetic algorithm to get the shortest circuit is how much?

The shortest Chinese traveling salesman circuit

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.