Bài viết Cập nhật mô hình cho cầu giàn thép đường sắt sử dụng thuật toán tối ưu tiến hoá lai trình bày các nội dung chính sau: Thuật toán tối ưu HGAICS Thí nghiệm hiện trường để xác định các đặc trưng động học cầu Đò Lèn; Cập nhật mô hình cho cần giàn thép Đò Lèn sử dụng HGAICS | Tạp chí Khoa học Giao thông vận tải Tập 72 Số 8 10 2021 866-881 Transport and Communications Science Journal MODEL UPDATING FOR A RAILWAY BRIDGE USING A HYBRID EVOLUTIONARY OPTIMIZATION ALGORITHM Nguyen Manh Hai Tran Ngoc Hoa Bui Tien Thanh Tran Viet Hung Nguyen Duy Tien University of Transport and Communications No 3 Cau Giay Street Hanoi Vietnam ARTICLE INFO TYPE Research Article Received 31 07 2021 Revised 07 09 2021 Accepted 20 09 2021 Published online 15 10 2021 https Corresponding author Email nmhai@ Abstract. Cuckoo Search CS is a common evolutionary algorithm that has been employed to deal with numerous optimization problems over the last decades. However one of the fundamental disadvantages of the CS is that this algorithm fixes the velocities of the populations throughout the global search. This drawback restricts the flexibility in the movement of the populations. In addition CS not only depends mainly on the quality of the original population but also does not have capabilities such as crossover or mutation operators to improve the quality of the new generations. To deal with this shortcoming of traditional CS in this research an improved CS ICS combined with a genetic algorithm GA is proposed. To demonstrate the effectiveness of the proposed algorithm a hybrid evolutionary algorithm combined genetic algorithm with improved cuckoo search - HGAICS a large- scale truss bridge Do Len Bridge is employed. HGAICS is used to minimize the deviation between the numerical and measured results determine structural uncertain parameters. The obtained results show that HGAICS outperforms GA and CS in terms of accuracy and extremely reduces computational time compared with GA. Keywords Model updating Truss bridge CS GA Hybrid evolutionary algorithm. 2021 University of Transport and Communications 866 Transport and Communications Science Journal Vol 72 Issue 8 10 2021 866-881 Tạp chí Khoa học Giao thông vận tải CẬP NHẬT MÔ HÌNH .
