共查询到19条相似文献,搜索用时 62 毫秒
2.
研究多个销售商企业组成联盟向一个供应商订购同种商品的联合订货问题。考虑到实际问题中很难预测到精确的需求,本文用区间表示单位时间需求量,研究允许缺货的销售商企业联合订货区间值EOQ模型,其中缺货完全回补。以联合订货平均成本最小为目标,结合连续有序加权集结算子求解出联合订货的周期、区间值订货量和区间值平均成本。定义变权Shapley值,给出区间值合作博弈的区间值变权Shapley值的求解方法,得出区间值变权Shapley值的表达式可直接利用相关联盟值的左、右端点计算得到。考虑联盟和局中人的相对重要性,结合需求率确定合成权重,提出基于区间值变权Shapley值的联合订货成本分摊方法。利用数值算例验证模型和方法的有效性。本文可为解决联合订货成本分摊问题提供决策参考。 相似文献
3.
依托平台的协作配送问题,在合理时间内有效计算公平成本分摊方案至关重要.核仁解是公认的公平分摊方案,但需要通过复杂的优化计算.提出了一个能通过公式近似快速计算核仁解的方法,发现任意满足总体理性分摊方案x的2~n-1(n为大联盟N中成员数)个子联盟S(S为N的子集)的满意度e(S, x)之和为常数,且不同x对应的任意子联盟S与互补联盟NS的满意度之和,即L_S=e(S, x)+e(NS, x)为常数.基于子联盟满意度越均衡,分配方案越合理的准则,构造了分配方案x对应的所有子联盟满意度均衡量化函数f(x)=∑[e(S, x)-0.5L_S]~2.显然,f越小表示子联盟满意度越均衡.证明了存在分配方案x*使f取到极小值,且x~*满足总体理性、唯一性、可加性、策略等价相对不变性、一致性、匿名性和可比性等众多分摊方案合理属性.最后,采用文章所提方法和核仁解求解方法,计算了诸多已有文献中的成本分摊算例,求解结果表明文章提出的方法计算速度比传统核仁解求解方法快数万倍以上,与最新求解核仁解及Shapley值的有效算法相比也具有明显的性能优势,且求解结果与核仁解的结果平均偏差只有5%左右.更重要的是,提出的新方法本身具有科学内涵,可以应用于任何支付可转移的合作博弈成本分摊问题. 相似文献
4.
基于模糊聚类与车辆协作策略的随机车辆路径问题 总被引:1,自引:0,他引:1
以多辆车协作的随机车辆路径问题为研究对象,设计了通用的随机车辆路径问题机会约束模型,提出了大规模随机车辆路径问题的车辆协作策略,并基于该策略与模型设计了求解天规模随机车辆路径问题的混合启发式算法,计算实验结果说明了该算法与策略的有效性与实用性. 相似文献
5.
随着"中国制造2025"战略的提出和经济增长动力的转变,人力资本尤其是技能型人才在推动我国经济发展进程中的作用更加凸显,这使得技能型人才的培养问题显得尤为重要。但从企业的微观层面来看,由于企业与技能型人才培训博弈机制和培养成本分摊机制的失效,导致技能型人才的流动性过高、整体素质水平偏低等问题凸显。本文对技能型人才培训博弈机制和成本分摊机制失效的现状和存在的问题进行分析,并针对这些问题从政府部门的角度提出一些对策建议,以期使企业对技能型人才的培养体系得到改进完善。 相似文献
6.
车辆路径问题的禁忌搜索算法研究 总被引:19,自引:1,他引:19
论文在对车辆路径问题进行简单描述的基础上,通过设计一种新的解的表示方法构造了求解该问题的一种新的禁忌搜索算法,并进行了实验计算。计算结果表明,用本文设计的禁忌搜索算法求解车辆路径问题,不仅可以取得很好的计算结果,而且算法的计算效率较高,收敛速度较快,计算结果也较稳定。 相似文献
7.
8.
在易腐品的运输过程中,易腐品的新鲜度不仅会随时间的流逝而下降,而且还会受运输设施所采用的保鲜技术的影响。所以易腐品零售商使用某种运输设施时,零售商除了需要支付运输成本和保鲜成本之外,他们还需要承担因易腐品新鲜度下降而导致的价值损耗。本文首先把运输成本、保鲜成本和易腐品新鲜度下降导致的价值损耗作为总费用,通过应用限制博弈的可行联盟思想,把具有容量限制的易腐品联合运输的费用分摊问题转化为一类限制博弈模型。然后,通过讨论该限制博弈的相关性质,给出了该博弈限制核非空的充分条件。最后,通过实例将限制核与Shapley值、τ-值和核仁进行了比较分析。 相似文献
9.
10.
11.
12.
在分析自然界各种竞争机制和人类社会决策原理的基础上,利用竞争造就优化和决策左右结果的特性,提出了一种能广泛应用于组合优化难题的新型算法———竞争决策算法(CDA),并给出了CDA的通用模型.车辆路径问题(VRP)是一个著名的NP难题,也是物流领域内一个重要的调度问题,利用CDA的通用模型设计了一个针对VRP的快速求解算法,并用该算法求解了VRP标准测试库中的实例,经过大量数据测试和验证,获得了令人满意的效果,其中部分问题的解优于目前公布的最好解. 相似文献
13.
14.
15.
We introduce an exponential neighborhood for the Vehicle Routing Problem (vrp) with unit customers’ demands, and we show that it can be explored efficiently in polynomial time by reducing its exploration to a particular
case of the Restricted Complete Matching (rcm) problem that we prove to be polynomial time solvable using flow techniques. Furthermore, we show that in the general case
with non-unit customers’ demands the exploration of the neighborhood becomes an
-hard problem. 相似文献
16.
This paper presents a two-phase heuristic method that can be used to efficiently solve the intractable multi-depot vehicle routing problem with time windows. The waiting time that was ignored by previous researchers is considered in this study. The necessity of this consideration is verified through an initial experiment. The results indicate that the waiting time has a significant impact on the total distribution time and the number of vehicles used when solving test problems with narrow time windows. In addition, to fairly evaluate the performance of the proposed heuristic method, a meta-heuristic method, which extends the unified tabu search of Cordeau et al., is proposed. The results of a second experiment reveal that the proposed heuristic method can obtain a better solution in the case of narrow time windows and a low capacity ratio, while the proposed meta-heuristic method outperforms the proposed heuristic method, provided that wide time windows and a high capacity ratio are assumed. Finally, a well-known logistics company in Taiwan is used to demonstrate the method, and a comparison is made, which shows that the proposed heuristic method is superior to the current method adopted by the case company. 相似文献
17.
蚁群算法是一种新型的模拟进化算法,具有许多优良的性质,可以很好地解决TSP问题.在分析车辆路径问题(VRP)与TSP区别的基础上,论文将蚁群算法应用于VRP的求解,针对VRP的具体特点,构造了具有自适应功能的混合蚁群算法.该算法对基本规则作了进一步改进,并有机结合了爬山法、节约法等方法,以减少计算时间,避免算法停滞.指出可行解问题是蚁群算法的关键问题,提出了大蚂蚁数、近似解可行化等四个解决策略.计算机仿真结果表明,自适应混合蚁群算法性能优良,能够有效地求解VRP. 相似文献
18.
A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries 总被引:2,自引:1,他引:1
Niaz A. Wassan A. Hameed Wassan Gábor Nagy 《Journal of Combinatorial Optimization》2008,15(4):368-386
The vehicle routing problem with pickups and deliveries (VRPPD) extends the vehicle routing problem (VRP) by allowing customers
to both send and receive goods. The main difficulty of the problem is that the load of vehicles is fluctuating rather than
decreasing as in the VRP. We design a reactive tabu search metaheuristic that can check feasibility of proposed moves quickly
and reacts to repetitions to guide the search. Several new best solutions are found for benchmark problems. 相似文献
19.
《Omega》2015
We introduce, model and solve to optimality a rich multi-product, multi-period and multi-compartment vehicle routing problem with a required compartment cleaning activity. This real-life application arises in the olive oil collection process in Tunisia, where regional collection offices dispose of a fleet of vehicles to collect one or several grades of olive oil from a set of producers. For each grade, the quantity offered by a producer changes dynamically over the planning horizon. We first provide a mathematical formulation of the problem, along with a set of known and new valid inequalities. We then propose an exact branch-and-cut algorithm to solve the problem. We evaluate the performance of the algorithm on real data sets under different transportation scenarios to demonstrate to our industrial partner the advantages of using multi-compartment vehicles. 相似文献