基于模拟退火算法的动态联盟盟员的动态选择

为了顺应21世纪知识经济时代竞争的需要,在制造业出现了动态联盟的先进制造模式,从而使得对动态联盟的研究成为当前学术界热点问题之一。目前,国内外在研究动态联盟盟员选择主要集中于组盟时的盟员选择,是一种静态选择,与动态联盟“快捷变化”的特性不符。由于知识的形性、外溢性、无地域性、成员间的合作竞争性等,使得动态联盟不可避免会产生知识资产冲突,从而导致着盟员的动态更迭。为此,基于模拟退火算法的思想,本文设计了一种解决动态联盟中盟员动态选择的算法,该算法很好地解决了动态联盟中盟员如何被动态选择和淘汰的问题,实例也表明该算法是符合实际运做的。当然,本算法也存在着一些有待继续研究的问题。

Members Dynamic Selection Based on Simulated Annealing Algorithm in Virtual Enterprise

To comply with the need of competition in the era of knowledge-dominated 21st century, appears advanced manufacturing model of virtual enterprises in manufacture industry,which makes the study on virtual enterprise as one of hot topics in academy.At present,the study on partners selection of virtual enterprises focuses in the selection as constructing virtual enterprise,it is a tacit selection,which is unfit for the "agile" characteristic of virtual enterprises.Because of the intangibleness,spillover,non-terrain of knowledge and competitive collaboration among partners,intellectual assets conflict will happen in virtual enterprise inevitably,which give rise to the dynamic iteration of partners in virtual enterprise.Therefore,based on the minds of Simulated Annealing Algorithm,the article designs an algorithm to resolve dynamic selection for the members in dynamic alliance,the algorithm solves the question how to select and eliminate the members in virtual enterprise well,the case indicates that the algorithm is fit to the operation in fact.Of course,when applying simulated annealing algorithm,there some new problems which should be studied further.