This paper introduces a solution method for the multimission selective maintenance problem (SMP) that combines column-generation (CG) and genetic algorithms (GAs). The multimission SMP is an optimisation problem that arises… Click to show full abstract
This paper introduces a solution method for the multimission selective maintenance problem (SMP) that combines column-generation (CG) and genetic algorithms (GAs). The multimission SMP is an optimisation problem that arises when a system performs a sequence of missions separated by breaks of finite duration. During these finite breaks, only a subset of possible maintenance actions can be performed due to resource limitations. The problem is in deciding what actions to perform during each break duration such that the system meets or exceeds a minimum target reliability for all missions. The resulting optimisation problems are usually modelled as mixed integer nonlinear mathematical programmes, which are hard to solve. They are usually solved using metaheuristics. We propose a solution method based on CG framework in which the subproblems are solved using a GA. By integrating the GA within the classical CG framework, high-quality solutions can be obtained very quickly. The proposed solution method is capable of solving systems composed of both parallel and k-out-of-n:G subsystems. This hybrid CG algorithm is shown to obtain near optimal solutions and outperform other metaheuristic solution methods; it is also shown to be capable of solving large-scale systems composed of many subsystems and hundreds of components in a reasonable amount of time.
               
Click one of the above tabs to view related content.