Skip to main content

Advertisement

SpringerLink
Log in

An efficient strategy for using multifactorial optimization to solve the clustered shortest path tree problem

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

Arising from the need of all time for optimization of irrigation systems, distribution network and cable network, Clustered Shortest-Path Tree Problem (CluSPT) has been attracting a lot of attention and interest from the research community. On the other hand, the Multifactorial Evolutionary Algorithm (MFEA) is one of the most recently exploited realms of Evolutionary Algorithms (EAs) and its performance in solving optimization problems has been very promising. Considering these characteristics, this paper describes a new approach using the MFEA for solving the CluSPT. The MFEA has two tasks: the goal of the first task is to determine the best tree (w.r.t. cost minimization) which envelops all vertices of the CluSPT while the goal of the second task is to find the fittest solution possible for the problem. The purpose of the second task is to find good materials for implicit genetic transfer process in MFEA to improve the quality of CluSPT. To apply this new algorithm, a decoding scheme for deriving individual solutions from the unified representation in the MFEA is also introduced in this paper. Furthermore, evolutionary operators such as population initialization, crossover and mutation operators are also proposed. These operators are applicable for constructing valid solution from both sparse and complete graph. Although the proposed algorithm is slightly complicated for implementation, it can enhance ability to explore and exploit the Unified Search Space (USS). To prove this increment in performance i.e, 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 existing heuristic algorithms in most of the test cases. The impact of the proposed MFEA was analyzed and a possible influential factor that may be useful for further study was also pointed out.

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

Access this article

Log in via an institution

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

Similar content being viewed by others

