References in periodicals archive ?
In recent years, the genetic algorithms for solving NP hard problems have achieved great results [1] [2] [3] [4].
The 0/1 Knapsack Problem is a well-known NP hard problem [8] [9] [10] [11] as it appears in many real life world with different application.