Research on genetic algorithms for the discounted {0-1} knapsack problem

被引：0
|
作者：
He Y.-C. [1 ]
Wang X.-Z. [2 ]
Li W.-B. [3 ]
Zhang X.-L. [4 ]
Chen Y.-Y. [1 ]
机构：
[1] College of Information Engineering, Shijiazhuang University of Economics, Shijiazhuang
[2] College of Computer Science and Software Engineering, Shenzhen University, Shenzhen, 518060, Guangdong
[3] Laboratory of Network and Information Security, Shijiazhuang University of Economics, Shijiazhuang
[4] College of Mathematics and Information Science, Hebei Normal University, Shijiazhuang
来源：
| 2016年 / Science Press卷 / 39期
关键词：
Discounted {0-1} knapsack problem; Genetic algorithm; Greedy strategy; Non-normal coding individual; Repair and optimization;
D O I：
10.11897/SP.J.1016.2016.02614
中图分类号：
学科分类号：
摘要：
At present, the deterministic algorithm based on dynamic programming is the main method for solving the discounted {0-1} knapsack problem (D{0-1}KP). But its complexity is pseudo polynomial time, and when the value coefficients and the weight coefficients of the D{0-1}KP instance are in a large range, the deterministic algorithm is no longer practical. In this paper, we use genetic algorithm with elitist reservation strategy (EGA) to solve the D{0-1}KP. Firstly, we establish two new mathematical models of the D{0-1}KP. Secondly, in order to use EGA to solve the D{0-1}KP based on the first mathematical model, we propose a greedy repair and optimization algorithm (GROA) to deal with the non-normal coding individual. Combining EGA with GROA, we give the first genetic algorithm (FirEGA) for solving the D{0-1}KP. Thirdly, for solving the D{0-1}KP by EGA and the second mathematical model, we propose another algorithm named NROA, which is an greedy repair and optimization algorithm too, to deal with the non-normal coding individual, and give the second genetic algorithm (SecEGA) for solving the D{0-1}KP based on EGA and NROA. Finally, we ascertain the reasonable values of the crossover probability and the mutation probability of the FirEGA and SecEGA on the basis of the computational results of four kinds instances of D{0-1}KP. The computational results show that FirEGA and SecEGA are fit for solving the large instance of the hard D{0-1}KP, and they can obtain an approximation solution whose approximation rate is close to 1. Furthermore, the average performance of FirEGA is more efficient than SecEGA. © 2016, Science Press. All right reserved.
引用
收藏
页码：2614 / 2630
页数：16
相关论文
共 30 条
  • [1] Singh A., Elements of Computation Theory, (2009)
  • [2] Du D.-Z., Ko K.-I., Theory of Computational Complexity, (2000)
  • [3] Cord J., A method for allocating funds to investment projects when returns are subject to uncertainty, Management Science, 10, 2, pp. 335-341, (1964)
  • [4] Goldberg D.E., Smith R.E., Nonstationary function optimization using genetic algorithms with dominance and diploidy, Proceedings of the International Conference on Genetic Algorithms, pp. 59-68, (1987)
  • [5] Cormen T.H., Leiserson C.E., Rivest R.L., Stein C., Introduction to Algorithms, (2001)
  • [6] Kellerer H., Pferschy U., Pisinger D., Knapsack Problems, (2004)
  • [7] Alsuwaiyel M.H., Algorithms Design Techniques and Analysis, (2009)
  • [8] Lin G.Y., Lu Y., Yao D.D., The stochastic knapsack revisited: Switch-over policies and dynamic pricing, Operations Research, 56, 4, pp. 945-957, (2008)
  • [9] Dizdar D., Gershkov A., Moldovanu B., Revenue maximization in the dynamic knapsack problem, Theoretical Economics, 6, 2, pp. 157-184, (2011)
  • [10] Goldberg D.E., Smith R.E., Nonstationary function optimization using genetic algorithms with dominance and diploidy, Proceedings of the International Conference on Genetic Algorithms, pp. 59-68, (1987)
123