References

  1. Abualigah L M, Khader A T (2017) Unsupervised text feature selection technique based on hybrid particle swarm optimization algorithm with genetic operators for the text clustering. J Supercomput 73(11):4773–4795

    Article  Google Scholar 

  2. Abualigah LMQ (2019) Feature selection and enhanced krill herd algorithm for text document clustering. Springer, Berlin

    Book  Google Scholar 

  3. 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

  4. Bali KK, Ong YS, Gupta A, Tan PS (2019) Multifactorial Evolutionary Algorithm with Online Transfer Parameter Estimation: MFEA-II. IEEE Transactions on Evolutionary Computation

  5. 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

    Article  MathSciNet  Google Scholar 

  6. Binh H T, Thanh P D, Trung T B, et al. (2018) Effective multifactorial evolutionary algorithm for solving the cluster shortest path tree problem. In: In: 2018 IEEE Congress on Evolutionary Computation (CEC). IEEE, pp 1–8

  7. Binh H T T, Thanh P D, Thang T B (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 

  8. Chandra R, Gupta A, Ong Y S, Goh C K (2018) Evolutionary multi-task learning for modular knowledge representation in neural networks. Neural Process Lett 47(3):993–1009

    Article  Google Scholar 

  9. D’Emidio M, Forlizzi L, Frigioni D, Leucci S, Proietti G (2016) On the Clustered Shortest-Path Tree Problem. In: Italian Conference on Theoretical Computer Science (ICTCS), pp 263–268

  10. 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 Comb Optim 38:165–184

    Article  MathSciNet  Google Scholar 

  11. Eiben A, Smith J (2015) Evolutionary computing: the origins. Springer, Berlin

    Google Scholar 

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

    Article  Google Scholar 

  13. Gupta A, Mańdziuk J, Ong Y S (2015) Evolutionary multitasking in bi-level optimization. Compl Intell Syst 1(1-4):83–95

    Article  Google Scholar 

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

    Article  Google Scholar 

  15. Liaw RT, Ting CK (2017) Evolutionary many-tasking based on biocoenosis through symbiosis: A framework and benchmark problems. In: 2017 IEEE Congress on Evolutionary Computation (CEC). IEEE, pp 2266–2273

  16. Lin C W, Wu B Y (2016) On the minimum routing cost clustered tree problem. J Comb Optim 33 (3):1106–1121

    Article  MathSciNet  Google Scholar 

  17. Martí R, Pardalos PM, Resende MG (2018) Handbook of Heuristics. Springer, Berlin

  18. Mestria M (2018) New hybrid heuristic algorithm for the clustered traveling salesman problem. Comput Ind Eng 116:1–12

    Article  Google Scholar 

  19. Mestria M, Ochi LS, de Lima Martins S (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. Moharam R, Morsy E (2017) Genetic algorithms to balanced tree structures in graphs. Swarm Evol Comput 32:132–139

    Article  Google Scholar 

  21. Myung Y S, Lee C H, Tcha D W (1995) On the generalized minimum spanning tree problem. Networks 26(4):231–241

    Article  MathSciNet  Google Scholar 

  22. Ong Y S, Gupta A (2016) Evolutionary multitasking: a computer science view of cognitive multitasking. Cogn Comput 8(2):125–142

    Article  Google Scholar 

  23. Pham D T, Huynh TTB (2015) An effective combination of genetic algorithms and the variable neighborhood search for solving travelling salesman problem. In: 2015 Conference on technologies and applications of artificial intelligence (TAAI). IEEE, pp 142–149

  24. Pham DT, Huynh TTB (2015) An effective combination of genetic algorithms and the variable neighborhood search for solving travelling salesman problem. In: 2015 Conference on Technologies and Applications of Artificial Intelligence (TAAI). IEEE, pp 142–149

  25. Pop PC (2019) The generalized minimum spanning tree problem: An overview of formulations, solution procedures and latest advances. European Journal of Operational Research. https://doi.org/10.1016/j.ejor.2019.05.017, http://www.sciencedirect.com/science/article/pii/S0377221719304217

    Article  MathSciNet  Google Scholar 

  26. Prim R C (1957) Shortest connection networks and some generalizations. Bell Labs Techn J 36(6):1389–1401

    Article  Google Scholar 

  27. 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 

  28. Raidl G R, Julstrom B A (2003) Edge sets: an effective evolutionary coding of spanning trees. IEEE Trans Evol Comput 7(3):225– 239

    Article  Google Scholar 

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

  30. Shu-Xi W (2012) The improved dijkstra’s shortest path algorithm and its application. Procedia Eng 29:1186–1190

    Article  Google Scholar 

  31. Thanh PD (2019) CluSPT instances. Mendeley Data v3. https://doi.org/10.17632/b4gcgybvt6.3

  32. Thanh PD, Binh HTT, Lam BT (2015) New mechanism of combination crossover operators in genetic algorithm for solving the traveling salesman problem. In: Knowledge and Systems Engineering. Springer, pp 367–379

  33. Thanh P D, Dung D A, Tien T N, Binh H T T (2018) An effective representation scheme in multifactorial evolutionary algorithm for solving cluster shortest-path tree problem. In: 2018 IEEE Congress on Evolutionary Computation (CEC). IEEE, pp 1–8

  34. Thanh P D, Binh H T T, Long N B et al (2019) A heuristic based on randomized greedy algorithms for the clustered shortest-path tree problem. In: 2019 IEEE Congress on Evolutionary Computation (CEC). IEEE, pp 2915–2922

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

  36. Wu B Y, Lin C W (2015) On the clustered Steiner tree problem. J Comb Optim 30(2):370–386

    Article  MathSciNet  Google Scholar 

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

  38. Zhang T, Ke L, Li J, Li J, Huang J, Li Z (2018) Metaheuristics for the tabu clustered traveling salesman problem. Comput Oper Res 89:1–12

    Article  MathSciNet  Google Scholar 

  39. Zhou L, Feng L, Zhong J, Ong Y S, Zhu Z, Sha E (2016) Evolutionary multitasking in combinatorial search spaces: a case study in capacitated vehicle routing problem. In: 2016 IEEE Symposium Series on Computational intelligence (SSCI). IEEE, pp 1-8

Download references

Acknowledgements

This research was sponsored by the U.S. Army Combat Capabilities Development Command (CCDC) Pacific and CCDC Army Research Laboratory (ARL) under Contract Number W90GQZ-93290007. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the CCDC Pacific and CCDC ARL and the U.S. Government. The U.S. Government is authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation hereon.

Author information

Authors and Affiliations

  1. Faculty of Mathematics - Physics - Informatics, Taybac University, Son La, Vietnam

    Pham Dinh Thanh

  2. School of Information and Communication Technology, Hanoi University of Science and Technology, Hanoi, Vietnam

    Huynh Thi Thanh Binh & Tran Ba Trung

Authors
  1. Pham Dinh Thanh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Huynh Thi Thanh Binh
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Tran Ba Trung
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Huynh Thi Thanh Binh.

Ethics declarations

Conflict of interests

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

Thanh, P.D., Binh, H.T.T. & Trung, T.B. An efficient strategy for using multifactorial optimization to solve the clustered shortest path tree problem. Appl Intell 50, 1233–1258 (2020). https://doi.org/10.1007/s10489-019-01599-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-019-01599-x

Keywords

Search

Navigation