首页    期刊浏览 2025年02月20日 星期四
登录注册

文章基本信息

  • 标题:A Fast Searching Approach for Top-k Partner Selection in Dynamic Alliances of Virtual Enterprises
  • 本地全文:下载
  • 作者:Ying, Bishan ; Zhu, Pingping ; Gu, Ye
  • 期刊名称:Journal of Computers
  • 印刷版ISSN:1796-203X
  • 出版年度:2014
  • 卷号:9
  • 期号:9
  • 页码:2013-2021
  • DOI:10.4304/jcp.9.9.2013-2021
  • 语种:English
  • 出版社:Academy Publisher
  • 摘要:The success of supply chain management largely depends on establishing the partnership in dynamic alliance. In the past, many researches focus on selection of indexes and establish selection model according to the indexes. In order to speed up the process of selection, this paper introduces this optimized idea of Top-k into the selection of partner and classifies the original indexes. The paper presents algorithm of OP (Optimize Procedure) based on specific index and the experiment shows that these algorithms can efficiently improve the process of selecting partners. Furthermore, the paper also presents an algorithm of IMOP (Improve Optimize Procedure) based on OP algorithm. It can effectively overcome the false alarm rate of the OP algorithm and improve the accuracy of partner selection.
  • 关键词:Dynamic alliance;Sorting model;Top-k Query;Virtual enterprise
国家哲学社会科学文献中心版权所有