Give the description of Simulated Annealing function optimisation method for minimising continuous functions.

INSTRUCTIONS TO CANDIDATES

ANSWER ALL QUESTIONS

For the function 𝑓(𝑥𝑖) = ∑𝑛 −𝑥𝑖 sin √𝑥𝑖 defined in the region 𝑥𝑖 < 1000, 𝑖 = 1. . 𝑛 :

 

1. Give the description of Simulated Annealing function optimisation method for minimising continuous functions. Include its concept, mathematical formulation, and algorithmic implementation. (4 marks)

2. In what aspect(s) the method can be varied? How do variations influence its performance? What are the advantages and deficiencies of the variants of the method? (4 marks)

3. Minimise the function for 𝑛 = 2 using your implementation of the method.  Analyse the results for various values of the parameters of the method. (4 marks)

4. Quantitatively estimate the performance of the method. Explain the differences in performance depending on the parameters of the method. (4 marks)

5. Plot the optimisation trajectory, analyse its dependence on the parameter of the method. (4 marks)

 

Total: 20 marks.

 

 

 

 

For the function defined in Coursework 1 and 𝑛 = 2 :

1. Construct a new function as the intersection of 𝑓(𝑥𝑖) with the plane 𝑥0 = 𝑥1. Provide mathematical expression for this function and plot it. Analyse the function for its roots, extreme points and its behaviour at the limits (5 marks)

2. Find the root(s) of the function using a numerical method of your choice. Compare to the analytical result. (5 marks)

3. Integrate the function using a numerical method of your choice and analytically. Compare the results. (5 marks)

4. How will the function change if constructed as the intersection with the plain containing a different line on the 𝑥0 − 𝑥1 plane? (5 marks)

 

 

Total: 20 marks.

 

 

Attachments:

Expert's Answer

503 Times Downloaded

Related Questions

. Introgramming & Unix Fall 2018, CRN 44882, Oakland University Homework Assignment 6 - Using Arrays and Functions in C

DescriptionIn this final assignment, the students will demonstrate their ability to apply two ma

. The standard path finding involves finding the (shortest) path from an origin to a destination, typically on a map. This is an

Path finding involves finding a path from A to B. Typically we want the path to have certain properties,such as being the shortest or to avoid going t

. Develop a program to emulate a purchase transaction at a retail store. This program will have two classes, a LineItem class and a Transaction class. The LineItem class will represent an individual

Develop a program to emulate a purchase transaction at a retail store. Thisprogram will have two classes, a LineItem class and a Transaction class. Th

. SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 1 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

. Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of