Scribd Logo
Upload

Welcome to Scribd!

  • 20 views

    Hill Climbing

    Uploaded by

    Michael Key
    1. The document discusses Hill Climbing and Simulated Annealing algorithms for minimizing functions. It implements Hill Climbing using best improvement and first improvement on test functions like De Jong, Schwefel, Rastrigin, and Camel Back. 2. The algorithms are compared on test functions of varying dimensions for number of iterations, minimum fitness, maximum fitness, average fitness, and standard deviation. Best improvement generally provides better results than first improvement. 3. Implementation details include using a bitstring vector to represent parameter values, random initialization, and defining neighborhood as Hamming distance 1 from a vector.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content

    You might also like

    Hill Climbing

    Uploaded by

    Michael Key
    20 views4 pages
    1. The document discusses Hill Climbing and Simulated Annealing algorithms for minimizing functions. It implements Hill Climbing using best improvement and first improvement on test functions like De Jong, Schwefel, Rastrigin, and Camel Back. 2. The algorithms are compared on test functions of varying dimensions for number of iterations, minimum fitness, maximum fitness, average fitness, and standard deviation. Best improvement generally provides better results than first improvement. 3. Implementation details include using a bitstring vector to represent parameter values, random initialization, and defining neighborhood as Hamming distance 1 from a vector.

    Original Description:

    Original Title

    hill_climbing.docx

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    1. The document discusses Hill Climbing and Simulated Annealing algorithms for minimizing functions. It implements Hill Climbing using best improvement and first improvement on test functions like De Jong, Schwefel, Rastrigin, and Camel Back. 2. The algorithms are compared on test functions of varying dimensions for number of iterations, minimum fitness, maximum fitness, average fitness, and standard deviation. Best improvement generally provides better results than first improvement. 3. Implementation details include using a bitstring vector to represent parameter values, random initialization, and defining neighborhood as Hamming distance 1 from a vector.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    20 views4 pages

    Hill Climbing

    Uploaded by

    Michael Key
    1. The document discusses Hill Climbing and Simulated Annealing algorithms for minimizing functions. It implements Hill Climbing using best improvement and first improvement on test functions like De Jong, Schwefel, Rastrigin, and Camel Back. 2. The algorithms are compared on test functions of varying dimensions for number of iterations, minimum fitness, maximum fitness, average fitness, and standard deviation. Best improvement generally provides better results than first improvement. 3. Implementation details include using a bitstring vector to represent parameter values, random initialization, and defining neighborhood as Hamming distance 1 from a vector.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    of 4

    Hill Climbing:

    1.Problema: Minimizarea unor functii folosind folosind algoritmi Hill Climbing si Simulated Annealing.
    2.Algoritmi utilizati:Hill Climbing folosind best improvement si first improvement.
    3.Detalii de implementare:pentru reprezentarea parametrilor functiei am folosit un vector de bitseti , in
    C++ .Initializarea se face random.(Se aleg random valorile puse in vectorul de bitseti initial,pentru
    fiecare pozitie din vector).
    Vecinatatea unui vector de bitset este un cod de distanta hemming 1 cu acesta(un vector de bitseti ce
    difera printr-un singur bit de vectorul initial).

    ITERARE HC begin
    t := 0
    initialize best
    repeat
    local := FALSE
    BEGIN HC select a candidate solution (bitstring) vc at random
    evaluate vc
    repeat
    vn := Improve(Neghborhood(vc))
    if eval(vn) is better than eval(vc)
    then vc := vn
    else local := TRUE
    END HC until local
    t := t + 1
    if vc is better than best
    then best := vc
    until t = MAX
    end

    MAX-restrictioneaza numarul de iteratii al algoritmului

    Parametri algoritmului:
    N_bits(17,24..)-numarul de biti necesari pentru reprezentarea unei variabile.
    MAX-numarul maxim de iteratii
    First improvement:
    First Improvement:
    1.DeJongs
    Dimensiunea
    5 10 30
    Nr de executii 30 30 30

    Fitness minim 7.62951e-09 1.5259e-08 4.58009e-08


    Fitness maxim 7.63548e-09 1.5271e-08 4.58248e-08
    Fitness mediu 7.629908e-9 1.52662e-08 4.581446e-8
    Fitness-deviatia 1.5146375462634e-12 3.6615429195525e-12 4.9253461282166e-12
    standard

    2.Schwefel
    Dimensiunea
    5 10 30
    Nr de executii 30 30 30

    Fitness minim -2094.81 -4120.94 -11169.9


    Fitness maxim -1976.37 -3783.05 -10488.6
    Fitness mediu -2069.125 -3916.805862069 -10758.263333333
    Fitness-deviatia 31.194297307084 80.032992996515 147.61430050183
    standard
    3.Rastrigin

    Dimensiunea
    5 10 30
    Nr de executii 30 30 30

    Fitness minim 1.51363e-6 0.34725 0.3467


    Fitness maxim 1.23 5.226 6.12694
    Fitness mediu 0.82782042055833 3.5675806666667 4.439572
    Fitness-deviatia 0.47551139687487 1.0565490380999 1.9536197626694
    standard
    4.6 Hump Camel Back

    Dimensiunea 5
    Nr de executii 30

    Fitness minim -1.03163


    Fitness maxim -1.03163
    Fitness mediu -1.03163
    Fitness-deviatia standard 0
    Best Improvement:

    1.Dejongs
    Dimensiunea
    5 10 30
    Nr de executii 30 30 30

    Fitness minim 7.62951e-09 1.5259e-08 4.58009e-08


    Fitness maxim 7.62951e-09 1.5265e-08 4.58248e-08
    Fitness mediu 7.62951e-09 1.52606E-8 4.581446E-8
    Fitness-deviatia 3.3087224502121e-24 2.6986586706529E-12 5.627248975695E-12
    standard

    2.Schwefel

    Dimensiunea
    5 10 30
    Nr de executii 30 30 30

    Fitness minim -2094.91 -4189.62 -11437.4


    Fitness maxim -2094.6 -3968.06 -10683.3
    Fitness mediu -2094.7963333333 -4091.4786666667 -11081.896666667
    Fitness-deviatia 0.078454174339268 67.473920210002 194.7440291384
    standard

    3.Rastrigin

    Dimensiunea
    5 10 30
    Nr de executii 30 30 30

    Fitness minim 1.51363e-06 0.34725 0.3467


    Fitness maxim 1.001 7.14512 6.12694
    Fitness mediu 0.39815650983833 5.226 4.439572
    Fitness-deviatia 0.49597542893874 3.5675806666667 1.9536197626694
    standard

    4.6 hump camel back

    Dimensiunea 5
    Nr de executii 30

    Fitness minim -1.03163


    Fitness maxim -1.03163
    Fitness mediu -1.03163
    Fitness-deviatia standard 0

    In general,se poate observa faptul ca best improvement ofera rezultate mai bune.

    You might also like