Journal Home > Volume 6 , Issue 3
International Journal of Crowd Science 2022, 6(3): 128-134 https://doi.org/10.26599/IJCS.2022.9100016
Open Access | Issue | Published: 09 August 2022

Product Search Algorithm Based on Improved Ant Colony Optimization in a Distributed Network

Show Author's Information Zhishuo Liu1( ),  Fang Tian2,  Lida Li1,  Zhuonan Han1,  Yuqing Li1
School of Traffic and Transportation, Beijing Jiaotong University, Haidian, Beijing 100089, China
Business Administration Division, Seaver College, Pepperdine University, Malibu, CA 90263, USA
Keywords:
ant colony optimization, crowd intelligence, distributed network, commodity information search
Cite this article:
Liu Z, Tian F, Li L, et al. Product Search Algorithm Based on Improved Ant Colony Optimization in a Distributed Network. International Journal of Crowd Science, 2022, 6(3): 128-134. https://doi.org/10.26599/IJCS.2022.9100016
Download citation
EndNote(RIS)
BibTeX

729

Views

49

Downloads

Citations

1

Crossref

N/A

WoS

1

Scopus

N/A

CSCD

Abstract Full text About this article

The crowd intelligence-based e-commerce transaction network (CIeTN) is a distributed and unstructured network structure. Smart individuals, such as buyers, sellers, and third-party organizations, can store information in local nodes and connect and share information via moments. The purpose of this study is to design a product search algorithm on the basis of ant colony optimization (ACO) to achieve an efficient and accurate search for the product demand of a node in the network. We introduce the improved ideas of maximum and minimum ants to design a set of heuristic search algorithms on the basis of ACO. To reduce search blindness, additional relevant heuristic factors are selected to define the heuristic calculation equation. The pheromone update mechanism integrating into the product matching factor and forwarding probability is used to design the network search rules among nodes in the search algorithm. Finally, the search algorithm is facilitated by Java language programming and PeerSim software. Experimental results show that the algorithm has significant advantages over the flooding method and the random walk method in terms of search success rate, search time, product matching, search network consumption, and scalability. The search algorithm introduces the idea of improving the maximum and minimum ant colony system and proposes new ideas in the design of heuristic factors in the heuristic equation and the pheromone update strategy. The search algorithm can search for product information effectively.


menu
Abstract
Full text
Outline
About this article

Product Search Algorithm Based on Improved Ant Colony Optimization in a Distributed Network

Show Author's information Zhishuo Liu1( ), Fang Tian2, Lida Li1, Zhuonan Han1, Yuqing Li1
School of Traffic and Transportation, Beijing Jiaotong University, Haidian, Beijing 100089, China
Business Administration Division, Seaver College, Pepperdine University, Malibu, CA 90263, USA

Abstract

The crowd intelligence-based e-commerce transaction network (CIeTN) is a distributed and unstructured network structure. Smart individuals, such as buyers, sellers, and third-party organizations, can store information in local nodes and connect and share information via moments. The purpose of this study is to design a product search algorithm on the basis of ant colony optimization (ACO) to achieve an efficient and accurate search for the product demand of a node in the network. We introduce the improved ideas of maximum and minimum ants to design a set of heuristic search algorithms on the basis of ACO. To reduce search blindness, additional relevant heuristic factors are selected to define the heuristic calculation equation. The pheromone update mechanism integrating into the product matching factor and forwarding probability is used to design the network search rules among nodes in the search algorithm. Finally, the search algorithm is facilitated by Java language programming and PeerSim software. Experimental results show that the algorithm has significant advantages over the flooding method and the random walk method in terms of search success rate, search time, product matching, search network consumption, and scalability. The search algorithm introduces the idea of improving the maximum and minimum ant colony system and proposes new ideas in the design of heuristic factors in the heuristic equation and the pheromone update strategy. The search algorithm can search for product information effectively.

Keywords: ant colony optimization, crowd intelligence, distributed network, commodity information search

References(13)

1
Y. Chai, C. Miao, B. Sun, Y. Zheng, and Q. Li, Crowd science and engineering: Concept and research framework, International Journal of Crowd Science, vol. 1, no. 1, pp. 2–8, 2017.https://doi.org/10.1108/IJCS-01-2017-0004
DOI
2

C. Gkantsidis, M. Mihail, and A, Saberi, Random walks in peer-to-peer networks: Algorithms and evaluation, Perform. Eval., vol. 63, no. 3, pp. 241–263, 2006.
DOI Google Scholar
3

J. Sugawara and T, Takenaka, Proposal and evaluation of modified-BFS using the number of links in P2P networks, IEICE Tech. Rep., vol. 104, no. 616, pp. 5–8, 2005.
Google Scholar
4
V. Kalogeraki, D. Gunopulos, and D. Zeinalipour-Yazti, A local search mechanism for peer-to-peer networks, in Proc. 11thInt. Conf. Information and Knowledge Management, McLean, VA, USA, 2002, pp. 300–307.https://doi.org/10.1145/584792.584842
DOI
5
B. Yang and H. Garcia-Molina, Improving search in peer-to-peer networks, in Proc. 22ndInt. Conf. Distributed Systems, Washington, DC, United States, 2002, pp. 5–14.
6
K. Cai, H. Tang, S. Ding, and G. Zheng, P2P Network Principles and Applications, (in Chinese). Beijing, China: Science Press, 2011.
7
N. Leibowitz, M. Ripeanu, and A. Wierzbicki, Deconstructing the Kazaa Network, in Proc. 3rdIEEE Workshop on Internet Applications, San Jose, CA, USA, 2003, pp. 112–120.
8

H. T. Shen, Y. Shu, and B, Yu, Efficient semantic-based content search in P2P network, IEEE Trans. Knowl. Data Eng., vol. 16, no. 7, pp. 813–826, 2004.
DOI Google Scholar
9

L. Xiao, Z. Zhuang, and Y, Liu, Dynamic layer management in superpeer architectures, IEEE Trans. Parallel Distrib. Syst., vol. 16, no. 11, pp. 1078–1091, 2005.
DOI Google Scholar
10
D. M. R. Himali and S. K. Prasad, SPUN: A P2P probabilistic search algorithm based on successful paths in unstructured networks, in Proc. 2011 IEEE Int. Symp. Parallel and Distributed Processing Workshops and Phd Forum, Anchorage, AK, USA, 2011, pp. 1610–1617.https://doi.org/10.1109/IPDPS.2011.316
DOI
11

S. Joseph and T, Hoshiai, Decentralized meta-data strategies: Effective peer-to-peer search, IEICE Trans. Commun., vol. 86, no. 6, pp. 1740–1753, 2003.
Google Scholar
12
M. Shojafar, J. H. Abawajy, Z. Delkhah, A. Ahmadi, Z. Pooranian, and A. Abraham, An efficient and distributed file search in unstructured peer-to-peer networks, Peer-to-Peer Netw. Appl., vol. 8, no. 1, pp. 120–136, 2015.https://doi.org/10.1007/s12083-013-0236-0
DOI
13
L. F. Li, J. Z. Zhang, P. D. Wang, and P. J. Guo, P2P network search mechanism based on node interest and Q-learning, (in Chinese), Comput. Sci., vol. 47, no. 2, pp. 221–226, 2020.
Publication history
Copyright
Rights and permissions

Publication history

Received: 17 March 2022
Revised: 27 April 2022
Accepted: 28 April 2022
Published: 09 August 2022
Issue date: September 2022

Copyright

© The author(s) 2022

Rights and permissions

The articles published in this open access journal are distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/).

Return