Abstract

Facing globalization trends and sustainable industrial development, energy-aware distributed manufacturing has become an emerging topic. Meanwhile, welding is a kind of indispensable processing in the development of manufacturing and its effective scheduling can improve production efficiency and reduce energy consumption. However, it is difficult to solve the energy-aware distributed welding shop scheduling problem (EADWSP) due to the characteristics of large scale and multiple objectives. Thus, this paper presents a mathematical model and a cooperative memetic algorithm (CMA) to addresses the EADWSP with minimization both makespan and total energy consumption. To improve the quality and diversity of initial population, a hybrid initialization is developed with a modified NEH based heuristic. Via taking full advantage of historical information, a cooperative search based on feedback is designed and a cooperative selection strategy is employed to balance the exploration and exploitation. In addition, multiple problem-specific operators are presented and a local intensification with Q-learning is designed to enhance exploitation capability. Numerical experiments are carried out and the results demonstrate the effectiveness of the above specific designs. The comparisons to the existing algorithms show superiority of the proposed CMA. Moreover, the application to a real-life case also verifies the effectiveness and practicability in solving the EADWSP.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.