Advertisement

Assembly sequence optimization using a flower pollination algorithm-based approach

  • 855 Accesses

  • 7 Citations

Abstract

One of the important decisions in assembly process planning is determination of assembly sequence. Choice of the optimum sequence is made difficult due to various reasons. There are various precedence constraints and optimization criteria. Moreover, a product may be possible to assemble in many alternative ways following different sequences, thus making assembly sequence optimization a multi-modal optimization problem with multiple optimum solutions. It is necessary to generate as many unique optimum solutions as possible in order to allow the process planner to take a decision. Moreover, with increase in part count, the number of feasible sequences rises staggeringly, thereby making assembly sequence optimization laborious and time consuming. Most conventional mathematical algorithms are known to perform poorly when used to obtain multiple optimum solutions. On the other hand, soft computing based evolutionary optimization algorithms are good candidates for multi-modal optimization. Another challenge is to develop an algorithm that can automatically maintain diversity in the optimum solutions found over the generations (i.e. optimum solutions having the same fitness but unique). Keeping the above in mind, in the present paper, an intelligent assembly sequence optimization methodology based on application of flower pollination algorithm (FPA) has been developed to automatically generate multiple unique optimal assembly sequences, subject to various precedence constraints, based on minimisation of number of orientation changes and tool changes. Since in the present paper, FPA has been applied for the first time to a discrete optimization problem like assembly sequence optimization, the main challenge before us in applying FPA was the continuous nature of the original FPA. Therefore, modifications have been made by us in the rules for local and global pollination of FPA to make it suited for solving the given discrete optimization problem. In order to evaluate the performance of FPA, the results have been compared with two other well-known soft computing techniques namely, Genetic Algorithm (GA) and Ant Colony Optimization (ACO) and also with a recently published soft computing based algorithm, Improved Harmony Search (IHS). It was found that the novelty of the proposed FPA lies in its capability to find multiple unique optimum solutions in one single simulation run and capability to automatically maintain diversity in the optimum solutions found over the generations. On the other hand, in case of GA, ACO and IHS, it is not possible to maintain the diversity in multiple optimum solutions as the complete population finally converges to a few unique optimum solutions. Therefore, it can be concluded that FPA performs better in solving the given multi-modal optimization problem of assembly sequence optimization.

This is a preview of subscription content, log in to check access.

Access options

Buy single article

Instant unlimited access to the full article PDF.

US$ 39.95

Price includes VAT for USA

Subscribe to journal

Immediate online access to all issues from 2019. Subscription will auto renew annually.

US$ 99

This is the net price. Taxes to be calculated in checkout.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

