Next Article in Journal
Effect of Corporate Governance Structure on the Financial Performance of Johannesburg Stock Exchange (JSE)-Listed Mining Firms
Next Article in Special Issue
Comparative Analysis of Intelligent Transportation Systems for Sustainable Environment in Smart Cities
Previous Article in Journal
Agroecological and Social Transformations for Coexistence with Semi-Aridity in Brazil
Previous Article in Special Issue
Data Compatibility to Enhance Sustainable Capabilities for Autonomous Analytics in IoT
Article Menu
Issue 6 (June) cover image

Export Article

Open AccessArticle
Sustainability 2017, 9(6), 985; doi:10.3390/su9060985

An Improved Routing Optimization Algorithm Based on Travelling Salesman Problem for Social Networks

1
School of Optical-Electrical and Computer Engineering, University of Shanghai for Science and Technology, Military Road, No. 516, Shanghai 200093, China
2
Department of Mathematics and Computer Science, Northeastern State University Address: 611 N, Grand Ave, Tahlequah, OK 74464, USA
*
Author to whom correspondence should be addressed.
Received: 5 April 2017 / Revised: 24 May 2017 / Accepted: 6 June 2017 / Published: 8 June 2017
View Full-Text   |   Download PDF [1782 KB, uploaded 20 June 2017]   |  

Abstract

A 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
Keywords: ant colony algorithm; positive feedback; pheromone; convergence speed ant colony algorithm; positive feedback; pheromone; convergence speed
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

MDPI and ACS Style

Xiong, N.; Wu, W.; Wu, C. An Improved Routing Optimization Algorithm Based on Travelling Salesman Problem for Social Networks. Sustainability 2017, 9, 985.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Sustainability EISSN 2071-1050 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top