@Article{, title={A reliable path between target users and clients in social networksusing an inverted ant colony optimization algorithm}, author={Saied Asgharia,*, Kianoush Azadib}, journal={Karbala International Journal of Modern Science مجلة كربلاء العالمية للعلوم الحديثة}, volume={3}, number={3}, pages={143-152}, year={2017}, abstract={Internet has become an integral section of human life. Millions of people are joining online social networks every day, inter-acting with others whom they did not know already. Establishing trust among those indirectly connected users performs a crucialrole in improving the quality of social network services and creating the security for them. Nowadays, there are many paths betweenclients (service requesters) and target users (service providers) in online social networks. Among existing paths finding a trust pathfor trustworthy services is a vital job. Also, in many previous methods, such as ant colony optimization algorithm (ACO) loadbalancing among target users is inefficient. Therefore, in this paper we propose an inverted ant colony optimization algorithm tofind a reliable path along with improving load balancing among the target users. The inverted ant colony optimization algorithm is adiversity of the basic ant colony optimization algorithm in which, the updated pheromone has a reverse effect on the selected pathby the ants. Finally, we simulate the proposed method by using the original experimental dataset and evaluate the proposed methodin terms of load balancing, waiting time and execution time in comparison with the ant colony optimization algorithm. The obtainedresults are very promising.

} }