Learn More
The paper solves the 0–1 knapsack problem with the hybrid adaptive genetic algorithm which combined with greedy algorithm. It presents a method for optimal design of an improved adaptive genetic algorithm and repairs the infeasible solution with greedy algorithm. Experimental results show that the new algorithm has faster convergent speed, higher(More)
  • 1