A Comparison of Gas Using Penalizing Infeasible Solutions and Repairing Infeasible Solutions on Average Capacity Knapsack

摘要

Different constraint handling techniques have been incorporated with genetic algorithms (Gas), however most of current studies are based on computer experiments. The paper makes an theoretical analysis of Gas using penalizing infeasible solutions and repairing infeasible solutions on average knapsack problem. It is shown that Gas using the repair method is more efficient than Gas using the penalty method on average capacity knapsack problems.