¹Wasu Media Network Co., Hangzhou, China
²The College of Computer Science and Information Engineering, Zhejiang Gongshang University, Hangzhou, China

---

Abstract—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.

Index Terms—Dynamic alliance; Sorting model; Top-k Query; Virtual enterprise

[PDF]

Cite: Bishan Ying, Pingping Zhu, and Ye Gu, "A Fast Searching Approach for Top-k Partner Selection in Dynamic Alliances of Virtual Enterprises," Journal of Computers vol. 9, no. 9, pp. 2013-2021, 2014.