Skip to main content
Erschienen in: International Journal of Machine Learning and Cybernetics 3/2017

23.12.2015 | Original Article

An efficient modified differential evolution algorithm for solving constrained non-linear integer and mixed-integer global optimization problems

verfasst von: Ali Wagdy Mohamed

Erschienen in: International Journal of Machine Learning and Cybernetics | Ausgabe 3/2017

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

In this paper, an efficient modified Differential Evolution algorithm, named EMDE, is proposed for solving constrained non-linear integer and mixed-integer global optimization problems. In the proposed algorithm, new triangular mutation rule based on the convex combination vector of the triplet defined by the three randomly chosen vectors and the difference vectors between the best,better and the worst individuals among the three randomly selected vectors is introduced. The proposed novel approach to mutation operator is shown to enhance the global and local search capabilities and to increase the convergence speed of the new algorithm compared with basic DE. EMDE uses Deb’s constraint handling technique based on feasibility and the sum of constraints violations without any additional parameters. In order to evaluate and analyze the performance of EMDE, Numerical experiments on a set of 18 test problems with different features, including a comparison with basic DE and four state-of-the-art evolutionary algorithms are executed. Experimental results indicate that in terms of robustness, stability and efficiency, EMDE is significantly better than other five algorithms in solving these test problems. Furthermore, EMDE exhibits good performance in solving two high-dimensional problems, and it finds better solutions than the known ones. Hence, EMDE is superior to the compared algorithms.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Weitere Produktempfehlungen anzeigen
Anhänge
Nur mit Berechtigung zugänglich
Literatur
1.
Zurück zum Zitat Mohamed AW, Sabry HZ (2012) Constrained optimization based on modified differential evolution algorithm. Inf Sci 194:171–208CrossRef Mohamed AW, Sabry HZ (2012) Constrained optimization based on modified differential evolution algorithm. Inf Sci 194:171–208CrossRef
2.
Zurück zum Zitat Costa L, Oliveira P (2001) Evolutionary algorithms approach to the solution of mixed non-linear programming. Comput Chem Eng 25:257–266CrossRef Costa L, Oliveira P (2001) Evolutionary algorithms approach to the solution of mixed non-linear programming. Comput Chem Eng 25:257–266CrossRef
3.
Zurück zum Zitat Lin YC, Hwang KS, Wang FS (2004) A mixed-coding scheme of evolutionary algorithms to solve mixed-integer nonlinear programming problems. Comput Math Appl 47:1295–1307MathSciNetCrossRefMATH Lin YC, Hwang KS, Wang FS (2004) A mixed-coding scheme of evolutionary algorithms to solve mixed-integer nonlinear programming problems. Comput Math Appl 47:1295–1307MathSciNetCrossRefMATH
4.
Zurück zum Zitat Sandgren E (1990) Nonlinear integer and discrete programming in mechanical design, ASME Y. Mech Des 112:223–229 Sandgren E (1990) Nonlinear integer and discrete programming in mechanical design, ASME Y. Mech Des 112:223–229
5.
Zurück zum Zitat Dua V, Pistikopoulos EN (1998) Optimization techniques for process synthesis and material design under uncertainty. Chem Eng Res Des 76(3):408–416CrossRef Dua V, Pistikopoulos EN (1998) Optimization techniques for process synthesis and material design under uncertainty. Chem Eng Res Des 76(3):408–416CrossRef
6.
Zurück zum Zitat Catalão JPS, Pousinho HMI, Mendes VMF (2010) Mixed-integer nonlinear approach for the optimal scheduling of a head-dependent hydro chain. Electr Power Syst Res 80(8):935–942CrossRef Catalão JPS, Pousinho HMI, Mendes VMF (2010) Mixed-integer nonlinear approach for the optimal scheduling of a head-dependent hydro chain. Electr Power Syst Res 80(8):935–942CrossRef
7.
Zurück zum Zitat Garroppo RG, Giordano S, Nencioni G, Scutellà MG (2013) Mixed integer non-linear programming models for green network design. Comput Oper Res 40(1):273–281CrossRefMATH Garroppo RG, Giordano S, Nencioni G, Scutellà MG (2013) Mixed integer non-linear programming models for green network design. Comput Oper Res 40(1):273–281CrossRefMATH
8.
Zurück zum Zitat Maldonado S, Pérez J, Weber R, Labbé M (2014) Feature selection for support vector machines via mixed integer linear programming. Inf Sci 279(20):163–175MathSciNetCrossRefMATH Maldonado S, Pérez J, Weber R, Labbé M (2014) Feature selection for support vector machines via mixed integer linear programming. Inf Sci 279(20):163–175MathSciNetCrossRefMATH
9.
Zurück zum Zitat Çetinkaya C, Karaoglan I, Gökçen H (2013) Two-stage vehicle routing problem with arc time windows: a mixed integer programming formulation and a heuristic approach. Eur J Oper Res 230(3):539–550MathSciNetCrossRefMATH Çetinkaya C, Karaoglan I, Gökçen H (2013) Two-stage vehicle routing problem with arc time windows: a mixed integer programming formulation and a heuristic approach. Eur J Oper Res 230(3):539–550MathSciNetCrossRefMATH
10.
Zurück zum Zitat Liu P, Whitaker A, Pistikopoulos EN, Li Z (2011) A mixed-integer programming approach to strategic planning of chemical centres: a case study in the UK. Comput Chem Eng 35(8):1359–1373CrossRef Liu P, Whitaker A, Pistikopoulos EN, Li Z (2011) A mixed-integer programming approach to strategic planning of chemical centres: a case study in the UK. Comput Chem Eng 35(8):1359–1373CrossRef
11.
Zurück zum Zitat Xu G, Papageorgiou LG (2009) A mixed integer optimisation model for data classification. Comput Ind Eng 56(4):1205–1215CrossRef Xu G, Papageorgiou LG (2009) A mixed integer optimisation model for data classification. Comput Ind Eng 56(4):1205–1215CrossRef
12.
Zurück zum Zitat Grossmann IE, Sahinidis NV (eds) (2002) Special issue on mixed-integer programming and its application to engineering, Part I, Optim. Eng., Kluwer Academic Publishers, Netherlands, vol. 3 (4) Grossmann IE, Sahinidis NV (eds) (2002) Special issue on mixed-integer programming and its application to engineering, Part I, Optim. Eng., Kluwer Academic Publishers, Netherlands, vol. 3 (4)
13.
Zurück zum Zitat Grossmann IE, Sahinidis NV (eds) (2002) Special issue on mixed-integer programming and its application to engineering, Part II, Optim. Eng., Kluwer Academic Publishers, Netherlands, vol. 4 (1) Grossmann IE, Sahinidis NV (eds) (2002) Special issue on mixed-integer programming and its application to engineering, Part II, Optim. Eng., Kluwer Academic Publishers, Netherlands, vol. 4 (1)
15.
Zurück zum Zitat Ng CK, Zhang LS, Li D, Tian WW (2005) Discrete filled function method for discrete global optimization. Comput Optim Appl 31(1):87–115MathSciNetCrossRefMATH Ng CK, Zhang LS, Li D, Tian WW (2005) Discrete filled function method for discrete global optimization. Comput Optim Appl 31(1):87–115MathSciNetCrossRefMATH
16.
Zurück zum Zitat Gupta OK, Ravindran A (1985) Branch and bound experiments in convex nonlinear integer programming. Manag Sci 31(12):1533–1546MathSciNetCrossRefMATH Gupta OK, Ravindran A (1985) Branch and bound experiments in convex nonlinear integer programming. Manag Sci 31(12):1533–1546MathSciNetCrossRefMATH
17.
Zurück zum Zitat Borchers B, Mitchell JE (1994) An improved branch and bound algorithm for mixed integer nonlinear programming. Comput Oper Res 21:359–367MathSciNetCrossRefMATH Borchers B, Mitchell JE (1994) An improved branch and bound algorithm for mixed integer nonlinear programming. Comput Oper Res 21:359–367MathSciNetCrossRefMATH
19.
Zurück zum Zitat DuranMA GI (1986) An outer approximation algorithm for a class of mixed-integer nonlinear programs. Math Program 36(3):307–339MathSciNetCrossRef DuranMA GI (1986) An outer approximation algorithm for a class of mixed-integer nonlinear programs. Math Program 36(3):307–339MathSciNetCrossRef
20.
21.
Zurück zum Zitat Quesada I, Grossmann IE (1992) An LP/NLP based branch and bound algorithm for convex MINLP optimization problems. Comput Chem Eng 16(10–11):937–947CrossRef Quesada I, Grossmann IE (1992) An LP/NLP based branch and bound algorithm for convex MINLP optimization problems. Comput Chem Eng 16(10–11):937–947CrossRef
22.
Zurück zum Zitat Westerlund T, Pettersson F (1995) A cutting plane method for solving convex MINLP problems. Comput Chem Eng 19:S131–S136CrossRef Westerlund T, Pettersson F (1995) A cutting plane method for solving convex MINLP problems. Comput Chem Eng 19:S131–S136CrossRef
23.
Zurück zum Zitat Lee S, Grossmann IE (2000) New algorithms for nonlinear generalized disjunctive programming. Comput Chem Eng 24:2125–2142CrossRef Lee S, Grossmann IE (2000) New algorithms for nonlinear generalized disjunctive programming. Comput Chem Eng 24:2125–2142CrossRef
24.
Zurück zum Zitat Bonami P, Biegler LT, Conn AR, Cornuéjols G, Grossmann IE, Laird CD, Lee J, Lodi A, Margot F, Sawaya N, Wächter A (2008) An algorithmic framework for convex mixed integer nonlinear programs. Discrete Optim 5:186–204MathSciNetCrossRefMATH Bonami P, Biegler LT, Conn AR, Cornuéjols G, Grossmann IE, Laird CD, Lee J, Lodi A, Margot F, Sawaya N, Wächter A (2008) An algorithmic framework for convex mixed integer nonlinear programs. Discrete Optim 5:186–204MathSciNetCrossRefMATH
25.
Zurück zum Zitat Abhishek K, Leyffer S, Linderoth JT (2010) FilMINT: an outer-approximation-based solver for nonlinear mixed integer programs. Inf J Comput 22:555–567CrossRefMATH Abhishek K, Leyffer S, Linderoth JT (2010) FilMINT: an outer-approximation-based solver for nonlinear mixed integer programs. Inf J Comput 22:555–567CrossRefMATH
26.
Zurück zum Zitat Belotti P, Kirches C, Leyffer S, Linderoth J, Luedtke J, Mahajan A (2013) Mixed-integer nonlinear optimization. Acta Num. 22:1–131MathSciNetCrossRefMATH Belotti P, Kirches C, Leyffer S, Linderoth J, Luedtke J, Mahajan A (2013) Mixed-integer nonlinear optimization. Acta Num. 22:1–131MathSciNetCrossRefMATH
27.
Zurück zum Zitat Liberti L, Cafieri S, Tarissan F (2009) Reformulations in mathematical programming: a computational approach. In: Abraham A, Hassanien AE, Siarry P (eds) Foundations on computational intelligence, studies in computational intelligence, vol 203. Springer, New York, pp 153–234 Liberti L, Cafieri S, Tarissan F (2009) Reformulations in mathematical programming: a computational approach. In: Abraham A, Hassanien AE, Siarry P (eds) Foundations on computational intelligence, studies in computational intelligence, vol 203. Springer, New York, pp 153–234
28.
Zurück zum Zitat D’Ambrosio C, Lodi A (2011) Mixed integer nonlinear programming tools: a practical overview. In: 4OR 9, No. 4, 2011, pp. 329–349 (cit. on p. 13) D’Ambrosio C, Lodi A (2011) Mixed integer nonlinear programming tools: a practical overview. In: 4OR 9, No. 4, 2011, pp. 329–349 (cit. on p. 13)
29.
Zurück zum Zitat Trespalacios F, Grossmann IE (2014) Review of mixed-integer nonlinear and generalized disjunctive programming Methods. Chem Ing Tech 86:991–1012CrossRef Trespalacios F, Grossmann IE (2014) Review of mixed-integer nonlinear and generalized disjunctive programming Methods. Chem Ing Tech 86:991–1012CrossRef
30.
Zurück zum Zitat Burer S, Letchford AN (2012) Non-convex mixed-integer nonlinear programming: a survey. Surveys Oper Res Manag Sci 17(2):97–106MathSciNet Burer S, Letchford AN (2012) Non-convex mixed-integer nonlinear programming: a survey. Surveys Oper Res Manag Sci 17(2):97–106MathSciNet
31.
32.
Zurück zum Zitat Cardoso MF, Salcedo RL, Feyo de Azevedo S, Barbosa D (1997) A simulated annealing approach to the solution of minlp problems. Comput Chem Eng 21(12):1349–1364CrossRef Cardoso MF, Salcedo RL, Feyo de Azevedo S, Barbosa D (1997) A simulated annealing approach to the solution of minlp problems. Comput Chem Eng 21(12):1349–1364CrossRef
33.
Zurück zum Zitat Rosen SL, Harmonosky CM (2005) An improved simulated annealing simulation optimization method for discrete parameter stochastic systems. Comput Oper Res 32:343–358MathSciNetCrossRefMATH Rosen SL, Harmonosky CM (2005) An improved simulated annealing simulation optimization method for discrete parameter stochastic systems. Comput Oper Res 32:343–358MathSciNetCrossRefMATH
35.
Zurück zum Zitat Hua Z, Huang F (2006) A variable-grouping based genetic algorithm for large-scale integer programming. Inf Sci 176(19):2869–2885MathSciNetCrossRefMATH Hua Z, Huang F (2006) A variable-grouping based genetic algorithm for large-scale integer programming. Inf Sci 176(19):2869–2885MathSciNetCrossRefMATH
36.
Zurück zum Zitat Kesen SE, Das SK, Güngör Z (2010) A genetic algorithm based heuristic for scheduling of virtual manufacturing cells (VMCs). Comput Oper Res 37(6):1148–1156CrossRefMATH Kesen SE, Das SK, Güngör Z (2010) A genetic algorithm based heuristic for scheduling of virtual manufacturing cells (VMCs). Comput Oper Res 37(6):1148–1156CrossRefMATH
37.
Zurück zum Zitat Turkkan N (2003) Discrete optimization of structures using a floating-point genetic algorithm. In: Annual conference of the Canadian society for civil engineering, Moncton, Canada Turkkan N (2003) Discrete optimization of structures using a floating-point genetic algorithm. In: Annual conference of the Canadian society for civil engineering, Moncton, Canada
38.
Zurück zum Zitat Yokota T, Gen M, Li YX (1996) Genetic algorithm for non-linear mixed integer programming problems and its applications. Comput Ind Eng 30:905–917CrossRef Yokota T, Gen M, Li YX (1996) Genetic algorithm for non-linear mixed integer programming problems and its applications. Comput Ind Eng 30:905–917CrossRef
39.
Zurück zum Zitat Wasanapradit T, Mukdasanit N, Chaiyaratana N, Srinophakun T (2011) Solving mixed-integer nonlinear programming problems using improved genetic algorithms. Korean J Chem Eng 28(1):32–40CrossRef Wasanapradit T, Mukdasanit N, Chaiyaratana N, Srinophakun T (2011) Solving mixed-integer nonlinear programming problems using improved genetic algorithms. Korean J Chem Eng 28(1):32–40CrossRef
40.
Zurück zum Zitat Deep K, Singh KP, Kansal ML, Mohan C (2009) A real coded genetic algorithm for solving integer and mixed integer optimization problems. Appl Math Comput 212(2):505–518MathSciNetMATH Deep K, Singh KP, Kansal ML, Mohan C (2009) A real coded genetic algorithm for solving integer and mixed integer optimization problems. Appl Math Comput 212(2):505–518MathSciNetMATH
41.
Zurück zum Zitat Cai J, Thierauf G (1996) Evolution strategies for solving discrete optimization problems. Adv Eng Softw 25:177–183CrossRef Cai J, Thierauf G (1996) Evolution strategies for solving discrete optimization problems. Adv Eng Softw 25:177–183CrossRef
42.
Zurück zum Zitat Costa L, Oliveira P Evolutionary algorithms approach to the solution of mixed integer non-linear programming problems. Comput Chem Eng, 25(2–3):257-266 Costa L, Oliveira P Evolutionary algorithms approach to the solution of mixed integer non-linear programming problems. Comput Chem Eng, 25(2–3):257-266
43.
Zurück zum Zitat Cao YJ, Jiang L, Wu QH (2000) An evolutionary programming approach to mixed-variable optimization problems. Appl Math Model 24:931–942CrossRefMATH Cao YJ, Jiang L, Wu QH (2000) An evolutionary programming approach to mixed-variable optimization problems. Appl Math Model 24:931–942CrossRefMATH
44.
Zurück zum Zitat Mohan C, Nguyen HT (1999) A controlled random search technique incorporating the simulating annealing concept for solving integer and mixed integer global optimization problems. Comput Opti Appl 14:103–132CrossRefMATH Mohan C, Nguyen HT (1999) A controlled random search technique incorporating the simulating annealing concept for solving integer and mixed integer global optimization problems. Comput Opti Appl 14:103–132CrossRefMATH
45.
Zurück zum Zitat Woon SF, Rehbock V (2010) A critical review of discrete filled function methods in solving nonlinear discrete optimization problems. Appl Math Comput 217(1):25–41MathSciNetMATH Woon SF, Rehbock V (2010) A critical review of discrete filled function methods in solving nonlinear discrete optimization problems. Appl Math Comput 217(1):25–41MathSciNetMATH
46.
Zurück zum Zitat Yongjian Y, Yumei L (2007) A new discrete filled function algorithm for discrete global optimization. J Comput Appl Math 202(2):280–291MathSciNetCrossRefMATH Yongjian Y, Yumei L (2007) A new discrete filled function algorithm for discrete global optimization. J Comput Appl Math 202(2):280–291MathSciNetCrossRefMATH
47.
Zurück zum Zitat Socha K (2004) ACO for continuous and mixed-variable optimization. Ant colony, optimization and swarm intelligence. Springer, Berlin, pp 25–36CrossRef Socha K (2004) ACO for continuous and mixed-variable optimization. Ant colony, optimization and swarm intelligence. Springer, Berlin, pp 25–36CrossRef
48.
Zurück zum Zitat Schlüter M, Egea JA, Banga JR (2009) Extended ant colony optimization for non-convex mixed integer nonlinear programming. Comput Oper Res 36(7):2217–2229MathSciNetCrossRefMATH Schlüter M, Egea JA, Banga JR (2009) Extended ant colony optimization for non-convex mixed integer nonlinear programming. Comput Oper Res 36(7):2217–2229MathSciNetCrossRefMATH
49.
Zurück zum Zitat Yiqing L, Xigang Y, Yongjian L (2007) An improved PSO algorithm for solving non-convex NLP/MINLP problems with equality constraints. Comput Chem Eng 31(3):153–162CrossRef Yiqing L, Xigang Y, Yongjian L (2007) An improved PSO algorithm for solving non-convex NLP/MINLP problems with equality constraints. Comput Chem Eng 31(3):153–162CrossRef
50.
Zurück zum Zitat Yue T, Guan-zheng T, Shu-guang D (2014) Hybrid particle swarm optimization with chaotic search for solving integer and mixed integer programming problems. J Central South Univ 21:2731–2742CrossRef Yue T, Guan-zheng T, Shu-guang D (2014) Hybrid particle swarm optimization with chaotic search for solving integer and mixed integer programming problems. J Central South Univ 21:2731–2742CrossRef
51.
Zurück zum Zitat Gao Y, Ren Z, Gao Y (2011) Modified differential evolution algorithm of constrained nonlinear mixed integer programming problems. Inf Technol J 10(11):2068–2075CrossRef Gao Y, Ren Z, Gao Y (2011) Modified differential evolution algorithm of constrained nonlinear mixed integer programming problems. Inf Technol J 10(11):2068–2075CrossRef
52.
Zurück zum Zitat Lin YC, Hwang KS, Wang FS (2004) A mixed-coding scheme of evolutionary algorithms to solve mixed-integer nonlinear programming problems. Comput Math Appl 47(8–9):1295–1307MathSciNetCrossRefMATH Lin YC, Hwang KS, Wang FS (2004) A mixed-coding scheme of evolutionary algorithms to solve mixed-integer nonlinear programming problems. Comput Math Appl 47(8–9):1295–1307MathSciNetCrossRefMATH
53.
Zurück zum Zitat Li H, Zhang L (2014) A discrete hybrid differential evolution algorithm for solving integer programming problems. Eng Optim 46(9):1238–1268MathSciNetCrossRef Li H, Zhang L (2014) A discrete hybrid differential evolution algorithm for solving integer programming problems. Eng Optim 46(9):1238–1268MathSciNetCrossRef
54.
Zurück zum Zitat Mohamed AW (2015) An improved differential evolution algorithm with triangular mutation for global numerical optimization. Comput Ind Eng 85:359–375CrossRef Mohamed AW (2015) An improved differential evolution algorithm with triangular mutation for global numerical optimization. Comput Ind Eng 85:359–375CrossRef
55.
Zurück zum Zitat Storn R, Price K (1995) Differential evolution- a simple and efficient adaptive scheme for global optimization over continuous spaces”, Technical Report TR-95-012, ICSI http://http.icsi.berkeley.edu/~storn/litera.html Storn R, Price K (1995) Differential evolution- a simple and efficient adaptive scheme for global optimization over continuous spaces”, Technical Report TR-95-012, ICSI http://​http.​icsi.​berkeley.​edu/​~storn/​litera.​html
56.
Zurück zum Zitat Storn R, Price K (1997) Differential Evolution- a simple and efficient heuristic for global optimization over continuous spaces. J Global Optim 11(4):341–359MathSciNetCrossRefMATH Storn R, Price K (1997) Differential Evolution- a simple and efficient heuristic for global optimization over continuous spaces. J Global Optim 11(4):341–359MathSciNetCrossRefMATH
57.
Zurück zum Zitat Engelbrecht AP (2005) Fundamentals of computational swarm intelligence. Wiley, Hoboken Engelbrecht AP (2005) Fundamentals of computational swarm intelligence. Wiley, Hoboken
58.
Zurück zum Zitat Das S, Suganthan PN (2011) Differential evolution: a survey of the state-of-the-art. IEEE Trans Evol Comput 15(1):4–31CrossRef Das S, Suganthan PN (2011) Differential evolution: a survey of the state-of-the-art. IEEE Trans Evol Comput 15(1):4–31CrossRef
59.
Zurück zum Zitat Deb K (2000) An efficient constraint handling method for genetic algorithms. Comput Methods Appl Mech Eng 186:311–338CrossRefMATH Deb K (2000) An efficient constraint handling method for genetic algorithms. Comput Methods Appl Mech Eng 186:311–338CrossRefMATH
60.
Zurück zum Zitat Venkatraman S, Yen GG (2005) A generic framework for constrained optimization using genetic algorithms. IEEE Trans Evol Comput 9(4):424–435CrossRef Venkatraman S, Yen GG (2005) A generic framework for constrained optimization using genetic algorithms. IEEE Trans Evol Comput 9(4):424–435CrossRef
61.
Zurück zum Zitat Storn R, Price K (1997) Differential evolution a simple and efficient heuristic for global optimization over continuous spaces. J Global Optim 11(4):341–359MathSciNetCrossRefMATH Storn R, Price K (1997) Differential evolution a simple and efficient heuristic for global optimization over continuous spaces. J Global Optim 11(4):341–359MathSciNetCrossRefMATH
62.
63.
Zurück zum Zitat Price KV, Storn RM, Lampinen JA (2005) Differential evolution: a practical approach to global optimization, 1st edn. Springer, New YorkMATH Price KV, Storn RM, Lampinen JA (2005) Differential evolution: a practical approach to global optimization, 1st edn. Springer, New YorkMATH
64.
Zurück zum Zitat Qin AK, Huang VL, Suganthan PN (2009) Differential evolution algorithm with strategy adaptation for global numerical optimization. IEEE Trans Evol Comput 13(2):398–417CrossRef Qin AK, Huang VL, Suganthan PN (2009) Differential evolution algorithm with strategy adaptation for global numerical optimization. IEEE Trans Evol Comput 13(2):398–417CrossRef
65.
Zurück zum Zitat Mallipeddi R, Suganthan PN, Pan QK, Tasgetiren MF (2011) Differential evolution algorithm with ensemble of parameters and mutation Strategies. Appl Soft Comput 11(2):1679–1696CrossRef Mallipeddi R, Suganthan PN, Pan QK, Tasgetiren MF (2011) Differential evolution algorithm with ensemble of parameters and mutation Strategies. Appl Soft Comput 11(2):1679–1696CrossRef
66.
Zurück zum Zitat Wang Y, Cai Z, Zhang Q (2011) Differential evolution with composite trial vector generation strategies and control parameters. IEEE Trans Evol Comput 15(1):55–66CrossRef Wang Y, Cai Z, Zhang Q (2011) Differential evolution with composite trial vector generation strategies and control parameters. IEEE Trans Evol Comput 15(1):55–66CrossRef
67.
Zurück zum Zitat Zhang JQ, Sanderson AC (2009) JADE: adaptive differential evolution with optional external archive. IEEE Trans Evol Comput 13(5):945–958CrossRef Zhang JQ, Sanderson AC (2009) JADE: adaptive differential evolution with optional external archive. IEEE Trans Evol Comput 13(5):945–958CrossRef
68.
Zurück zum Zitat Feoktistov V (2006) Differential evolution. Berlin, Germany, Springer-verlag, In Search of SolutionsMATH Feoktistov V (2006) Differential evolution. Berlin, Germany, Springer-verlag, In Search of SolutionsMATH
69.
Zurück zum Zitat Mezura-Montes E, Coello CAC (2005) A simple multimembered evolution strategy to solve constrained optimization problems. IEEE Trans Evol Comput 9(1):1–17CrossRefMATH Mezura-Montes E, Coello CAC (2005) A simple multimembered evolution strategy to solve constrained optimization problems. IEEE Trans Evol Comput 9(1):1–17CrossRefMATH
70.
Zurück zum Zitat Dong N, Wang Y (2014) A memetic differential evolution algorithm based on dynamic preference for constrained optimization problems. J Appl Math, Article ID 606019, p 15. doi:10.1155/2014/606019 Dong N, Wang Y (2014) A memetic differential evolution algorithm based on dynamic preference for constrained optimization problems. J Appl Math, Article ID 606019, p 15. doi:10.​1155/​2014/​606019
71.
Zurück zum Zitat Lampinen J, Zelinka I (1999) Mixed integer-discrete-continuous optimization by differential evolution, Part 1: the optimization method. In: Ošmera P (ed.) (1999). Proceedings of Mendel 99, 5th international Mendel conference on soft computing, Brno, Czech Republic Lampinen J, Zelinka I (1999) Mixed integer-discrete-continuous optimization by differential evolution, Part 1: the optimization method. In: Ošmera P (ed.) (1999). Proceedings of Mendel 99, 5th international Mendel conference on soft computing, Brno, Czech Republic
72.
Zurück zum Zitat Omran MGH, Engelbrecht AP (2007) Differential evolution for integer programming problems, IEEE congress on evolutionary computation, pp. 2237–2242 Omran MGH, Engelbrecht AP (2007) Differential evolution for integer programming problems, IEEE congress on evolutionary computation, pp. 2237–2242
73.
Zurück zum Zitat Li Y, Gen M (1996) Nonlinear mixed integer programming problems using genetic algorithm and penalty function. IEEE Int Conf Syst Man Cybernet 4:2677–2682CrossRef Li Y, Gen M (1996) Nonlinear mixed integer programming problems using genetic algorithm and penalty function. IEEE Int Conf Syst Man Cybernet 4:2677–2682CrossRef
74.
Zurück zum Zitat Lu H, Chen W (2008) Self-adaptive velocity particle swarm optimization for solving constrained optimization problems. J Global Optim 41:427–445MathSciNetCrossRefMATH Lu H, Chen W (2008) Self-adaptive velocity particle swarm optimization for solving constrained optimization problems. J Global Optim 41:427–445MathSciNetCrossRefMATH
75.
Zurück zum Zitat Conley W (1984) Computer optimization techniques. Petrocelli Books, PrincetonMATH Conley W (1984) Computer optimization techniques. Petrocelli Books, PrincetonMATH
Metadaten
Titel
An efficient modified differential evolution algorithm for solving constrained non-linear integer and mixed-integer global optimization problems
verfasst von
Ali Wagdy Mohamed
Publikationsdatum
23.12.2015
Verlag
Springer Berlin Heidelberg
Erschienen in
International Journal of Machine Learning and Cybernetics / Ausgabe 3/2017
Print ISSN: 1868-8071
Elektronische ISSN: 1868-808X
DOI
https://doi.org/10.1007/s13042-015-0479-6

Weitere Artikel der Ausgabe 3/2017

International Journal of Machine Learning and Cybernetics 3/2017 Zur Ausgabe

Neuer Inhalt