A Genetic Algorithm with Repair Actions and Local Optimization for Discrete Resource Allocation Problem Which Has Alternative Plans
For the discrete resource allocation problem with alternative plans and the benefits increasing with increasing resource usage,the optimization model for integer variable is created.Due to the variable appears in the subscript,it cannot be solved by classical optimization algorithm.A genetic algorithm with repair action and local optimization was proposed in this paper: sort the alternative plans for each department from large to small according to its benefit contribution,and on this basis,the repair strategy for infeasible solution and local optimization strategy for feasible solution is given.The repair strategy for infeasible solution can make each individual in population to be feasible solution,so it can avoid selection of penalty coefficient.And local optimization for feasible solution can improve the solution”s fitness,and then improve the computational efficiency.This paper uses partial elitism strategy and random selection strategy to update population,and because of the partial elitism strategy,the excellent individuals from new population will not be worse than the excellent individuals from original population and it can be guaranteed that excellent individuals generated in the process of genetic will not be gained by the crossover and mutation operation,local optimal individual is not easy to be eliminated and using random selection strategy can keep certain diversity for the next generation.
Resource allocation Discrete Integer variable Repair Local optimization Genetic algorithm
Qi-Rong QIU Ya-Mei DI
College of Mathematics,North China Electric University,Beijing 102206,China
国内会议
杭州
英文
1-7
2014-10-18（万方平台首次上网日期，不代表论文的发表时间）