Preventive maintenance scheduling by variable dimension evolutionary algorithms

摘要

Black box optimization strategies have been proven to be useful tools for solving complex maintenance optimization problems. There has been a considerable amount of research on the right choice of optimization strategies for finding optimal preventive maintenance schedules. Much less attention is turned to the representation of the schedule to the algorithm. Either the search space is represented as a binary string leading to highly complex combinatorial problem or maintenance operations are defined by regular intervals which may restrict the search space to suboptimal solutions. An adequate representation however is vitally important for result quality. This work presents several nonstandard input representations and compares them to the standard binary representation. An evolutionary algorithm with extensions to handle variable length genomes is used for the comparison. The results demonstrate that two new representations perform better than the binary representation scheme. A second analysis shows that the performance may be even more increased using modified genetic operators. Thus, the choice of alternative representations leads to better results in the same amount of time and without any loss of accuracy.