An advanced evolutionary algorithm integrating genetic algorithm and branch and bound for joint maintenance grouping and routing optimization

https://doi.org/10.31130/ud-jst.2025.23(6A).264E

Tóm tắt: 40 | PDF: 25

##plugins.themes.academic_pro.article.main##

Author

  • Thi-Hoang-Giang Tran
    The University of Danang - University of Science and Technology, Vietnam
    Ho-Si-Hung Nguyen
    The University of Danang - University of Science and Technology, Vietnam

Từ khóa:

Geographically dispersed production system
maintenance plan
branch and bound algorithm
genetic algorithm
advanced evolutionary algorithm

Tóm tắt

In recent years, growing international trade and advancements in distributed control, information, and logistics have led to the development of geographically dispersed production systems (GDPS). The GDPS is a production network in which production is carried out across several sites located far apart from each other. Optimizing the maintenance plan for such a system requires considering the potential for grouping maintenance tasks and the impact of maintenance itineraries on transportation costs. A joint optimization between maintenance grouping and routing is essential to reduce both preparation and transportation costs. This paper proposes an advanced evolutionary algorithm integrating the Genetic Algorithm (GA) and Branch and Bound (BAB), called GaB. The proposed algorithm’s effectiveness is demonstrated with a numerical example of a typical GDPS with five sites. Results show a 7.44% cost saving compared to individual maintenance and a 59% reduction in computational time compared to the comprehensive search approach.

Tài liệu tham khảo

    [1] R. Dekkert, A. Smit, and J. Losekoot, “Combining maintenance activities in an operational planning phase: a set-partitioning approach”, IMA Journal of Management Mathematics, vol. 3, no. 4, pp. 315-331, 1991.
    [2] R. Dekker, R. E. Wildeman, and F. A. Van der Duyn Schouten, “A review of multi-component maintenance models with economic dependence”, Mathematical Methods of Operations Research, vol. 45, no. 3, pp. 411–435, 1997.
    [3] Z. Hameed and K. Wang, “Development of optimal maintenance strategies for offshore wind turbine by using artificial neural network”, Wind Engineering, vol. 36, no. 3, pp. 353–364, 2012.
    [4] R. Liu, Y. Tao, and X. Xie, “An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and synchronized visits”, Computers & Operations Research, vol. 101, pp. 250–262, 2019.
    [5] A. Moura, “A model-based heuristic to the vehicle routing and loading problem”, International Transactions in Operational Research, vol. 26, no. 3, pp. 888–907, 2019.
    [6] M. Soto, M. Sevaux, A. Rossi, and A. Reinholz, “Multiple neighborhood search, tabu search and ejection chains for the multi-depot open vehicle routing problem”, Computers & Industrial Engineering, vol. 107, pp. 211–222, 2017.
    [7] M. Gendreau, G. Laporte, and F. Semet, “A branch-and-cut algorithm for the undirected selective traveling salesman problem”, Networks: An International Journal, vol. 32, no. 4, pp. 263–273, 1998.
    [8] G. Laporte, “The traveling salesman problem: An overview of exact and approximate algorithms”, European Journal of Operational Research, vol. 59, no. 2, pp. 231–247, 1992.
    [9] E. Lopez-Santana, R. Akhavan-Tabatabaei, L. Dieulle, N. Labadie, and A. L. Medaglia, “On the combined maintenance and routing optimization problem”, Reliability Engineering & System Safety, vol. 145, pp. 199–214, 2016.
    [10] M. Stålhane, L. M. Hvattum, and V. Skaar, “Optimization of routing and scheduling of vessels to perform maintenance at offshore wind farms”, Energy Procedia, vol. 80, pp. 92–99, 2015.
    [11] L. Dai, M. Stålhane, and I. B. Utne, “Routing and scheduling of maintenance fleet for offshore wind farms”, Wind Engineering, vol. 39, no. 1, pp. 15–30, 2015.
    [12] E. López-Santana, G. Méndez, and C. Franco, "On the multi-period combined maintenance and routing optimisation problem", International Journal of Production Research, vol. 61, no. 23, pp. 8265-8290, 2023.
    [13] F. Delavernhe, B. Castanier, C. Guéret, and J. E. Mendoza, "The joint maintenance operation selection and technician routing problem", Computers & Operations Research, vol. 167, pp. 106667, 2024.
    [14] D. Moros, N. Berrabah, I. Ashton, K. Searle, and I. Lazakis, "A Multi-timescale Framework for Maintenance Planning at Offshore Wind Farms", SSRN, vol. 5147352, 2025.
    [15] H. S. H. Nguyen, P. Do, H.-C. Vu, T. B. Le, and K. A. Nguyen, “An efficient evolutionary algorithm for joint optimization of maintenance grouping and routing”, in 2020 5th International Conference on Green Technology and Sustainable Development (GTSD), IEEE, 2020, pp. 604–611.
    [16] S. Vukmirović, Z. Čapko, and A. Babić, "Model of using the exhaustive search algorithm in solving of traveling salesman problem (tsp) on the example of the transport network optimization of Primorje-Gorski Kotar County (PGC)", Journal of Corporate Governance, Insurance, and Risk Management, vol. 6, no. 2, 2019.
    [17] P. Do, A. Barros, C. Bérenguer, K. Bouvard, and F. Brissaud, "Dynamic grouping maintenance with time limited opportunities", Reliability Engineering & System Safety, vol. 120, pp. 51-59, 2013.
    [18] R. Reichwald, C. M. Stotko, and F. T. Piller, “Distributed mini-factory networks as a form of real-time enterprise: concept, flexibility potential and case studies”, in The Practical Real-Time Enterprise, Berlin, Heidelberg: Springer Berlin Heidelberg, pp. 403–434, 2005.
Xem thêm

##plugins.themes.academic_pro.article.sidebar##

Đã Xuất bản

Jun 30, 2025
Download
PDF (English)
Cách trích dẫn
Tran, T.-H.-G., và H.-S.-H. Nguyen. “An Advanced Evolutionary Algorithm Integrating Genetic Algorithm and Branch and Bound for Joint Maintenance Grouping and Routing Optimization”. Tạp Chí Khoa học Và Công nghệ - Đại học Đà Nẵng, vol 23, số p.h 6A, Tháng Sáu 2025, tr 14-22, doi:10.31130/ud-jst.2025.23(6A).264E.

##plugins.themes.academic_pro.article.details##