Photon Structure Function

From formulasearchengine
Jump to navigation Jump to search

In applied mathematics, test functions, known as artificial landscapes, are useful to evaluate characteristics of optimization algorithms, such as:

  • Velocity of convergence.
  • Precision.
  • Robustness.
  • General performance.

Here some test functions are presented with the aim of giving an idea about the different situations that optimization algorithms have to face when coping with these kind of problems. In the first part, some objective functions for single-objective optimization cases are presented. In the second part, test functions with their respective Pareto fronts for multi-objective optimization problems (MOP) are given.

The artificial landscapes presented herein for single-objective optimization problems are taken from Bäck,[1] Haupt et. al.[2] and from Rody Oldenhuis software.[3] Given the amount of problems (55 in total), just a few are presented here. The complete list of test functions is found on the Mathworks website.[4]

The test functions used to evaluate the algorithms for MOP were taken from Deb,[5] Binh et. al.[6] and Binh.[7] You can download the software developed by Deb,[8] which implements the NSGA-II procedure with GAs, or the program posted on Internet,[9] which implements the NSGA-II procedure with ES.

Just a general form of the equation, a plot of the objective function, boundaries of the object variables and the coordinates of global minima are given herein.


Test functions for single-objective optimization problems

Name Plot Formula Minimum Search domain
Ackley's function: Ackley's function for n=2 f(x,y)=20exp(0.20.5(x2+y2))

exp(0.5(cos(2πx)+cos(2πy)))+20+e.

f(0,0)=0 5x,y5
Sphere function Sphere function for n=2 f(x)=i=1nxi2. f(x1,,xn)=f(0,,0)=0 xi, 1in
Rosenbrock function Rosenbrock's function for n=2 f(x)=i=1n1[100(xi+1xi2)2+(xi1)2]. Min={n=2f(1,1)=0,n=3f(1,1,1)=0,n>3f(1,1,,1(n1) times)=0. xi, 1in
Beale's function Beale's function f(x,y)=(1.5x+xy)2+(2.25x+xy2)2

+(2.625x+xy3)2.

f(3,0.5)=0 4.5x,y4.5
Goldstein–Price function: Goldstein–Price function f(x,y)=(1+(x+y+1)2(1914x+3x214y+6xy+3y2))

(30+(2x3y)2(1832x+12x2+48y36xy+27y2)).

f(0,1)=3 2x,y2
Booth's function: Booth's function f(x,y)=(x+2y7)2+(2x+y5)2. f(1,3)=0 10x,y10.
Bukin function N.6: Bukin function N.6 f(x,y)=100|y0.01x2|+0.01|x+10|. f(10,1)=0 15x5, 3y3
Matyas function: Matyas function f(x,y)=0.26(x2+y2)0.48xy. f(0,0)=0 10x,y10
Lévi function N.13: Lévi function N.13 f(x,y)=sin2(3πx)+(x1)2(1+sin2(3πy))

+(y1)2(1+sin2(2πy)).

