hw1_neighborhood_search - 3 Hill climbing method Use three...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
MAE 552 – Heuristic Optimization Homework #1 Due Date: Friday Feb 8, 2002 Instructor: Dr. Kurt Hacker Problem One In a heuristic search algorithm, one of the primary goals is to balance the global and local search components. Discuss how this balance is problem dependent in terms of the size of the search space, the presence or absence of constraints, the shape of the response surface (i.e. the topography of the design space), the difficulty or ease of calculating the objective function and constraints, and the user requirements for near optimality in the solution. Please address each of these issues in a concise paragraph. Problem Two You are presented with the following unconstrained optimization problem. You must use three methods to solve this problem. 1. Enumerative search with grid resolutions of 0.1, 0.01, and 0.001. 2. Random Search with five different numbers of points, the specific number to be chosen by the student. Describe the effect the number of sample points had on the quality of the solution.
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 3. Hill climbing method. Use three different neighborhood sizes to be selected by the student. • Sample 20 points randomly from the neighborhood during neighborhood search. • Select a reasonable number for MAX_ITERATIONS. For each of the above methods each student is required to create an original computer program in a language of their choosing (C++/C, Fortran, Matlab, Visual Basic, etc.). The code should be commented so that it can be easily understood. Results should include tables and graphs where appropriate and include a discussion of the quality of solutions found by each method as well as their efficiency. Keep the discussion concise and short! The entire assignment excluding the code should not be more than 3-4 pages long. It should be completed in Word or some other word processing program. 2 2 3 3 ] 4 4 [ ] 3 / 1 . 2 4 [ ) ( Minimize 2 1 2 2 2 2 2 1 2 1 4 1 2 1 ≤ ≤-≤ ≤-+-+ + +-= x x x x x x x x x x F...
View Full Document

This note was uploaded on 07/09/2011 for the course MAE 522 taught by Professor Hacker during the Spring '10 term at SUNY Buffalo.

Ask a homework question - tutors are online