共查询到18条相似文献,搜索用时 93 毫秒
1.
针对社区项目博弈的一般模型,应用贪婪算法求解项目博弈的近似社会最优指派,给出参与者重加权分配机制,证明贪婪算法求得的指派恰好是非合作项目博弈的一个纳什均衡.定义控制参数,给出边际效益后悔值定义,利用后悔值改进了贪婪算法,证明基于后悔值贪婪算法求得的指派是非合作项目博弈的一个纳什均衡.通过数值仿真实验发现,与模拟退火算法比较,贪婪算法能够得到更好的社会效益,而且基于后悔值贪婪算法比贪婪算法得到更好的社会效益. 相似文献
2.
研究了基于自动引导机器人(AGV)的"货到人"拣选模式下的智能仓库系统补货阶段的储位分配问题.根据待拣选订单信息计算出商品之间的关联度,考虑了货架上存放的物品信息、空余储位数量、待补货物品信息,以同一货架上的各种商品之间的关联度之和最大化为目标函数,建立了补货阶段储位分配问题的整数规划模型;设计了求解模型的贪婪算法,并分析了算法复杂度.利用一个具体实例进行模拟计算,分析了贪婪算法的求解效果.进一步利用不同规模算例进行模拟计算,分析了贪婪算法的计算时间和近似比,结果显示贪婪算法可以在很短的时间内得到近似最优解,近似比不超过1.15.设计的贪婪算法可以作为智能仓库管理信息系统的核心算法. 相似文献
3.
考虑到战时物资需求的紧迫性和保障资源的有限性,从决策者的角度出发,以军事物流系统总体供应时间最短为目标,构建了两级军事配送网络的定位-运输路线安排模型,并给出一种启发式算法.算法分为两个阶段,首先利用蚁群算法和线性规划的方法解决运输路线安排问题,然后运用贪婪搜索算法解决军事物流配送中心选址问题.最终,将两种算法结合起来进行逐步搜索,从而得到模型的解,并运用实例说明了算法的有效性和可行性. 相似文献
4.
5.
有交货时间限制的大规模实用下料问题 总被引:1,自引:0,他引:1
研究的是有交货时间限制的单一原材料下料问题(规模较大).对于一维下料问题,本文得到一个有各自交货时间的模型.针对该模型提出一种新的算法:DP贪婪算法.计算结果是总用料800根即可完成需求任务,材料利用率为99.6%.对于二维下料问题,在一维的基础上建立了二维的求解模型,运用我们自己设计的降维思想结合一维的DP贪婪算法,给出解决该模型的算法.计算结果是总用料451块即可完成需求任务,材料利用率位99.2%.算法设计时考虑了普遍的情况,所以算法在解决大多数实际下料问题,特别是大规模下料问题时是切实有效的. 相似文献
6.
多设施Weber问题(multi-source Weber problem,MWP)是设施选址中的重要模型之一,而Cooper算法是求解MWP最为常用的数值方法.Cooper算法包含选址步和分配步,两步交替进行直至达到局部最优解.本文对Cooper算法的选址步和分配步分别引入改进策略,提出改进Cooper算法:选址步中将Weiszfeld算法和adaptive Barzilai-Borwein (ABB)算法结合,提出收敛速度更快的ABB-Weiszfeld算法求解选址子问题;分配步中提出贪婪簇分割策略来处理退化设施,由此进一步提出具有更好性质的贪婪混合策略.数值实验表明本文提出的改进策略有效地提高了Cooper算法的计算效率,改进算法有着更好的数值表现. 相似文献
7.
通过分析判断矩阵 ,一致性矩阵 ,导出矩阵及度量矩阵的关系 ,提出一种修改判断矩阵的预测加速修正的贪婪算法 .贪婪法不追求最优解 ,不要回溯 ,只希望得到较为满意的解 .当判断矩阵的一致性较差时 ,基于度量矩阵中偏离大的元素对判断矩阵一致性的影响较大 ,通过导出矩阵和度量矩阵得出加速修正的步长 .每次只修改判断矩阵的一对元素 .实例分析表明 ,修改 AHP中的判断矩阵的贪婪算法是可行的 . 相似文献
9.
10.
首先结合电缆敷设相关标准建立了基于多种条件限制的电缆敷设优化的多目标规划模型,将分层序列法的思想运用于模型的求解中.将总敷设路线最短作为第一目标,转弯数最少作为第二目标,错层数最少作为第三目标.求解时首先将遗传算法和改进的Dijkstra算法相结合,共同进行第一目标和第二目标的求解;对于第三目标错层数最少,在运用改进的Dijkstra算法得出待敷设路线后,设计了基于贪心准则的贪婪敷设算法来满足错层数最少的要求.最终通过MATLAB编程实现以上思想并分别对30条和100条电缆的敷设进行实例验证. 相似文献
11.
研究了“货到人”拣选模式下的储位分配问题,以订单拣选过程中搬运货架总时间最短为目标建立了整数非线性规划模型,并证明其为NP-hard问题,分别设计了求解模型的贪婪算法和单亲进化遗传算法。首先根据订单和物品的关联关系对物品进行聚类,基于聚类结果设计了求解模型的贪婪算法。然后设计了直接求解模型的单亲进化遗传算法,遗传算法中采用了0-1矩阵编码、多点基因倒位算子、单点基因突变算子和精英保留等策略,通过合理选取参数,能够很快求解出问题的近似最优解。最后利用模拟算例和一个具体实例进行计算,并对贪婪算法和遗传算法的求解时间和求解效果进行了比较分析。结果显示,对于小规模问题,两种算法均能在较短的时间内以很高的概率得到问题的全局最优解,对于中等规模的实际问题,利用两种算法得到的储位分配方案均优于企业目前采取的基于出库频率的储位分配方案,遗传算法得到的储位分配方案对应的货架搬运次数、货架搬运总时间等均优于贪婪算法。本文设计的遗传算法可以作为智能仓库管理信息系统的核心算法。 相似文献
12.
A general linear programming model for an order-theoretic analysis of both Edmonds' greedy algorithm for matroids and the
NW-corner rule for transportation problems with Monge costs is introduced. This approach includes the model of Queyranne,
Spieksma and Tardella (1993) as a special case. We solve the problem by optimal greedy algorithms for rooted forests as underlying
structures. Other solvable cases are also discussed. 相似文献
13.
14.
Delay of VLSI circuit components can be controlled by varying their sizes. In other words, performance of VLSI circuits can be optimized by changing the sizes of the circuit components. In this paper, we define a special type of geometric program called unary geometric program. We show that under the Elmore delay model, several commonly used formulations of the circuit component sizing problem considering delay, chip area and power dissipation can be reduced to unary geometric programs. We present a greedy algorithm to solve unary geometric programs optimally and efficiently. When applied to VLSI circuit component sizing, we prove that the runtime of the greedy algorithm is linear to the number of components in the circuit. In practice, we demonstrate that our unary-geometric-program based approach for circuit sizing is hundreds of times or more faster than other approaches. 相似文献
15.
16.
This paper describes the details of a successful application where an integer programming and evolutionary hybrid algorithm was used to solve a bus driver duty optimization problem. The task is NP-hard, therefore theoretically optimal solutions can only be calculated for very small problem instances. Our aim is to obtain solutions of good quality within reasonable time limits. We first applied an integer programming approach to a set partitioning problem. The model was solved with a column generation algorithm in a branch and bound scheme. In order to solve larger real-life problems, we have combined the integer programming method with a greedy 1+1 steady state evolutionary algorithm. The resulting hybrid algorithm was capable of providing near-optimal solutions within reasonable timescales to larger instances of the bus driver scheduling problem. We present the results and running times of our algorithm in detail, as well as possible directions of future improvements. 相似文献
17.
Costa et al. (Oper. Res. Lett. 31:21–27, 2003) presented a quadratic O(min (Kn,n
2)) greedy algorithm to solve the integer multicut and multiflow problems in a rooted tree. (n is the number of nodes of the tree, and K is the number of commodities). Their algorithm is a special case of the greedy type algorithm of Kolen (Location problems
on trees and in the rectilinear plane. Ph.D. dissertation, 1982) to solve weighted covering and packing problems defined by general totally balanced (greedy) matrices. In this communication
we improve the complexity bound in Costa et al. (Oper. Res. Lett. 31:21–27, 2003) and show that in the case of the integer multicut and multiflow problems in a rooted tree the greedy algorithm of Kolen
can be implemented in subquadratic O(K+n+min (K,n)log n) time. The improvement is obtained by identifying additional properties of this model which lead to a subquadratic transformation
to greedy form and using more sophisticated data structures.
相似文献
18.
《European Journal of Operational Research》2002,141(2):393-409
In order to solve heterogeneous single and multiple container loading problems, an algorithm is presented that builds homogeneous blocks of identically orientated items. First a greedy heuristic is presented that generates the desired block arrangements. Second the solutions provided by the greedy heuristic are improved by a tree search. Additional aspects such as load stability and weight distribution within the container are also taken into account. The test cases of Bischoff and Ratcliff are used for benchmarking purposes. 相似文献