Genetic Algorithm Java

Question

There's a set of boxes to be delivered, each box has a value and weight, there's one delivery vehicle, there's capacity for total weight a vehicle can carry and a quota, minimum value you want to carry at one time, the problem is to find a subset of the objects whose total weight is at most equal to the capacity and total value is least equal to the quota, (e.g Object A- weight 70 value 80, object B-weight 50 value 50, Object C- weight 50, value 50) capacity is 110 and quota is 90, the solution would be {B,C}... I need assistance with this question, thanks

Answer 1

At least try and show the code you have written