rar

Traveling Salesman Problem A salesman has to go to several cities to sell goods.

  • 2014-03-05
  • 39.55KB
  • Points it Requires : 2

Traveling Salesman Problem A salesman has to go to several cities to sell goods. The distances (or travel expenses) between the cities are known. He has to choose a route that starts from his base, passes through each city, and finally returns to his base, so that the total distance (or travel expenses) is minimized. For example: Given 4 cities {1, 2, 3, 4} and the distances between them are 1, 3, 2, 4, 1, and the shortest distance is 25

unfold

You Might Like

Uploader
jasionla
 

Recommended ContentMore

Popular Components

Just Take a LookMore

EEWorld
subscription
account

EEWorld
service
account

Automotive
development
circle

About Us Customer Service Contact Information Datasheet Sitemap LatestNews


Room 1530, 15th Floor, Building B, No.18 Zhongguancun Street, Haidian District, Beijing, Postal Code: 100190 China Telephone: 008610 8235 0740

Copyright © 2005-2024 EEWORLD.com.cn, Inc. All rights reserved 京ICP证060456号 京ICP备10001474号-1 电信业务审批[2006]字第258号函 京公网安备 11010802033920号
×