期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Obsolescence optimization of electronic and mechatronic components by considering dependability and energy consumption 被引量:1
1
作者 M.A.Mellal S.Adjerid +2 位作者 D.Benazzouz S.Berrazouane E.J.Williams 《Journal of Central South University》 SCIE EI CAS 2013年第5期1221-1225,共5页
Nowadays, rapid technological progress influences the dependability of equipments and also causes rapid obsolescence. The mechatronic and electronic equipment components are mostly affected by obsolescence. A new chal... Nowadays, rapid technological progress influences the dependability of equipments and also causes rapid obsolescence. The mechatronic and electronic equipment components are mostly affected by obsolescence. A new challenger unit possesses identical functionalities, but with higher performances. This work aims to find the optimal number of components which should be replaced by new-type units, under budgetary constraints. In this work, the new challenger unit is characterized by lower energy consumption and the optimization steps are based on genetic algorithm (GA). The result shows the importance of this type of replacement in order to economize energy consumption and to deal with obsolescence. 展开更多
关键词 电子设备 机电元件 可靠性 优化 能耗 能源消耗 技术进步 遗传算法
下载PDF
On Merging Cover Inequalities for Multiple Knapsack Problems
2
作者 Randal Hickman Todd Easton 《Open Journal of Optimization》 2015年第4期141-155,共15页
This paper describes methods to merge two cover inequalities and also simultaneously merge multiple cover inequalities in a multiple knapsack instance. Theoretical results provide conditions under which merged cover i... This paper describes methods to merge two cover inequalities and also simultaneously merge multiple cover inequalities in a multiple knapsack instance. Theoretical results provide conditions under which merged cover inequalities are valid. Polynomial time algorithms are created to find merged cover inequalities. A computational study demonstrates that merged inequalities improve the solution times for benchmark multiple knapsack instances by about 9% on average over CPLEX with default settings. 展开更多
关键词 Multiple KNAPSACK Problem Cutting Plane COVER INEQUALITY INEQUALITY MERGING Pseudocost INTEGER Programming
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部