IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v463y2016icp293-302.html
   My bibliography  Save this article

Traveling salesman problems with PageRank Distance on complex networks reveal community structure

Author

Listed:
  • Jiang, Zhongzhou
  • Liu, Jing
  • Wang, Shuai

Abstract

In this paper, we propose a new algorithm for community detection problems (CDPs) based on traveling salesman problems (TSPs), labeled as TSP-CDA. Since TSPs need to find a tour with minimum cost, cities close to each other are usually clustered in the tour. This inspired us to model CDPs as TSPs by taking each vertex as a city. Then, in the final tour, the vertices in the same community tend to cluster together, and the community structure can be obtained by cutting the tour into a couple of paths. There are two challenges. The first is to define a suitable distance between each pair of vertices which can reflect the probability that they belong to the same community. The second is to design a suitable strategy to cut the final tour into paths which can form communities. In TSP-CDA, we deal with these two challenges by defining a PageRank Distance and an automatic threshold-based cutting strategy. The PageRank Distance is designed with the intrinsic properties of CDPs in mind, and can be calculated efficiently. In the experiments, benchmark networks with 1000–10,000 nodes and varying structures are used to test the performance of TSP-CDA. A comparison is also made between TSP-CDA and two well-established community detection algorithms. The results show that TSP-CDA can find accurate community structure efficiently and outperforms the two existing algorithms.

