Artificial immune systems can find arbitrarily good approximations for the NP-hard number partitioning problem

Abstract

Typical artificial immune system (AIS) operators such as hypermutations with mutation potential and ageing allow to efficiently overcome local optima from which evolutionary algorithms (EAs) struggle to escape. Such behaviour has been shown for artificial example functions constructed especially to show difficulties that EAs may encounter during the optimisation process. However, no evidence is available indicating that these two operators have similar behaviour also in more realistic problems. In this paper we perform an analysis for the standard NP-hard Partition problem from combinatorial optimisation and rigorously show that hypermutations and ageing allow AISs to efficiently escape from local optima where standard EAs require exponential time. As a result we prove that while EAs and random local search (RLS) may get trapped on 4/3 approximations, AISs find arbitrarily good approximate solutions of ratio (1+ϵ) within n(ϵ−(2/ϵ)−1)(1−ϵ)−2e322/ϵ+2n322/ϵ+2n3 function evaluations in expectation. This expectation is polynomial in the problem size and exponential only in 1/ϵ. To the best of our knowledge this is the first time performance guarantees of any AIS are proven for a classical combinatorial optimisation problem.