虫虫首页|资源下载|资源专辑|精品软件
登录|注册

您现在的位置是:虫虫下载站 > 资源下载 > 数值算法/人工智能 > 遗传算法和“货郎担” 问题: "The traveling salesman problem, or TSP for short, is this: given a finite number of

遗传算法和“货郎担” 问题: "The traveling salesman problem, or TSP for short, is this: given a finite number of

  • 资源大小:278 K
  • 上传时间: 2013-12-24
  • 上传用户:xiaomaolv1017
  • 资源积分:2 下载积分
  • 标      签: traveling salesman problem finite

资 源 简 介

遗传算法和“货郎担” 问题: "The traveling salesman problem, or TSP for short, is this: given a finite number of cities along with the cost of travel between each pair of them, find the cheapest way of visiting all the cities and returning to your starting point."

相 关 资 源

您 可 能 感 兴 趣 的