Scribd Logo
Upload

Welcome to Scribd!

  • Simulated annealing algorithms for combinatorial optimization problems

    Uploaded by

    rohit_raj21
    8 views1 page
    The document lists 7 references related to simulated annealing algorithms and their applications: 1. The first 3 references are about using simulated annealing algorithms to solve combinatorial optimization problems like the traveling salesman problem. 2. The 4th reference is about using a greedy gradient-simulated annealing hyper-heuristic to solve a course timetabling problem. 3. The last 3 references are also about using simulated annealing approaches for the traveling salesman problem and electric load forecasting.

    Original Description:

    Original Title

    refrences

    Copyright

    © © All Rights Reserved

    Available Formats

    DOC, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document lists 7 references related to simulated annealing algorithms and their applications: 1. The first 3 references are about using simulated annealing algorithms to solve combinatorial optimization problems like the traveling salesman problem. 2. The 4th reference is about using a greedy gradient-simulated annealing hyper-heuristic to solve a course timetabling problem. 3. The last 3 references are also about using simulated annealing approaches for the traveling salesman problem and electric load forecasting.

    Copyright:

    © All Rights Reserved
    Download as DOC, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    8 views1 page

    Simulated annealing algorithms for combinatorial optimization problems

    Uploaded by

    rohit_raj21
    The document lists 7 references related to simulated annealing algorithms and their applications: 1. The first 3 references are about using simulated annealing algorithms to solve combinatorial optimization problems like the traveling salesman problem. 2. The 4th reference is about using a greedy gradient-simulated annealing hyper-heuristic to solve a course timetabling problem. 3. The last 3 references are also about using simulated annealing approaches for the traveling salesman problem and electric load forecasting.

    Copyright:

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

    [3]. P. Czyzak, A.

    Jaszkiewicz, Pareto simulated annealing-a metaheuristic


    techniue !or multi"le#o$%ecti&e com$inatorial o"timization, Journal of Multi#
    Criteria Decision Analysis 7, 3'-'(, )**+.
    [']. ,. ,alek, ,. -uruswamy, ,. Pandya, .. /wens, 0erial and "arallel
    simulated annealing and ta$u search algorithms !or the tra&eling salesman
    "ro$lem, Annals of Operations Research 21, 1*-+', )*+*.
    [1]. 2. -eng, 3. Chen, 4. 5ang, 6. 0hi, 7. 3hao, 0ol&ing the tra&eling salesman
    "ro$lem $ased on an ada"ti&e simulated annealing algorithm with greedy
    search, Applied Soft Computing 11, 38+9-38+*, :9))
    [8]. ,. 7alender, A.7heiri, ;. /zcan, ;.7. <urke, A greedy gradient-simulated
    annealing hy"er-heuristic !or a curriculum-$ased course timeta$ling "ro$lem,
    =n Com"utational =ntelligence >?7C=@, :9): ):th ?7 4orksho" on >"". )-+@.
    =;;;, :9):.
    [7] Hsamettin Bayram , Ramazan ahin,
    A new SIMULATED AEALI! A""R#A$H %#R TRA&ELLI! SALESMA "R#BLEM,
    Mathematical and Computational Applications, &'() *+, ') ,, --) ,*,.,//, /0*,
    [+] Seye1 Ahma1 , Shei2at A(ham1y, E(e3tri3 "'wer L'a1 %'re3astin4 '5 Ba2'( $ity Base1
    'n B" e6ra( etw'r7, Li5e S3ien3e 8'6rna( /0*,
    [9] :ir7-atri7;*99,<

    You might also like