Skip to main content

Advertisement

SpringerLink
Log in

An enhanced genetic algorithm for constrained knapsack problems in dynamic environments

  • Published:
Natural Computing Aims and scope Submit manuscript

Abstract

In this paper, an enhanced genetic algorithm (ERGA), based on memory updating and environment reaction schemes, has been proposed to solve constrained knapsack problems in dynamic environments (DKPs). Its key operators, e.g., the memory updating and the environment reaction schemes, have been further investigated to improve the ability of adapting to different dynamic environments. To maintain the diversity of solutions in the memory, when the memory is due to update, the elite that differs from any of the solutions in the memory in terms of the hamming distance will replace the worst solution in the memory set. In this way, the memory set can store diversiform information as much as possible. On the other hand, the environment reaction operation is used to determine when to retrieve and how to use the solutions saved in the memory set. Experimental results on a series of DKPs with different randomly generated data sets indicate that ERGA can faster track the changing environments and manifest superior statistical performance, when compared with peer dynamic genetic algorithms. The sensitivity analysis concerning some important parameters of ERGA has also been made and presented in the section on experimental results.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

References

  • Ahmadi E, Zandieh M, Farrokh M, Emami SM (2016) A multi objective optimization approach for flexible job shop scheduling problem under random machine breakdown by evolutionary algorithms. Comput Oper Res 73(9):56–66

    Article  MathSciNet  Google Scholar 

  • Baker BM, Ayechew MA (2003) A genetic algorithm for the vehicle routing problem. Comput Oper Res 30(5):787–800

    Article  MathSciNet  Google Scholar 

  • Basu SK, Bhatia AK (2006) A naive genetic approach for non-stationary constrained problems. Soft Comput 10(2):152–162

    Article  Google Scholar 

  • Bosman PAN (2007) Learning and anticipation in online dynamic optimization with evolutionary algorithms:the stochastic case. In: Proceedings of genetic and evolutionary computation conference, GECCO 2007, London, vol 1, pp 1165–1172

  • Branke JU (2004) Memory enhanced evolutionary algorithms for changing optimization problems. Congress Evolut Comput Cec 3:1875–1882

    MathSciNet  Google Scholar 

  • Changdar C, Mahapatra GS, Pal RK (2015) An improved genetic algorithm based approach to solve constrained knapsack problem in fuzzy environment. Expert Syst Appl 42(4):2276–2286

    Article  Google Scholar 

  • Cheng H, Yang S (2010) Genetic algorithms with immigrants schemes for dynamic multicast problems in mobile ad hoc networks. Eng Appl Artif Intell 23(5):806–819

    Article  Google Scholar 

  • Cobb HG, Grefenstette JJ (1993) Genetic algorithms for tracking changing environments. In: Fifth international conference on genetic algorithms, pp 523–530

  • Cruz C, González JR, Pelta DA (2011) Optimization in dynamic environments: a survey on problems, methods and measures. Soft Comput 15(7):1427–1448

    Article  Google Scholar 

  • Derrac J, García S, Molina D, Herrera F (2011) A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evolut Comput 1(1):3–18

    Article  Google Scholar 

  • Finner H (1993) On a monotonicity problem in step-down multiple test procedures. J Am Stat Assoc 88(423):920–923

    Article  MathSciNet  Google Scholar 

  • Friedman M (1939) A comparison of alternative tests of significance for the problem of m rankings. Ann Math Stat 11(1):86–92

    Article  MathSciNet  Google Scholar 

  • Grefenstette JJ (1992) Genetic algorithms for changing environments. Proc Paralle Prob Solving Nat 2:139–146

    Google Scholar 

  • Hochberg Y (1988) A sharper bonferroni procedure for multiple tests of significance. Biometrika 75(4):800–802

    Article  MathSciNet  Google Scholar 

  • Hodges JL, Lehmann EL (1962) Rank methods for combination of independent experiments in analysis of variance. Ann Math Stat 33(2):482–497

    Article  MathSciNet  Google Scholar 

  • Holland BS, Copenhaver DP (1987) An improved sequentially rejective bonferroni procedure. Biometrics 43(2):417–423

    Article  MathSciNet  Google Scholar 

  • Holm S (1979) A simple sequentially rejective multiple test procedure. Scand J Stat 6:65–70

    MathSciNet  MATH  Google Scholar 

  • Hommel G (1988) A stagewise rejective multiple test procedure on a modified boneferroni test. Biometrika 75(2):383–386

    Article  Google Scholar 

  • Jin Y, Branke J (2005) Evolutionary optimization in uncertain environments—a survey. IEEE Trans Evolut Comput 9(3):303–317

    Article  Google Scholar 

  • Li C, Yang S (2012) A general framework of multipopulation methods with clustering in undetectable dynamic environments. IEEE Trans Evolut Comput 16(4):556–577

    Article  Google Scholar 

  • Li J (2008) A two-step rejection procedure for testing multiple hypotheses. J Stat Plan Inference 138(6):1521–1527

    Article  MathSciNet  Google Scholar 

  • Mendes RRA, Paiva AP, Peruchi RS, Balestrassi PP, Leme RC, Silva MB (2016) Multiobjective portfolio optimization of ARMAGARCH time series based on experimental designs. Comput Oper Res 66(2):434–444

    Article  MathSciNet  Google Scholar 

  • Michalewicz Z, Arabas J (1994) Genetic algorithms for the 0/1 knapsack problem. In: Proceedings of the 8th international symposium on methodologies for intelligent systems, vol 869, pp 134–143

    Google Scholar 

  • Nguyen TT, Yang S, Branke J (2012) Evolutionary dynamic optimization: a survey of the state of the art. Swarm Evolut Comput 6:1–24

    Article  Google Scholar 

  • Novoa-Hernández P, Corona CC, Pelta DA (2013) Self-adaptive, multipopulation differential evolution in dynamic environments. Soft Comput 17(10):1861–1881

    Article  Google Scholar 

  • Peng X, Gao X, Yang S (2011) Environment identification-based memory scheme for estimation of distribution algorithms in dynamic environments. Soft Comput 15(2):311–326

    Article  Google Scholar 

  • Quade D (1979) Using weighted rankings in the analysis of complete blocks with additive block effects. J Am Stat Assoc 74(367):680–683

    Article  MathSciNet  Google Scholar 

  • Richter H, Yang S (2009) Learning behavior in abstract memory schemes for dynamic optimization problems. Soft Comput 13(12):1163–1173

    Article  Google Scholar 

  • Rom DM (1990) A sequentially rejective test procedure based on a modified Bonferroni inequality. Biometrika 77(3):663–665

    Article  MathSciNet  Google Scholar 

  • Singh HK, Isaacs A, Nguyen TT, Ray T (2009) Performance of infeasibility driven evolutionary algorithm (IDEA) on constrained dynamic single objective optimization problems. In: Eleventh conference on congress on evolutionary computation, vol 1, pp 3127–3134

  • Turky AM, Abdullah S (2014a) A multi-population electromagnetic algorithm for dynamic optimisation problems. Appl Soft Comput 22(5):474–482

    Article  Google Scholar 

  • Turky AM, Abdullah S (2014b) A multi-population harmony search algorithm with external archive for dynamic optimization problems. Inf Sci 272(8):84–95

    Article  Google Scholar 

  • Wang Y, Li B (2009) Investigation of memory-based multi-objective optimization evolutionary algorithm in dynamic environment. In: iEEE congress on evolutionary computation cec, pp 630–637

  • Yang S (2003) Non-stationary problem optimization using the primal-dual genetic algorithm. In: The 2003 congress on evolutionary computation, vol 3, pp 2246–2253

  • Yang S (2005) Memory-based immigrants for genetic algorithms in dynamic environments. In: The 2005 congress on evolutionary computation, pp 1115–1122

  • Yang S (2007) Genetic algorithms with elitism-based immigrants for changing optimization problems. Lecture Notes in Computer Science, vol 4448, pp 627–636

  • Yang S (2008) Genetic algorithms with memory- and elitism-based immigrants in dynamic environments. Evolut Comput 16(3):385–416

    Article  Google Scholar 

  • Yang S, Tinó’s R (2007) A hybrid immigrants scheme for genetic algorithms in dynamic environments. Int J Autom Comput 4(3):243–254

    Article  Google Scholar 

  • Yang S, Yao X (2005) Experimental study on population-based incremental learning algorithms for dynamic optimization problems. Soft Comput 9(11):815–834

    Article  Google Scholar 

  • Yang S, Yao X (2008) Population-based incremental learning with associative memory for dynamic environments. IEEE Trans Evol Comput 12(5):542–561

    Article  Google Scholar 

  • Yazdani D, Nasiri B, Sepas-Moghaddam A, Meybodi MR (2013) A novel multi-swarm algorithm for optimization in dynamic environments based on particle swarm optimization. Appl Soft Comput 13(4):2144–2158

    Article  Google Scholar 

  • Yu X, Tang K, Chen T, Yao X (2009) Empirical analysis of evolutionary algorithms with immigrants schemes for dynamic optimization. Memet Comput 1(1):3–24

    Article  Google Scholar 

  • Zhang Z (2008) Multiobjective optimization immune algorithm in dynamic environments and its application to greenhouse control. Appl Soft Comput 8(2):959–971

    Article  Google Scholar 

Download references

Acknowledgements

The authors acknowledge the support from the National Natural Science Foundation of China under Grants 61762001, 71461027, 71471158. Provincial Science and Technology Foundation of Guizhou of China under Grants 20152002 and Qian ke he LH zi 20177047. Creative Research Groups of the National Natural Science Foundation of Guizhou of China under Grants Qian Jiao he KY zi 2018034.

Author information

Authors and Affiliations

  1. School of Sciences, Anshun University, Anshun, 561000, China

    Shuqu Qian

  2. School of Mathematics and Computer Science, Zunyi Normal College, Zunyi, 563002, China

    Yanmin Liu

  3. College of Automatic Engineering, Nanjing University of Aeronautics and Astronautics, Nanjing, 210016, China

    Yongqiang Ye & Guofeng Xu

Authors
  1. Shuqu Qian
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yanmin Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yongqiang Ye
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Guofeng Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yanmin Liu.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Qian, S., Liu, Y., Ye, Y. et al. An enhanced genetic algorithm for constrained knapsack problems in dynamic environments. Nat Comput 18, 913–932 (2019). https://doi.org/10.1007/s11047-018-09725-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11047-018-09725-3

Keywords

Search

Navigation