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

您现在的位置是:虫虫下载站 > 资源下载 > 人工智能/神经网络 > this m file can Find a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up

this m file can Find a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up

  • 资源大小:5 K
  • 上传时间: 2013-12-22
  • 上传用户:zhoulovely
  • 资源积分:2 下载积分
  • 标      签: Traveling Salesman solution Problem

资 源 简 介

this m file can Find a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once) Notes: 1. Input error checking included 2. Inputs can be specified in any order, so long as the parameter pairs are specified as a parameter , value

相 关 资 源

您 可 能 感 兴 趣 的