Scribd Logo
Upload

Welcome to Scribd!

  • No Yes

    Uploaded by

    Venkataprasad Palakiti
    6 views2 pages
    The document describes a simulated annealing algorithm for finding a near-optimal solution to a problem. It initializes temperature and counters, generates an initial solution, evaluates its cost. It then generates neighboring solutions, finds the best, and either accepts it or not based on cost difference and probability. It repeats accepting better solutions and occasionally worse ones until temperature decreases and failure count or optimality criteria is met.

    Original Description:

    Original Title

    Ppt

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document describes a simulated annealing algorithm for finding a near-optimal solution to a problem. It initializes temperature and counters, generates an initial solution, evaluates its cost. It then generates neighboring solutions, finds the best, and either accepts it or not based on cost difference and probability. It repeats accepting better solutions and occasionally worse ones until temperature decreases and failure count or optimality criteria is met.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    6 views2 pages

    No Yes

    Uploaded by

    Venkataprasad Palakiti
    The document describes a simulated annealing algorithm for finding a near-optimal solution to a problem. It initializes temperature and counters, generates an initial solution, evaluates its cost. It then generates neighboring solutions, finds the best, and either accepts it or not based on cost difference and probability. It repeats accepting better solutions and occasionally worse ones until temperature decreases and failure count or optimality criteria is met.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 2

    Input Data: m, n, fc, cu, sup, dem

    Initialization T=475; Fr_cnt=0; Accept=0; Total=0

    Generate an initial solution S. Evaluate Cost & store in TC Generate k = (q2-q)/2 neighborhood solutions by pair wise perturbation scheme; identify the best one, S1; cost TC1 Calculate s= (TC1-TC)*100/TC
    NO YES

    s<=0

    Set S=S1; TC=TC1; Accept=Accept+1

    Compute Probability and generate random number Z (0,1)


    NO YES

    Total=Total+1

    Z > Prob

    NO

    If(TOTAL > 4*q) or (ACCEPT > q),


    YES

    Per=Accept*100/Total
    NO

    Per<=15
    YES

    Fr_cnt=Fr_cnt+1

    T=0.9*T; Accept=0; Total=0

    NO

    Fr_cnt= 5 or T >=20
    YES

    End: Near-Optimum Cost

    You might also like