f(1,1)=0 10x,y10
Three-hump camel function: Three Hump Camel function f(x,y)=2x21.05x4+x66+xy+y2. f(0,0)=0 5x,y5
Easom function: Easom function f(x,y)=cos(x)cos(y)exp(((xπ)2+(yπ)2)). f(π,π)=1 100x,y100
Cross-in-tray function: Cross-in-tray function f(x,y)=0.0001(|sin(x)sin(y)exp(|100x2+y2π|)|+1)0.1. Min={f(1.34941,1.34941)=2.06261f(1.34941,1.34941)=2.06261f(1.34941,1.34941)=2.06261f(1.34941,1.34941)=2.06261 10x,y10
Eggholder function: Eggholder function f(x,y)=(y+47)sin(|y+x2+47|)xsin(|x(y+47)|). f(512,404.2319)=959.6407 512x,y512
Hölder table function: Holder table function f(x,y)=|sin(x)cos(y)exp(|1x2+y2π|)|. Min={f(8.05502,9.66459)=19.2085f(8.05502,9.66459)=19.2085f(8.05502,9.66459)=19.2085f(8.05502,9.66459)=19.2085 10x,y10
McCormick function: McCormick function f(x,y)=sin(x+y)+(xy)21.5x+2.5y+1. f(0.54719,1.54719)=1.9133 1.5x4, 3y4
Schaffer function N. 2: Schaffer function N.2 f(x,y)=0.5+sin2(x2y2)0.5(1+0.001(x2+y2))2. f(0,0)=0 100x,y100
Schaffer function N. 4: Schaffer function N.4 f(x,y)=0.5+cos(sin(|x2y2|))0.5(1+0.001(x2+y2))2. f(0,1.25313)=0.292579 100x,y100
Styblinski–Tang function: Styblinski-Tang function f(x)=i=1nxi416xi2+5xi2. f(2.903534,,2.903534(n) times)=39.16599n 5xi5, 1in.


Test functions for multi-objective optimization problems

Name Plot Functions Constraints Search domain
Binh and Korn function: Binh and Korn function Minimize={f1(x,y)=4x2+4y2f2(x,y)=(x5)2+(y5)2 s.t.={g1(x,y)=(x5)2+y225g2(x,y)=(x8)2+(y+3)27.7 0x5, 0y3
Chakong and Haimes function: Chakong and Haimes function Minimize={f1(x,y)=2+(x2)2+(y1)2f2(x,y)=9x+(y1)2 s.t.={g1(x,y)=x2+y2225g2(x,y)=x3y+100 20x,y20
Fonseca and Fleming function: Fonseca and Fleming function Minimize={f1(x)=1exp(i=1n(xi1n)2)f2(x)=1exp(i=1n(xi+1n)2) 4xi4, 1in
Test function 4:[7] Test function 4.[7] Minimize={f1(x,y)=x2yf2(x,y)=0.5xy1 s.t.={g1(x,y)=6.5x6y0g2(x,y)=7.50.5xy0g3(x,y)=305xy0 7x,y4
Kursawe function: Kursawe function Minimize={f1(x)=i=12[10exp(0.2xi2+xi+12)]f2(x)=i=13[|xi|0.8+5sin(xi3)] 5xi5, 1i3.
Schaffer function N. 1: Schaffer function N.1 Minimize={f1(x)=x2f2(x)=(x2)2 AxA. Values of A form 10 to 105 have been used successfully. Higher values of A increase the difficulty of the problem.
Schaffer function N. 2: Schaffer function N.2 Minimize={f1(x)={x,if x1x2,if 1<x34x,if 3<x4x4,if x>4f2(x)=(x5)2 5x10.
Poloni's two objective function: Poloni's two objective function Minimize={f1(x,y)=[1+(A1B1(x,y))2+(A2B2(x,y))2]f2(x,y)=(x+3)2+(y+1)2

where={A1=0.5sin(1)2cos(1)+sin(2)1.5cos(2)A2=1.5sin(1)cos(1)+2sin(2)0.5cos(2)B1(x,y)=0.5sin(x)2cos(x)+sin(y)1.5cos(y)B2(x,y)=1.5sin(x)cos(x)+2sin(y)0.5cos(y)

πx,yπ
Zitzler–Deb–Thiele's function N. 1: Zitzler-Deb-Thiele's function N.2 Minimize={f1(x)=x1f2(x)=g(x)h(f1(x),g(x))g(x)=1+929i=230xih(f1(x),g(x))=1f1(x)g(x) 0xi1, 1i30.
Zitzler–Deb–Thiele's function N. 2: Zitzler-Deb-Thiele's function N.2 Minimize={f1(x)=x1f2(x)=g(x)h(f1(x),g(x))g(x)=1+929i=230xih(f1(x),g(x))=1(f1(x)g(x))2 0xi1, 1i30.
Zitzler–Deb–Thiele's function N. 3: Zitzler-Deb-Thiele's function N.3 Minimize={f1(x)=x1f2(x)=g(x)h(f1(x),g(x))g(x)=1+929i=230xih(f1(x),g(x))=1f1(x)g(x)(f1(x)g(x))sin(10πf1(x)) 0xi1, 1i30.
Zitzler–Deb–Thiele's function N. 4: caption2 = Zitzler-Deb-Thiele's function N.4 Minimize={f1(x)=x1f2(x)=g(x)h(f1(x),g(x))g(x)=91+i=210(xi210cos(4πxi))h(f1(x),g(x))=1f1(x)g(x) 0x11, 5xi5, 2i10
Zitzler–Deb–Thiele's function N. 6: Zitzler-Deb-Thiele's function N.6 Minimize={f1(x)=1exp(4x1)sin6(6πx1)f2(x)=g(x)h(f1(x),g(x))g(x)=1+9[i=210xi9]0.25h(f1(x),g(x))=1(f1(x)g(x))2 0xi1, 1i10.
Viennet function: Viennet function Minimize={f1(x,y)=0.5(x2+y2)+sin(x2+y2)f2(x,y)=(3x2y+4)28+(xy+1)227+15f3(x,y)=1x2+y2+11.1exp((x2+y2)) 3x,y3.
Osyczka and Kundu function: Osyczka and Kundu function Minimize={f1(x)=25(x12)2(x22)2(x31)2(x44)2(x51)2f2(x)=i=16xi2 s.t.={g1(x)=x1+x220g2(x)=6x1x20g3(x)=2x2+x10g4(x)=2x1+3x20g5(x)=4(x33)2x40g6(x)=(x53)2+x640 0x1,x2,x610, 1x3,x55, 0x46.
CTP1 function (2 variables):[5] CTP1 function (2 variables).[5] Minimize={f1(x,y)=xf2(x,y)=(1+y)exp(x1+y) s.t.={g1(x,y)=f2(x,y)0.858exp(0.541f1(x,y))1g1(x,y)=f2(x,y)0.728exp(0.295f1(x,y))1 0x,y1.
Constr-Ex problem:[5] Constr-Ex problem.[5] Minimize={f1(x,y)=xf2(x,y)=1+yx s.t.={g1(x,y)=y+9x6g1(x,y)=y+9x1 0.1x1, 0y5


See also

References

  1. 20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.

    My blog: http://www.primaboinca.com/view_profile.php?userid=5889534
  2. 20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.

    My blog: http://www.primaboinca.com/view_profile.php?userid=5889534
  3. Template:Cite web
  4. Template:Cite web
  5. 5.0 5.1 5.2 5.3 5.4 Deb, Kalyanmoy (2002) Multiobjective optimization using evolutionary algorithms (Repr. ed.). Chichester [u.a.]: Wiley. ISBN 0-471-87339-X.
  6. Binh T. and Korn U. (1997) MOBES: A Multiobjective Evolution Strategy for Constrained Optimization Problems. In: Proceedings of the Third International Conference on Genetic Algorithms. Czech Republic. pp. 176-182
  7. 7.0 7.1 7.2 Binh T. (1999) A multiobjective evolutionary algorithm. The study cases. Technical report. Institute for Automation and Communication. Barleben, Germany
  8. Deb K. (2011) Software for multi-objective NSGA-II code in C. Available at URL:http://www.iitk.ac.in/kangal/codes.shtml. Revision 1.1.6
  9. Template:Cite web