Thông tin chung
  English
  Đề tài NC khoa học
  Bài báo, báo cáo khoa học
  Hướng dẫn Sau đại học
  Sách và giáo trình
  Các học phần và môn giảng dạy
  Giải thưởng khoa học, Phát minh, sáng chế
  Khen thưởng
  Thông tin khác
  Tài liệu tham khảo
  Hiệu chỉnh
 
Số người truy cập: 107,068,542

 An efficient evolutionary algorithm for joint optimization of maintenance grouping and routing
Tác giả hoặc Nhóm tác giả: Ho Si Hung Nguyen;Phuc Do;Hai-Canh Vu;Thanh Bac Le;Kim Anh Nguyen
Nơi đăng: 2020 5th International Conference on Green Technology and Sustainable Development (GTSD). IEEE; Số: 10.1109/GTSD50082.2020.9303076;Từ->đến trang: 604-611;Năm: 2020
Lĩnh vực: Chưa xác định; Loại: Báo cáo; Thể loại: Quốc tế
TÓM TẮT
ABSTRACT
Geographically Dispersed Production System (GDPS) is a system network in which production sites are located far away from each other and subjected to management of an administration center. In maintenance planning for such system, planners intend to group maintenance activities to save preparation cost and transportation cost. Specially, this work is extremely meaningful in framework of sustainability (reduction of environmental pollution). In fact, when grouping maintenance activities of components located at different sites, maintenance resources need to be travelled from the maintenance center to the production sites where these components are located on, and then come back to the maintenance center when the maintenance is completed. By that way, travel distance as well as emissions from means of transports can reduce compared to individual maintenance. Although grouping maintenance has the positive impacts, it causes difficulties due to the shift of maintenance dates of components. Moreover, maintenance planning optimization for a GDPS is multi-groups and multiroutes problem. Hence, optimizing maintenance grouping and routing for GDPS should be considered simultaneously. However, the joint optimization leads to be a NP-hard problem to be solved. To face this issue, in this paper an evolutionary algorithm based on Genetic Algorithm (GA) and Branch and Bound algorithm (BAB), named GA-BAB, is developed. The numerical study shows that the proposed algorithm can efficiently solve maintenance grouping and routing optimization problem in a GDPS context.
© Đại học Đà Nẵng
 
 
Địa chỉ: 41 Lê Duẩn Thành phố Đà Nẵng
Điện thoại: (84) 0236 3822 041 ; Email: dhdn@ac.udn.vn