Effects of Archive Size on Computation Time and Solution Quality for Multiobjective Optimization

An unbounded external archive has been used to store all nondominated solutions found by an evolutionary multiobjective optimization algorithm in some studies. It has been shown that a selected solution subset from the stored solutions is often better than the final population. However, the use of the unbounded archive is not always realistic. When the number of examined solutions is huge, we must prespecify the archive size. In this study, we examine the effects of the archive size on three aspects: 1) the quality of the selected final solution set; 2) the total computation time for the archive maintenance and the final solution set selection; and 3) the required memory size. Unsurprisingly, the increase of the archive size improves the final solution set quality. Interestingly, the total computation time of a medium-size archive is much larger than that of a small-size archive and a huge-size archive (e.g., an unbounded archive). To decrease the computation time, we examine two ideas: 1) periodical archive update and 2) archiving only in later generations. Compared with updating the archive at every generation, the first idea can obtain almost the same final solution set quality using a much shorter computation time at the cost of a slight increase of the memory size. The second idea drastically decreases the computation time at the cost of a slight deterioration of the final solution set quality. Based on our experimental results, some suggestions are given about how to appropriately choose an archiving strategy and an archive size.