References

  1. Abramowitz, M., & Stegun, I. A. (1964). Handbook of mathematical functions with formulas, graphs, and mathematical tables. USA: National Bureau of Standards Applied Mathematics Series.

  2. Baeck, T., Fogel, D. B., & Michalewicz, Z. (2000). Evolutionary computation 1: Basic algorithms and operators. London: Taylor and Francis.

  3. Bonneville, F., Perrard, C., & Henrioud, J. M. (1995). A genetic algorithm to generate and evaluate assembly plans. In Proceedings of INRIA/IEEE symposium on emerging technologies and factory automation, pp. 231–239, Paris, France.

  4. Boothroyd, G. (2005). Assembly automation and product design (2nd ed.). Florida: Taylor and Francis, CRC Press.

  5. Cao, P. B., & Xiao, R. B. (2007). Assembly planning using a novel immune approach. International Journal of Advanced Manufacturing Technology, 31, 770–782.

  6. Chen, S., & Liu, Y. J. (2001). An adaptive genetic assembly sequence planner. International Journal of Computer Integrated Manufacturing, 14(5), 489–500.

  7. Chen, S., & Montgomery, J. (2011). A simple strategy to maintain diversity and reduce crowding in particle swarm optimization, vol. 7106 of the series lecture notes in computer science, pp. 281–290.

  8. Choi, Y. K., Lee, D. M., & Cho, Y. B. (2009). An approach to multi-criteria assembly sequence planning using genetic algorithms. International Journal of Advanced Manufacturing Technology, 42, 180–188.

  9. Design for Assembly Tool kit, Release 9.4. (2010). Boothroyd Dewhurst Inc., Wakefield, Rhode Island, USA.

  10. Dubey, H. M., Pandit, M., & Panigrahi, B. K. (2015). A biologically inspired modified flower pollination algorithm for solving economic dispatch problems in modern power systems. Cognitive Computation. doi:10.1007/s12559-015-9324-1.

  11. Gao, L., Qian, W. R., Li, X. Y., & Wang, J. F. (2010). Application of memetic algorithm in assembly sequence planning. International Journal of Advanced Manufacturing Technology, 49, 1175–1184.

  12. Jimenez, P. (2013). Survey on assembly sequencing: A combinatorial and geometrical perspective. Journal of Intelligent Manufacturing, 24(2), 235–250.

  13. Kashkoush, M., & ElMaraghy, H. (2013). Consensus tree method for generating master assembly sequence. Production Engineering Research Development, 8, 233–242.

  14. Li, M., Wu, B., Hu, Y., Jin, C., & Shi, T. (2013). A hybrid assembly sequence planning approach based on discrete particle swarm optimization and evolutionary direction operation. International Journal of Advanced Manufacturing Technology, 68, 617–630.

  15. Li, X., Qin, K., Zeng, B., Gao, L., & Su, J. (2016). Assembly sequence planning based on an improved harmony search algorithm. International Journal of Advanced Manufacturing Technology, 84, 2367–2380.

  16. Lv, H. G., & Lu, C. (2010). An assembly sequence planning approach with a discrete particle swarm optimization algorithm. International Journal of Advanced Manufacturing Technology, 50, 761–770.

  17. Marian, R. M., Luong, L. H., & Abhary, K. (2006). A genetic algorithm for the optimization of assembly sequences. Computers & Industrial Engineering, 50, 503–527.

  18. Sabarinath, P., Karthick, R., Thansekhar, M. R., & Saravanan, R. (2015). Energy conservation by design optimization of flywheel using flower pollination algorithm. Proceedings ofnational conference on recent trends and developments in sustainable green technologies, pp. 166–171, Chennai, India.

  19. Tiwari, M. K., Prakash, A., & Mileham, A. R. (2005). Determination of an optimal assembly sequence using the psychoclonal algorithm. Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture, 219, 137–149.

  20. Tseng, H. E., Wang, W. P., & Shih, H. Y. (2007). Using memetic algorithms with guided local search to solve assembly sequence planning. Expert Systems with Applications, 33, 451–467.

  21. Wang, J. F., Liu, J. H., & Zhong, Y. F. (2005). A novel ant colony algorithm for assembly sequence planning. International Journal of Advanced Manufacturing Technology, 25, 1137–1143.

  22. Wang, Y., & Liu, J. H. (2010). Chaotic particle swarm optimization for assembly sequence planning. Robotics and Computer-Integrated Manufacturing, 26, 212–222.

  23. Wang, H., Rong, Y., & Xiang, D. (2014). Mechanical assembly planning using ant colony optimization. Computer-Aided Design, 47, 59–71.

  24. Xing, Y. F., & Wang, Y. S. (2012). Assembly sequence planning based on a hybrid particle swarm optimisation and genetic algorithm. International Journal of Production Research, 50(24), 7303–7312.

  25. Yang, X.-S. (2012). Flower pollination algorithms. In X.-S. Yang (Ed.), Nature-inspired optimization algorithms (pp. 155–173). London: Elsevier.

  26. Yu, J., & Wang, C. (2013). A max-min ant colony system for assembly sequence planning. International Journal of Advanced Manufacturing Technology, 67, 2819–2835.

  27. Zhang, H., Liu, H., & Li, L. (2014). Research on a kind of assembly sequence planning based on immune algorithm and particle swarm optimization algorithm. International Journal of Advanced Manufacturing Technology, 71, 795–808.

  28. Zhou, W., Zheng, J. R., Yan, J. J., & Wang, J. F. (2011). A novel hybrid algorithm for assembly sequence planning combining bacterial chemotaxis with genetic algorithm. International Journal of Advanced Manufacturing Technology, 52, 715–724.

Download references

Author information

Correspondence to Sankha Deb.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Mishra, A., Deb, S. Assembly sequence optimization using a flower pollination algorithm-based approach. J Intell Manuf 30, 461–482 (2019) doi:10.1007/s10845-016-1261-7

Download citation

Keywords

  • Assembly sequence optimization
  • Computer-aided process planning
  • Evolutionary optimization algorithms
  • Flower pollination algorithm (FPA)