Assembly sequence planning based on an improved harmony search algorithm. Issue 9 (June 2016)

• Record Type: Journal Article
• Authors: Li, Xinyu; Qin, Kai; Zeng, Bing; Gao, Liang; Su, Jiezhi
• Is Part Of: International journal of advanced manufacturing technology. Volume 84:Issue 9/12(2016)
• Page Start: 2367
• Page End: 2380
• Publication Date: 2016-06
• Subjects: Assembly sequences planning -- Improved harmony search -- Azimuth thruster -- Propeller; Manufacturing processes -- Periodicals; Production engineering -- Periodicals; 670.427
• DOI: 10.1007/s00170-015-7873-9
• Languages: English
• ISSNs: 0268-3768

Abstract

Abstract As a typical, discrete, and NP-hard problem, assembly sequence planning (ASP) has direct impact on assembly quality and costs. So far, lots of graph-based and meta-heuristic approaches cannot solve this problem effectively. This paper proposes an effective ASP algorithm based on the harmony search (HS) algorithm, which has an outstanding global search ability to obtain the global optimum more efficiently. To solve the ASP problem, an improved harmony search (IHS) algorithm is proposed mainly in four aspects: (1) an encoding of harmony is designed based on ASP problems; (2) an initial harmony memory (HM) is established using the opposition-based learning (OBL) strategy; (3) a particular way to improvise a new harmony is developed; and (4) a local search strategy is introduced to accelerate the convergence speed. Finally, the advantage of the proposed ASP algorithm over the competing algorithms in solving ASP problems is verified by two experiments. Moreover, the proposed ASP algorithm is applied to a practical problem, a propeller of azimuth thruster to verify its practicability.