Suggested Citation

  • Jiang, Zhongzhou & Liu, Jing & Wang, Shuai, 2016. "Traveling salesman problems with PageRank Distance on complex networks reveal community structure," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 463(C), pages 293-302.
    • Handle: RePEc:eee:phsmap:v:463:y:2016:i:c:p:293-302
    DOI: 10.1016/j.physa.2016.07.050
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437116304812
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000
    File URL: https://libkey.io/10.1016/j.physa.2016.07.050?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Liu, Zhong & Huang, Jincai & Cheng, Guangquan, 2016. "Community detection in hypernetwork via Density-Ordered Tree partitionAuthor-Name: Cheng, Qing," Applied Mathematics and Computation, Elsevier, vol. 276(C), pages 384-393.
    2. Rego, César & Gamboa, Dorabela & Glover, Fred & Osterman, Colin, 2011. "Traveling salesman problem heuristics: Leading methods, implementations and latest advances," European Journal of Operational Research, Elsevier, vol. 211(3), pages 427-441, June.
    3. Du, Wen-Bo & Gao, Yang & Liu, Chen & Zheng, Zheng & Wang, Zhen, 2015. "Adequate is better: particle swarm optimization with limited-information," Applied Mathematics and Computation, Elsevier, vol. 268(C), pages 832-838.
    4. Chen Liu & Wen-Bo Du & Wen-Xu Wang, 2014. "Particle Swarm Optimization with Scale-Free Interactions," PLOS ONE, Public Library of Science, vol. 9(5), pages 1-8, May.
    5. Xiang, Ju & Hu, Tao & Zhang, Yan & Hu, Ke & Li, Jian-Ming & Xu, Xiao-Ke & Liu, Cui-Cui & Chen, Shi, 2016. "Local modularity for community detection in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 443(C), pages 451-459.
    6. S. Lin & B. W. Kernighan, 1973. "An Effective Heuristic Algorithm for the Traveling-Salesman Problem," Operations Research, INFORMS, vol. 21(2), pages 498-516, April.
    7. Helsgaun, Keld, 2000. "An effective implementation of the Lin-Kernighan traveling salesman heuristic," European Journal of Operational Research, Elsevier, vol. 126(1), pages 106-130, October.
    8. Steven H. Strogatz, 2001. "Exploring complex networks," Nature, Nature, vol. 410(6825), pages 268-276, March.
    9. Li, Zhangtao & Liu, Jing, 2016. "A multi-agent genetic algorithm for community detection in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 449(C), pages 336-347.
    10. Andrea Lancichinetti & Filippo Radicchi & José J Ramasco & Santo Fortunato, 2011. "Finding Statistically Significant Communities in Networks," PLOS ONE, Public Library of Science, vol. 6(4), pages 1-18, April.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Li, Mingming & Liu, Jing, 2018. "A link clustering based memetic algorithm for overlapping community detection," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 503(C), pages 410-423.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Gary R. Waissi & Pragya Kaushal, 2020. "A polynomial matrix processing heuristic algorithm for finding high quality feasible solutions for the TSP," OPSEARCH, Springer;Operational Research Society of India, vol. 57(1), pages 73-87, March.
    2. Sun, Peng Gang, 2016. "Imbalance problem in community detection," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 457(C), pages 364-376.
    3. Ghosh, Diptesh, 2016. "Exploring Lin Kernighan neighborhoods for the indexing problem," IIMA Working Papers WP2016-02-13, Indian Institute of Management Ahmedabad, Research and Publication Department.
    4. Xiao, Guanping & Zheng, Zheng & Wang, Haoqin, 2017. "Evolution of Linux operating system network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 466(C), pages 249-258.
    5. Henke, Tino & Speranza, M. Grazia & Wäscher, Gerhard, 2015. "The multi-compartment vehicle routing problem with flexible compartment sizes," European Journal of Operational Research, Elsevier, vol. 246(3), pages 730-743.
    6. Lamb, John D., 2012. "Variable neighbourhood structures for cycle location problems," European Journal of Operational Research, Elsevier, vol. 223(1), pages 15-26.
    7. Escobar, John Willmer & Linfati, Rodrigo & Baldoquin, Maria G. & Toth, Paolo, 2014. "A Granular Variable Tabu Neighborhood Search for the capacitated location-routing problem," Transportation Research Part B: Methodological, Elsevier, vol. 67(C), pages 344-356.
    8. Manerba, Daniele & Mansini, Renata & Riera-Ledesma, Jorge, 2017. "The Traveling Purchaser Problem and its variants," European Journal of Operational Research, Elsevier, vol. 259(1), pages 1-18.
    9. Farasat, Alireza & Nikolaev, Alexander G., 2016. "Signed social structure optimization for shift assignment in the nurse scheduling problem," Socio-Economic Planning Sciences, Elsevier, vol. 56(C), pages 3-13.
    10. Qiu, Yuzhuo & Zhou, Dan & Du, Yanan & Liu, Jie & Pardalos, Panos M. & Qiao, Jun, 2021. "The two-echelon production routing problem with cross-docking satellites," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 147(C).
    11. Karapetyan, D. & Gutin, G., 2011. "Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 208(3), pages 221-232, February.
    12. Wuli Wang & Liming Duan & Yang Bai & Haoyu Wang & Hui Shao & Siyang Zhong, 2016. "A Triangle Mesh Standardization Method Based on Particle Swarm Optimization," PLOS ONE, Public Library of Science, vol. 11(8), pages 1-14, August.
    13. Yifei Yang & Sichen Tao & Haichuan Yang & Zijing Yuan & Zheng Tang, 2023. "Dynamic Complex Network, Exploring Differential Evolution Algorithms from Another Perspective," Mathematics, MDPI, vol. 11(13), pages 1-16, July.
    14. Mor, A. & Speranza, M.G. & Viegas, J.M., 2020. "Efficient loading and unloading operations via a booking system," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 141(C).
    15. Rui Xu & Yumiao Huang & Wei Xiao, 2023. "A Two-Level Variable Neighborhood Descent for a Split Delivery Clustered Vehicle Routing Problem with Soft Cluster Conflicts and Customer-Related Costs," Sustainability, MDPI, vol. 15(9), pages 1-22, May.
    16. Chen, Yu-Wang & Zhu, Yao-Jia & Yang, Gen-Ke & Lu, Yong-Zai, 2011. "Improved extremal optimization for the asymmetric traveling salesman problem," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 390(23), pages 4459-4465.
    17. Zhang, Xue-Jun & Xu, Guo-Qiang & Zhu, Yan-Bo & Xia, Yong-Xiang, 2016. "Cascade-robustness optimization of coupling preference in interconnected networks," Chaos, Solitons & Fractals, Elsevier, vol. 92(C), pages 123-129.
    18. Du, Wenbo & Zhang, Mingyuan & Ying, Wen & Perc, Matjaž & Tang, Ke & Cao, Xianbin & Wu, Dapeng, 2018. "The networked evolutionary algorithm: A network science perspective," Applied Mathematics and Computation, Elsevier, vol. 338(C), pages 33-43.
    19. Carlo Piccardi, 2011. "Finding and Testing Network Communities by Lumped Markov Chains," PLOS ONE, Public Library of Science, vol. 6(11), pages 1-13, November.
    20. Calvete, Herminia I. & Galé, Carmen & Iranzo, José A., 2016. "MEALS: A multiobjective evolutionary algorithm with local search for solving the bi-objective ring star problem," European Journal of Operational Research, Elsevier, vol. 250(2), pages 377-388.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:phsmap:v:463:y:2016:i:c:p:293-302. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.