Landing Gear Disassembly Sequence Planning using Multi-Level Constraint Matrix Ant Colony Algorithm

Authors

  • E.G. Okafor Air Force Insti of Tech.
  • P.O. Jemitola Faculty of Air Engineering, Air Force Institute of Technology, NAF Base, Kaduna, Nigeria
  • O.C. Ubadike Faculty of Air Engineering, Air Force Institute of Technology, NAF Base, Kaduna, Nigeria
  • M.T. Abba Faculty of Air Engineering, Air Force Institute of Technology, NAF Base, Kaduna, Nigeria
  • H.M. Mohammed Faculty of Air Engineering, Air Force Institute of Technology, NAF Base, Kaduna, Nigeria

Keywords:

Algorithm, Constraint matrix, Disassembly sequencing planning, Maintenance, Optimization

Abstract

The life cycle of most complex engineering systems is greatly a function of maintenance. Generally, most maintenance operation usually requires the removal of failed part. Disassembly sequence planning is an optimization program that seeks to identify the optimal sequence for the removal of the failed part. Most studies in this area usually, use single constraint matrix while implementing varied complex algorithm to identify the optimal sequence that saves time associated with carrying out maintenance operation. The used of single constraint matrix typically has the drawback of computer higher storage requirement as well as time consumption. To address this problem, this study proposes Multi-Level Constraint Matrix Ant Colony Algorithm (MLCMACA). MLCMACA efficiency was validated using complex aircraft landing gear systems in comparison with genetic algorithms. The result shows MLCMACA superior performance from the perspective of reduced search time and faster tracking of optimal disassembly sequence. Hence is recommended for handling of disassembly sequence planning problems.

Downloads

Published

2021-08-29

Issue

Section

Chemical, Industrial, Materials, Mechanical, Metallurgical, Petroleum & Production Engineering