搜索资源列表
exercices
- 这是用prolog写的几个程序：程序１是一个旅行社关系系统，程序２是一个家族关系系统，程序３是一个成绩管理系统-This is prolog written several programs : a procedure is a travel agency relations systems, procedures 2 is a family relationship systems, procedures 3 is a performance management system
货郎担分枝限界图形演示
- 货郎担分枝限界图形演示 问题描述:某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。-traveling salesman Branch and Bound graphic demonstration Problem descr iption : A salesman to a number of cities to sell commodities, the known distance
Graph_BFS
- 这个是图的广度周游的源代码。解压即可。算法比较简洁，复杂度较小。-the breadth of the plan is to travel around the source code. Decompression can be. Algorithm comparison simple, less complex.
mathmodel2
- 1.1 背包问题 有一个徒步旅行者，已知他能承受的旅行背包的重量不超过a（kg）。设有n种物品可供他选择装入背包，这n种物品分别编号为1，2，…，n。其中第i种物品每件的重量为ai（kg），其使用价值（指一件第i种物品对旅行者来说所带来的好处的一种数量指标）为ci（i＝1，2，…，n）。问这位旅行者应如何选择携带这n种物品的件数，使得总价值最大？ -1.1 knapsack problem is a hikers. he is known to travel to withstand t
TSPinmatlab
- 用遗传算法解决城市的访问次序，可使其 旅行路线的总长度最短 可从该程序借鉴到其他应用 -using genetic algorithms to solve the city for the visit, travel routes can make the total length of the shortest can draw from the procedures of other applications
TSPprogrammatlab
- 已知n个城市之间的相互距离，现有一个推销员必须遍访这n个城市，并且每个城市只能访问一次，最后又必须返回出发城市。如何安排他对这些城市的访问次序，可使其旅行路线的总长度最短？-known cities between the distance from the existing one must salesman n visited this city, every city and can only be visited once, finally starting to return to t
JSPzzj
- 已知n个城市之间的相互距离，现有一个推销员必须遍访这n个城市，并且每个城市 只能访问一次，最后又必须返回出发城市。如何安排他对这些城市的访问次序，可使其 旅行路线的总长度最短？ -known cities between the distance from the existing one must salesman n visited this city, every city and can only be visited once, finally starting to r
TSPSourceCode
- C#语言编写的基于遗传算法的旅行销售员问题的源程序-C# language based on the genetic algorithm travel to sell the source
TravelingSalesmanProblemwithGeneticAlgorithm
- 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 checki
TSPproblem
- 遗传算法解决TSP问题 已知n个城市之间的相互距离，现有一个推销员必须遍访这n个城市，并且每个城市只能访问一次，最后又必须返回出发城市。如何安排他对这些城市的访问次序，可使其旅行路线的总长度最短？-genetic algorithm known TSP n cities between the distance, must present a salesman traveled this n cities, and each city can only be visited once, La
TSP(travel)
- 该程序是模拟退火算法应用中旅行商问题得MATLAB实现-that the procedure was simulated annealing applications traveling salesman problem in MATLAB
luxingjia
- 旅行家问题,关于旅行家问题的一小段代码。值得大家学习和参考-travelers, travel home on a small portion of the code. Worth learning and reference
lvxingshang
- 算法分析问题：用VC编写的旅行商程序，可以实现旅行商最短路径旅行个城市的功能-algorithm analysis : VC procedures for the preparation of the traveling salesman, TSP can achieve the shortest path of travel to the cities function
TSP
- 旅行商问题： 某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。-traveling salesman problem : A salesman to a number of cities to sell commodities, known the distance between cities (or travel). He selected from a resident, after
expr2
- 旅行商问题 某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。 例如：给定4个城市{1，2，3，4}及其各城市之间的路程 最优路线是1,3,2,4,1， 其最短路程是25-a salesman, traveling salesman problem, a number of cities to sell commodities, the known distance bet
Travel
- 关于人工智能作业---推销商旅行问题，用C编写，简单易懂-On the artificial intelligence operation--- travel salesman problem, using C to prepare, easy-to-read
travel
- 通过学习奥赛培训课程，利用回溯加递归的编程技巧完成的骑士旅行问题-Training courses through learning Orsay, plus use of recursive programming skills back to complete the Knights travel problems
Urban-travel-issues
- 城市出行问题。某城市有若干中心区，在一些中心区之间存在道路相连。这些道路中的一些已开通了公交线路。需要在中心区间旅行的人们有如下几种交通方式可供选择： 1.骑自行车，平均速度15km/h。 2.公交与步行结合，不同道路的公交车平均速度不同，标注于下图的B 中，B=0 代表这 条道路尚未开通公交线路，步行的平均速度为5km/h。允许搭乘公交与步行两种方式自由进 行组合，切换的次数不限。 3.自驾车，不同道路的平均速度不同。 现在你要从区域A 出发要区域B，由于时间紧迫，请提
establish-and-travel
- 二叉树的建立（固定数字）及用前序遍历法周游并输出。-The establishment and use of binary tree traversal method before travel and output.
graph-travel
- 图的广度和深度优先遍历算法的实现，功能为图的遍历算法-graph travel