动态联盟中伙伴选择的Top-k问题的优化算法

Dynamic alliance partner selection in the Top-k problem optimization algorithm

为研究大规模复杂供应链环境下合作伙伴选择的效率问题,从加速选择过程的角度入手,将Top-k优化思想引入虚拟企业合作伙伴选择过程,并对基本选择指标进行了分类,提出了基于特殊指标的优化选择过程。实验表明,通过该方法能够显著提高选择过程的效率。进一步改进了选择过程算法,提出了改进优化程序算法。仿真实验结果表明,该算法能有效地克服选择过程算法的误判率,提高合作伙伴选择的精度。

In order to study partnership selection efficiency problem under large-scale complicated supply chain circumstance,and to speed up the selection process,the optimization idea of top-k was introduced into the partnership selection process and the basic selection indices were classified.Algorithm of OP（Optimize Procedure） based on specific index was proposed.The experiment showed that this algorithm could remarkably improve the efficiency of partner selection process.Furthermore,the algorithm of IMOP（IMprove Optimize Procedure） based on OP algorithm was presented.It could effectively overcome the false alarm rate of the OP algorithm and improve the precision of partner selection.