Location:
Search - travel
Search list
Description: 旅行商问题（动态规化）
某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。
例如：给定4个城市{1，2，3，4}及其各城市之间的路程
-traveling salesman problem (dynamic regulation of) a salesman to a number of cities to sell commodities, known the distance between cities (or travel). He selected from a resident, after each city again, the last resident to return to the line, making the total distance (or travel) is the smallest. For example : given four cities (1,2,3,4) and the distance between cities
Platform: |
Size: 60163 |
Author: 586 |
Hits:
Description: 旅行商问题动态规划算法的应用
某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。
-TSP dynamic programming algorithm of a salesman to a number of cities to sell commodities, known the distance between cities (or travel). He selected from a resident, after each city again, the last resident to return to the line, making the total distance (or travel) is the smallest.
Platform: |
Size: 61863 |
Author: 586 |
Hits:
Description: 旅行商问题
某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。
例如：给定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 between the city (or travel). He selected from a resident, after each city again, the last resident to return to the line, making the total distance (or travel) is the smallest. For example : given four cities (1,2,3,4) and the distance between the city optimal route is 1,3,2,4, 1, the shortest distance is 25
Platform: |
Size: 40399 |
Author: 吴博 |
Hits:
Description: Finds 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)
Platform: |
Size: 3210 |
Author: 阳关 |
Hits:
Description: Recent peer-to-peer (P2P) systems are characterized by decentralized control, large scale and extreme dynamism of their operating environment. As such, they can be seen as instances of complex adaptive systems (CAS) typically found in biological and social sciences. Anthill is a framework to support the design, implementation and evaluation of P2P applications based on ideas such as multi-agent and evolutionary programming borrowed from CAS. An Anthill system consists of a dynamic network of peer nodes societies of adaptive agents travel through this network, interacting with nodes and cooperating with other agents in order to solve complex problems. Anthill can be used to construct different classes of P2P services that exhibit resilience, adaptation and self-organization properties.
Platform: |
Size: 5886840 |
Author: ada |
Hits:
Description: Traveling Salesman Problem (TSP) has been an interesting problem for a long
time in classical optimization techniques which are based on linear and nonlinear
programming. TSP can be described as follows: Given a number of cities to visit
and their distances from all other cities know, an optimal travel route has to be
found so that each city is visited one and only once with the least possible distance
traveled. This is a simple problem with handful of cities but becomes complicated
as the number increases.
Platform: |
Size: 446727 |
Author: yangdi |
Hits:
Description: 酒点 旅游线路 导游租车系统 应用ASP开发
Platform: |
Size: 951958 |
Author: yaoho |
Hits:
Description: Scotia Airlines is a new budget airline operating between Glasgow Airport and the Western
Isles. It operates two 24-seater light passenger aircraft and requires a flight booking system.
Because Scotia offers low cost air travel, there is a need to treat each flight as single cost centre
and to be able to ascertain, at any moment, the amount of the cash taken for that flight.
Reservations and bookings cannot be made until the flight details have been finalised (flight
number, departure and arrival airports). A seat on a flight is considered booked when payment
as been received for it. When a reservation is confirmed (changed to booked), the passenger
name is checked against the original reservation.
A flight can be in any of the following states:
Available for bookings
Checking in
Boarding
Closed
Platform: |
Size: 227827 |
Author: gary |
Hits:
Description: 一个用ＰＯＳＴ方式发贴的工具源码，它主要争对http://diy.travel.sohu.com/train/search_result.php页面进行测试发贴的搜索火车票
Platform: |
Size: 4210898 |
Author: 无名 |
Hits:
Description: 记录出行路线，并提供一个电子罗盘，指示行进方向，运行在PocketPC环境下-record travel routes, and to provide an electronic compass, the direction of the road instructions, the PocketPC operating environment
Platform: |
Size: 257504 |
Author: 王小振 |
Hits:
Description: 旅行售货员问题的解是一棵排列树．在给出的图中寻找一条费用最优的回路-travel salesman problem is the solution with a tree. The plan is to find an optimal cost of the Loop
Platform: |
Size: 1946 |
Author: 姚翊 |
Hits:
Description: 数据结构 之骑士周游算法-data structure Cavaliers travel Algorithm
Platform: |
Size: 6076 |
Author: 受冻 |
Hits:
Description: 旅行家问题 一个旅行家想驾驶汽车以最少的费yi 用从一个城市到另一个城市（假设出发时油箱是空的）。给定两个城市之间的距离为D1、汽车油箱的容量为C(以升为单位），每升汽油能行驶的距离为 D2，出发点每升汽油价格P和沿途油站数N（N可以为零），油站i离出发点距离Di,每升汽油价格Pi(i=1,2...N)。计算结果四舍五入至小数点后两位。 如果无法到达目的地，则输出“No Solution\"。-issue a travel home to travel home to drive a car with the minimum of cost yi used from one city to another city (assuming starting at the fuel tank was empty). Given the two cities for the distance between D1, car fuel tank capacity of the C (in liters) per liter petrol traveling distance to the D2, the starting point liter gasoline prices P and several petrol stations along the N (N can be zero), PFS i distance from the starting point Di per liter Steam oil prices Pi (i = 1,2 ... N). Calculation results rounded to two decimal places. If unable to reach their destination, the export of "No Solution."
Platform: |
Size: 881 |
Author: 信仰 |
Hits:
Description: 旅行最佳路线的确定-travel to determine the best route
Platform: |
Size: 136420 |
Author: 中国人 |
Hits:
Description: 温克旅行社管理系统.rar-Wen said travel agent management systems. Rar
Platform: |
Size: 5161389 |
Author: 朱涛 |
Hits:
Description: 一个小型的旅行社管理系统-a small travel agency management system
Platform: |
Size: 1390991 |
Author: 含笑 |
Hits:
Description: 遗传算法和“货郎担” 问题:
\"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.\"
Platform: |
Size: 284142 |
Author: s050403054 |
Hits:
Description: 用经典算法--模拟退火算法求解经典问题旅行商（Travel Sales Problem）问题。
Platform: |
Size: 6973 |
Author: 张清国 |
Hits:
Description: 旅行社管理信息系统主要实现旅游路线、景点、交通工具等的查询、修改和删除功能
Platform: |
Size: 2317136 |
Author: saral |
Hits:
Description: 数据库实验代码。实现一个旅行管理数据库的应用软件。
Platform: |
Size: 4122159 |
Author: sxz |
Hits:
«
1
2
...
5
6
7
8
9
1011
12
13
14
15
...
50
»