首页 | 本学科首页   官方微博 | 高级检索  
     

面向最优加工成本的合作伙伴选择方法
引用本文:贺泽.面向最优加工成本的合作伙伴选择方法[J].青岛科技大学学报,2007,28(4):372-376.
作者姓名:贺泽
作者单位:青岛科技大学机电工程学院,山东青岛266061
摘    要:针对面向加工制造的合作伙伴选择,强调了招标之前的任务分解,提出了初选、细选、精选"三步走"的解决方法。根据任务之间及任务所对应的合作伙伴之间的关系,基于加工和运输总费用最小化原则,建立了合作伙伴选择的优化模型。着重对合作伙伴评价方法中精选方法的算法进行研究,提出了一种新的算法——混合遗传模拟退火算法来进行精选,解决了单纯使用遗传算法使结果可能陷入局部最优解的弊端。通过实例证明,这种混合算法具有很强的搜索能力,结果跳出了局部最优解,能够解决实际问题。

关 键 词:合作伙伴选择  评价  遗传算法  模拟退火算法
文章编号:1672-6987(2007)04-0372-05
收稿时间:2007-01-05
修稿时间:2007-01-05

Selection of Cooperative Partner for Minimized Manufacturing Cost
HE Ze.Selection of Cooperative Partner for Minimized Manufacturing Cost[J].Journal of Qingdao University of Science and Technology:Natutral Science Edition,2007,28(4):372-376.
Authors:HE Ze
Affiliation:College of Electromechanical Engineering,Qingdao University of Science and Technology,Qingdao 266061 ,China
Abstract:Facing the manufacturing oriented cooperative partner selection,it emphasized the task decomposition before inviting public bidding.And the "Three Paces" selection method is presented which includes original selection,careful selection and elaborate selection.According to the relations between the tasks and the relations between the partners related to corresponding task,and based on the rules of minimum manufacturing and transporting cost,the optimizing model of cooperative partner selection is built.The emphasis is put on the algorithm of elaborate selection method for cooperative partner evaluation.A new algorithm is put forward to achieve the elaborate selection which combines genetic algorithm with simulated annealing algorithm.It overcomes the shortcomings of the genetic algorithm when it is used individually,which may lead to the local optimization resolution of the result.Through the case,it proves that the new method has stronger searching capacity and can be used to solve practical problems.The results jump out the local minimum resolution.
Keywords:partner selection evaluation genetic algorithm simulated annealing algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号