Skip to main content

Advertisement

Log in

Two levels approach based on multifactorial optimization to solve the clustered shortest path tree problem

  • Research Paper
  • Published:
Evolutionary Intelligence Aims and scope Submit manuscript

Abstract

The Clustered Shortest-Path Tree Problem (CluSPT) has a great meaning in theoretical research as well as a wide range of applications in everyday life, especially in the field of network optimization. Being able to solve the CluSPT will path the way for improving practical systems such as agricultural irrigation and product distribution. Multifactorial Evolutionary Algorithm (MFEA) is a variant of Evolutionary Algorithm (EA) aiming at simultaneously solving multiple factorial tasks which can be diverse in types, dimensionalities and search spaces. The applications of MFEA have yet to be fully exploited, but the realm has recently attracted much interest from the research community, especially those who are working on evolutionary multitasking. Considering these characteristics, this paper describes a new approach using the MFEA for solving the CluSPT. The MFEA has two tasks: the first is solving the CluSPT problem and the second is solving a new problem which is decomposed from the CluSPT problem. The goal of the first task is finding the fittest solution as possible for the CluSPT while the goal of the second task is determining the best tree (w.r.t. cost minimization) which envelops all vertices of the problem. This paper also introduces mutation, crossover and population initialization operators for a proposed MFEA to solve the CluSPT. Each of these operators deals with individuals in two phases, one of which ensures that the resulted individual is a spanning tree and the other phase ensures that each of its clustered sub-graphs is also a spanning tree. As the MFEA had to deal with these two tasks, a decoding method was also created to allow communication between the tasks. To assess the effectiveness of the proposed algorithm and methods, the authors implemented them on both Euclidean and Non-Euclidean instances. Experiment results show that the proposed MFEA outperformed the existing MFEA algorithms on two-thirds instances with average improvement value of 47%. Besides, this paper analysis the convergence trends of each task in generations and the affectation of the number of vertices in the largest cluster on the obtained results by using both the Spearman’s rank correlation coefficient and scatter graphs.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17

Similar content being viewed by others

