搜索资源列表
quanguojiaotongzixun
- 用最短路径解决. 提供三种最优决策:最快到达,最少费用,最少中转站.-solution with the shortest path. For three optimal decision : fastest to reach at least cost, at least transfer stations.
quanguoTraffic
- 全国旅游交通图模拟.有三种方式:火车,船,飞机,选择一个路途最近,费用最少的交通旅游方案.-national tourism map traffic simulation. There are three ways : trains, boats, aircraft, choose a road recently, The least-cost traffic tourism program.
lujing
- 公车最短路径算法具体的算法： 实际上乘客不一定要找最短，里面还涉及到换乘次数最少，费用最少等问题 因此，边向量的权值要分多种情况考虑，所以如果真的要开发实用的系统 应该给出多种最佳选择。
1
- 公交车线路选择 换乘最小 站站查询等功能 可增加权值 增加查询费用最少的功能
-血液需求系统
- 此系统用EXEL开发，摘要如下，对于血液供需模型，我们对某地区进行了系统模拟，为了使医疗中心花费最少，我们首先对三种情况进行分析，就是不举办活动，每30，60天举办活动，得出结果，每30天举办一次活动，费用最少。最后，我们对模型评价与推广，还有个人的心得体会。-system used EXEL development, summarized below, the blood supply model, we have certain areas of the system simulation,
subwaysystem
- 这是一个用java图形界面编写的地铁换乘查询系统，用户可在装载地图后，对北京、上海地区的地铁线路按照时间最短、费用最少的方式进行查询，界面美观，功能完善。-This is a graphical interface written using java subway transfer query system, users can load the map, including Beijing, Shanghai, subway lines by the shortest and least-c
sum
- n件工作分给n各人完成，将第i个工作分配给第j个人完成需要费用cij，是设计一算法，为每个人分配不用的工作，费用最少-n to n pieces of work hours each to complete, will for the first i jobs j assigned to the first individual to complete required cost cij, is to design an algorithm, for each person assigned d
cmd
- 最优路径查询，包括花费时间最少路径查询、费用最少路径查询-Optimal path query, including spending time at least path query, the least cost path query
ETS
- 有一推销员，欲到n(n<=10) 个城市推销产品。为了节省旅行费用，在出发前他查清了任意两个城市间的旅行费用，想找到一条旅行路线，仅经过每个城市一次，且使旅行费用最少。本问题已知城市n，和n*n的表达任意两个城市间费用的矩阵。试求最短路径及其费用；-A salesman, wants to n (n < = 10) cities to promote their products. To save travel costs, find out before his departure,
railroad
- 在n个城市之间修建高速公路，使任意两个城市之间都有城市相连，且费用最少-Build roads between some cities, make sure that you can get anywhere from everywhere,besides, the cost is least
1-ETS
- 问题陈述：有一推销员，欲到n(n<=10)个城市推销产品。为了节省旅行费用，在出发前他查清了任意两个城市间的旅行费用，想找到一条旅行路线，仅经过每个城市一次，且使旅行费用最少。-Problem Statement: a salesman, n (n < = 10) cities want to sell products. Before departure in order to save travel expenses, he find out the cost of travel
Some-ergodic-map
- 已知n个城市，任意两个城市之间存在最多三种交通工具；每种交通方式产生的费用不一定相同，时间不同： 1算法实现周游这n个城市并且费用最少（写程序，其中n<=10） 2、在规定的时间里，同时考虑每种交通方式花费时间；在规定时间内，周游这n个城市且费用最少-Known n city, city exists between any two up to three vehicles each kind of transport charges are not necessarily th
matlab实现匈牙利算法
- 在实际工作中经常会遇到分配问题，n个人被分配去做n件工作，每个人只做一件工作，每件工作只有一个人做，由于每个人的特长不同，效率也是不同的。匈牙利算法就是解决任务分配问题，使完成的任务的总效率最高（时间最短，费用最少等）。
zuixiaofeiyongliu
- 最小费用流问题用于求解，图论中两地区运输费用最少的问题，本程序通过MATLAB解决这一问题-For solving the minimum cost flow problem in graph theory two least-cost regional transportation issues, the procedure to solve this problem through MATLAB
EST2
- 有一推销员，欲到n(n<=10)个城市推销产品。为了节省旅行费用，在出发前他查清了任意两个城市间的旅行费用，想找到一条旅行路线，仅经过每个城市一次，且使旅行费用最少。-There are a salesman, I want to n (n < = 10) cities to promote their products. To save travel costs, identify him before departure arbitrary travel expenses bet
salesman
- 有一推销员，欲到n(n<=10)个城市推销产品。为了节省旅行费用，在出发前他查清了任意两个城市间的旅行费用，想找到一条旅行路线，仅经过每个城市一次，且使旅行费用最少。本问题已知城市n，和n*n的表达任意两个城市间费用的矩阵。试求最短路径及其费用；-There are a salesman, I want to n (n < = 10) cities to promote their products. To save travel costs, before his departure
jgctgu
- 流水线车间的零件加工排序问题，以达到最优的加工顺序，使加工时间最短或零件后期维护费用最少-Plant parts processing pipeline scheduling problem, in order to achieve optimal machining sequence, so that the processing time of the shortest or least parts later maintenance costs
Untitled5
- 考虑到通信网络结点的可靠性，若要求任意一个结点出现故障时，其它结点间仍然能够保持通信畅通的可能性都达到90 ，请建立问题的数学模型，设计求解算法，并给出使总铺设费用最少的铺设方案-Considering the reliability of communication network nodes, if you want any one node fails, you can still keep communication flowing between the possibility of
the-travel
- 有一推销员，欲到n(n<=10)个城市推销产品。为了节省旅行费用，在出发前他查清了任意两个城市间的旅行费用，想找到一条旅行路线，仅经过每个城市一次，且使旅行费用最少。本问题已知城市n，和n*n的表达任意两个城市间费用的矩阵。试求最短路径及其费用；-There is a salesman, want to n (n<=10) a city to sell products. In order to save travel costs, before departure, he foun
理论知识与选题介绍
- VRP问题的目标函数通常有三类： 总配送距离最短 总配送时间最短 总配送费用最少(The objective functions of the VRP problem are usually of three kinds: The total distribution distance is the shortest The total delivery time is the shortest The total distribution cost is at least)