An Improved Routing Optimization Algorithm Based on Travelling Salesman Problem for Social Networks
AbstractA social network is a social structure, which is organized by the relationships or interactions between individuals or groups. Humans link the physical network with social network, and the services in the social world are based on data and analysis, which directly influence decision making in the physical network. In this paper, we focus on a routing optimization algorithm, which solves a well-known and popular problem. Ant colony algorithm is proposed to solve this problem effectively, but random selection strategy of the traditional algorithm causes evolution speed to be slow. Meanwhile, positive feedback and distributed computing model make the algorithm quickly converge. Therefore, how to improve convergence speed and search ability of algorithm is the focus of the current research. The paper proposes the improved scheme. Considering the difficulty about searching for next better city, new parameters are introduced to improve probability of selection, and delay convergence speed of algorithm. To avoid the shortest path being submerged, and improve sensitive speed of finding the shortest path, it updates pheromone regulation formula. The results show that the improved algorithm can effectively improve convergence speed and search ability for achieving higher accuracy and optimal results. View Full-Text
Share & Cite This Article
Xiong, N.; Wu, W.; Wu, C. An Improved Routing Optimization Algorithm Based on Travelling Salesman Problem for Social Networks. Sustainability 2017, 9, 985.
Xiong N, Wu W, Wu C. An Improved Routing Optimization Algorithm Based on Travelling Salesman Problem for Social Networks. Sustainability. 2017; 9(6):985.Chicago/Turabian Style
Xiong, Naixue; Wu, Wenliang; Wu, Chunxue. 2017. "An Improved Routing Optimization Algorithm Based on Travelling Salesman Problem for Social Networks." Sustainability 9, no. 6: 985.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.