References

  1. Bali KK, Gupta A, Feng L, Ong YS, Siew TP (2017) Linearized domain adaptation in evolutionary multitasking. In: 2017 IEEE congress on evolutionary computation (CEC), IEEE, pp 1295–1302

  2. Bali KK, Ong YS, Gupta A, Tan PS (2019) Multifactorial evolutionary algorithm with online transfer parameter estimation: Mfea-ii. IEEE Trans Evol Comput 24(1):69–83

    Article  Google Scholar 

  3. Bao X, Liu Z (2012) An improved approximation algorithm for the clustered traveling salesman problem. Inf Process Lett 112(23):908–910. https://doi.org/10.1016/j.ipl.2012.08.020.http://www.sciencedirect.com/science/article/pii/S0020019012002475

  4. Binh HTT, Thanh PD, Thang TB (2019) New approach to solving the clustered shortest-path tree problem based on reducing the search space of evolutionary algorithm. Knowl Based Syst 180:12–25

    Article  Google Scholar 

  5. Chandra R, Gupta A, Ong YS, Goh CK (2016) Evolutionary multi-task learning for modular training of feedforward neural networks. In: International conference on neural information processing, Springer, pp 37–46

  6. Chisman JA (1975) The clustered traveling salesman problem. Comput Oper Res 2(2):115–119

    Article  Google Scholar 

  7. D’Emidio M, Forlizzi L, Frigioni D, Leucci S, Proietti G (2016) On the clustered shortest-path tree problem. In: ICTCS, pp 263–268

  8. Dror M, Haouari M, Chaouachi J (2000) Generalized spanning trees. Eur J Oper Res 120(3):583–592. https://doi.org/10.1016/S0377-2217(99)00006-5. http://www.sciencedirect.com/science/article/pii/S0377221799000065

  9. D’Emidio M, Forlizzi L, Frigioni D, Leucci S, Proietti G (2019) Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem. J Combin Optim 38:1–20

    Article  MathSciNet  Google Scholar 

  10. Feng L, Zhou W, Zhou L, Jiang S, Zhong J, Da B, Zhu Z, Wang Y (2017) An empirical study of multifactorial pso and multifactorial de. In: IEEE congress on evolutionary computation (CEC), IEEE, pp 921–928

  11. Gerla M, Fratta L (1988) Tree structured fiber optics MANs. IEEE J Sel Areas Commun 6(6):934–943

    Article  Google Scholar 

  12. Gong M, Tang Z, Li H, Zhang J (2019) Evolutionary multitasking with dynamic resource allocating strategy. IEEE Trans Evol Comput 23(5):858–869

    Article  Google Scholar 

  13. Gupta A, Mandziuk J, Ong YS (2015) Evolutionary multitasking in bi-level optimization. Complex Intell Syst 1(1–4):83–95

    Article  Google Scholar 

  14. Gupta A, Ong YS, Feng L (2016a) Multifactorial evolution: toward evolutionary multitasking. IEEE Trans Evol Comput 20(3):343–357

    Article  Google Scholar 

  15. Gupta A, Ong YS, Feng L, Tan KC (2016b) Multiobjective multifactorial optimization in evolutionary multitasking. IEEE Trans Cybern 47(7):1652–1665

    Article  Google Scholar 

  16. Helsgaun K (2011) Solving the clustered traveling salesman problem using the Lin–Kernighan–Helsgaun algorithm. Comput Sci Res Rep 142:1–16

    Google Scholar 

  17. Julstrom BA (2005) The blob code is competitive with edge-sets in genetic algorithms for the minimum routing cost spanning tree problem. In: Proceedings of the 7th annual conference on genetic and evolutionary computation, ACM, pp 585–590

  18. Lin CW, Wu BY (2016) On the minimum routing cost clustered tree problem. J Combin Optim 78:1–16

    Google Scholar 

  19. Mestria M, Ochi LS, de Lima MS (2013) GRASP with path relinking for the symmetric euclidean clustered traveling salesman problem. Comput Oper Res 40(12):3218–3229

    Article  MathSciNet  Google Scholar 

  20. Myung YS, Lee CH, Tcha DW (1995) On the generalized minimum spanning tree problem. Networks 26(4):231–241

    Article  MathSciNet  Google Scholar 

  21. Palmer C, Kershenbaum A (1994) Representing trees in genetic algorithms. IEEE, Orlando, FL, USA, pp 379–384. https://doi.org/10.1109/ICEC.1994.349921. http://ieeexplore.ieee.org/document/349921/

  22. Perfecto C, Bilbao MN, Del Ser J, Ferro A, Salcedo-Sanz S (2016) Dandelion-encoded harmony search heuristics for opportunistic traffic offloading in synthetically modeled mobile networks. In: Harmony search algorithm, Springer, pp 133–145

  23. Prim RC (1957) Shortest connection networks and some generalizations. Bell Labs Tech J 36(6):1389–1401

    Article  Google Scholar 

  24. Prisco J (1986) Fiber optic regional area networks in New York and Dallas. IEEE J Sel Areas Commun 4(5):750–757

    Article  Google Scholar 

  25. Raidl GR, Julstrom BA (2003) Edge sets: an effective evolutionary coding of spanning trees. IEEE Trans Evol Comput 7(3):225–239

    Article  Google Scholar 

  26. Rothlauf F (2008) Representations for evolutionary algorithms. In: Proceedings of the 10th annual conference companion on Genetic and evolutionary computation, ACM, pp 2613–2638

  27. Sagarna R, Ong YS (2016) Concurrently searching branches in software tests generation through multitask evolution, IEEE, pp 1–8

  28. Tang J, Chen Y, Deng Z, Xiang Y, Joy CP (2018) A group-based approach to improve multifactorial evolutionary algorithm. In: IJCAI, pp 3870–3876

  29. Thanh PD (2018) CluSPT instances. Mendeley Data v2. https://doi.org/10.17632/b4gcgybvt6.2

  30. Thanh PD (2018) Results obtained by AAL, C-MFEA and E-MFEA. Mendeley Data v3, pp 40–50. https://doi.org/10.17632/8ktdhvyj82.3

  31. Thanh PD, Dung DA, Tien TN, Binh HTT (2018) An effective representation scheme in multifactorial evolutionary algorithm for solving cluster shortest-path tree problem. In: 2018 IEEE congress on evolutionary computation (CEC), pp 1–8. https://doi.org/10.1109/CEC.2018.8477684

  32. Thi Thanh Binh H, Dinh Thanh P, Ba Trung T, Phuong Thao L (2018) Effective multifactorial evolutionary algorithm for solving the cluster shortest path tree problem. In: 2018 IEEE congress on evolutionary computation (CEC), pp 1–8. https://doi.org/10.1109/CEC.2018.8477912

  33. Thompson E, Paulden T, Smith DK (2007) The dandelion code: a new coding of spanning trees for genetic algorithms. IEEE Trans Evol Comput 11(1):91–100

    Article  Google Scholar 

  34. Wen YW, Ting CK (2016) Learning ensemble of decision trees through multifactorial genetic programming. In: IEEE congress on evolutionary computation (CEC), IEEE, pp 5293–5300

  35. Wen YW, Ting CK (2017) Parting ways and reallocating resources in evolutionary multitasking. In: IEEE congress on evolutionary computation (CEC), IEEE, pp 2404–2411

  36. Wu BY, Lin CW (2015) On the clustered Steiner tree problem. J Combin Optim 30(2):370–386

    Article  MathSciNet  Google Scholar 

  37. Xie T, Gong M, Tang Z, Lei Y, Liu J, Wang Z (2016) Enhancing evolutionary multifactorial optimization based on particle swarm optimization. In: IEEE congress on evolutionary computation (CEC), IEEE, pp 1658–1665

  38. Yuan Y, Ong YS, Gupta A, Tan PS, Xu H (2016) Evolutionary multitasking in permutation-based combinatorial optimization problems: realization with tsp, qap, lop, and jsp. In: Region 10 conference (TENCON), IEEE, pp 3157–3164

  39. Zhong J, Feng L, Cai W, Ong YS (2018) Multifactorial genetic programming for symbolic regression problems. IEEE Trans Syst Man Cybern Syst 99:1–14

    Article  Google Scholar 

Download references

Acknowledgements

This research is funded by Tay Bac University for a natural science research project under Grant Number TB 2020-20.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Pham Dinh Thanh.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Ethical approval

This article does not contain any studies with human participants or animals performed by any of the authors.

Informed consent

Informed consent was obtained from all individual participants included in the study.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Huynh Thi Thanh, B., Pham Dinh, T. Two levels approach based on multifactorial optimization to solve the clustered shortest path tree problem. Evol. Intel. 15, 185–213 (2022). https://doi.org/10.1007/s12065-020-00501-w

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12065-020-00501-w

Keywords

Navigation