This paper presents an improved genetic algorithm (GA) for solving the subset sum problem (SSP). Unlike a conventional GA, the proposed algorithm performs conditional (and not probable) crossover and mutation. Simulation results show that the proposed GA is capable of finding an optimal solution for the SSP.
Read full abstract