An enhanced harmony search algorithm for assembly sequence planning
by Lijian Wang; Yuxing Hou; Xinyu Li; Shuai Sun
International Journal of Modelling, Identification and Control (IJMIC), Vol. 18, No. 1, 2013

Abstract: Assembly sequence planning (ASP) plays a critical role in manufacturing and product design. A good assembly sequence can help reduce the cost and time of manufacturing process. However, ASP is difficult to be tackled; the size of the search space of assembly sequences is exponentially proportional to the number of components of assembly products. Compared with traditional graph-based algorithm, the intelligent optimisation algorithms have exhibited their advantages in finding optimal assembly sequence. In this paper, harmony search (HS) is proposed to help solve the ASP problem. HS algorithm has been successfully applied to continuous-variable as well as combinatorial optimisation problems. To further strengthen the optimisation performance and be more effectively used for ASP problem, the proposed method incorporates the largest position value (LPV) rule and an efficient switching strategy of local search. The developed approach is validated with an illustrative example and the results are compared with those obtained using traditional genetic algorithm (GA) and memetic algorithm (MA). The result shows the proposed approach has achieved significant improvement.

Online publication date: Thu, 31-Jul-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Modelling, Identification and Control (IJMIC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com