共查询到19条相似文献,搜索用时 78 毫秒
1.
2.
产地间或销地间往往存在竞争,在这种情况下,使用运输问题最优化方法是不合理的。因此,从个体理性的视角提出运输问题的合作对策求解方法,方法将运输问题看作是一个博弈问题,各个产地或销地是博弈的局中人,求解其纳什均衡与纳什讨价还价解。在此基础上,说明了运输问题的非合作形式是一个指派问题,并证明指派问题的最优解是一个纳什均衡点。接着,通过实验验证运输问题的最优解是一个纳什讨价还价解,满足产地或销地的自身利益。在此基础上,针对纳什讨价还价解不唯一的问题,从决策者的视角给出最大可能激励成本的计算方法。最后,为弥补纳什讨价还价解不唯一及纳什讨价还价解不允许出现子联盟的缺陷,给出运输收益分配或成本分摊的Shapely值计算方法。 相似文献
3.
一类最优指派问题的动态规划模型 总被引:9,自引:0,他引:9
考虑一类指派问题:欲指派m个人去做n项工作(m≥n),要求每个人只做一项工作,第j项工作可以由b_j个人共同去做,其中,b_j(b_j≥1)是待求的未知数,j=1,2,…,n,满足.假定已知第i人做第j项工作的效益为c_ij≥0,i=1,2,…m;j=1,2,…,n.本文建立了求解上述问题最优指派(即使总的效益最大)的动态规划模型. 相似文献
4.
一类最优指派问题的动态规划算法 总被引:4,自引:0,他引:4
考虑一类指派问题:欲把m项工作指派n个人去完成(m≥n)。要求每项工作只能由一个人来做,第i个人可以同时做bi项工作,其中bi(bi≥1)是待求的未知数;i=1,2,…,n,满足∑^ni=1bi=m,假定已知第i人做第j项工作所用的时间cij≥0,i=1,2,…,m。中给出了求解上述问题最优指派(即使总耗用时间最小)的动态规划解法。 相似文献
5.
一类最优指派问题的动态规划解法 总被引:7,自引:0,他引:7
考虑一类指派问题 :欲把 m项工作指派 n个人去完成 ( m≥ n) ,要求每项工作只能由一个人来做 ,第 i个人可以同时做 bi 项工作 ,其中 bi( bi≥ 1)是待求的未知数 ,i=1,2 ,… ,n,满足 ni=1bi =m,假定已知第 i人做第 j项工作所用的时间 cij≥ 0 ,i=1,2 ,… ,n;j=1,2 ,… ,m。文中给出了求解上述问题最优指派 (即使总耗用时间最小 )的动态规划解法。 相似文献
6.
指派矩阵同解改造理论变换定理论证 总被引:1,自引:0,他引:1
本文对指派问题的“周良泽算法”赖以成立而又尚未具体证明的一个重要的基础性定理,给出了严谨的论证,对指派矩阵同解改造理论作了抬遗补证的工作。 相似文献
7.
给出了该类问题的数学模型,其约束的特殊性表现在被指派的资源数量必须在给定的范围内,因而不同于一般非平衡指派问题;运用m进制运算规则将二维解矩阵转化为一维解向量,减少解组合的数量,据此用隐枚举法求得问题的最优解。通过对多个算例的求解,找出了该问题最优解的两个特点。这些特点可为求解大规模该问题的智能算法提供有益的帮助。 相似文献
8.
关于“一类最优指派问题的动态规划模型”的注记 总被引:1,自引:0,他引:1
王雪华 《数学的实践与认识》2000,30(2):147-149
考虑一类较一般的最优指派问题 :欲指派 m个人做 n项工作 (m≥n) ,要求每个人只做一项工作 ,第j项工作可以由 bj个人共同去做 ,其中 bj是待求未知数 ,满足 dj≤ bj≤ ej(即 ej,dj为第 j项工作所需人数的上下限 )及 ∑nj=1bj=m(即每个人都有工作 ) ,dj,ej为已知常数 ,j =1 ,… ,n.第 i人做第 j项工作的效益为 cij≥ 0 ,i =1 ,… ,m;j =1 ,… ,n.本文建立求解上述最优指派问题 (使总的效益最大 )的动态规划模型 ,并将文 [1]作为本文的特例 . 相似文献
9.
10.
在企业、公司的运营与管理中,管理者总是希望把人员最佳分派以发挥其最大工作效率,从而降低成本、提高效益。然而,如果没有科学的方法是很难实现优化管理的。本文通过运用匈牙利法对一个航班时刻表中的机组人员在异地的停留时间进行分析与研究,发现现有的人员指派方案不是理论上的最优解,进而在假设条件成立的前提下,提出了更加科学的人员指派方案。 相似文献
11.
A transit equilibrium assignment problem assigns the passenger flows on to a congested transit (public transportation) network with asymmetric cost functions and a fixed origin-destination matrix. This problem which may be formulated in the space of hyperpath flows, is transformed into an equivalent problem in the space of total arc flows and an auxiliary variable. A simplicial decomposition algorithm is developed and its convergence is proved under the usual assumptions on the cost functions. The algorithm requires relatively little memory and its efficiency is demonstrated with computational results. 相似文献
12.
John C. Harsanyi 《Mathematical Social Sciences》1982,3(2):179-191
Part I of this paper discusses the problem of how to model bargaining behavior, and outlines a few basic ideas of the Harsanyi-Selten solution theory. In particular, we discuss removal of imperfect equilibrium points from the game by using the uniformly perturbed game form. We also describe definition of the solution in terms of payoff-dominance and risk-dominance relations, and in terms of the net strategic distances, between the primitive equilibrium points. Part II of the paper will discuss the actual solutions our theory provides for some important classes of bargaining games. 相似文献
13.
Yasemin Serin 《Operations Research Letters》2007,35(1):83-94
Consider two newsvendors: (i) they compete satisfying substitutable demands searching Nash equilibrium or (ii) one is the leader deciding first, the other responds optimally playing a Stackelberg game. The leader profits more than she does in (i). We present conditions under which the leader's profit does not improve from (i) to (ii). 相似文献
14.
本文考虑具有损失厌恶行为与破裂风险的Rubinstein谈判博弈。首先构建子博弈完美均衡,并证明子博弈完美均衡的存在性及唯一性。然后分析子博弈完美均衡的性质,结果表明:参与人受益于对手的损失厌恶行为,而因自身具有损失厌恶行为遭受损失;谈判破裂概率对均衡结果的影响取决于贴现因子与参与人的损失厌恶系数;当谈判破裂的概率趋于零时,极限均衡结果收敛于经典的Rubinstein谈判博弈结果。最后建立了与非对称Nash谈判解的关系,其中参与人的议价能力与自身的损失厌恶水平呈负相关性,与对手的损失厌恶水平呈正相关性;参与人的议价能力依赖于谈判破裂概率与出价时间间隔的比值。 相似文献
15.
This paper employs uncertain programming to deal with uncertain optimal assignment problem in which profit is uncertain. Within the framework of uncertain programming, it gives the uncertainty distribution of the optimal assignment profit, and the concept of α-optimal assignment for uncertain optimal assignment problem is proposed. Then α-optimal model is also constructed. Taking advantage of properties of uncertainty theory, α-optimal model can be transformed into a corresponding deterministic form, which can be solved by Kuhn–Munkres algorithm. 相似文献
16.
《Optimization》2012,61(4):929-939
This paper constructs an algorithm to solve the fractional assignment problem. Algorithms that are currently used are mostly based on parametric approaches and must solve a sequence of optimization procedures. They also neglect the difficulties caused by degeneracy. The proposed algorithm performs optimization once and overcomes degeneracy. The main features of the algorithm are an effective initial heuristic approach, a simple labelling procedure and an implicit primal-dual schema. A numerical example is presented and demonstrates that the proposed algorithm is easy to apply. Computational results are compared with those from other developed methods. The results show that the proposed algorithm is efficient. 相似文献
17.
18.
19.
Jin Kue Wong 《BIT Numerical Mathematics》1979,19(3):418-424
Existing implementations of Munkres' algorithm for the optimal assignment problem are shown to requireO(n
4) time in the worstn×n case. A new implementation is presented which runs in worst-case timeO(n
3) and compares favorably in performance with the algorithm of Edmonds and Karp for this problem.The results of this paper were obtained by the author while at the Department of Computer Science, Cornell University. This work was supported in part by a Vanderbilt University Research Council Grant. 相似文献