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 34 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
 Spring '10
 Hacker
 Optimization, search space, heuristic search algorithm, unconstrained optimization problem, Dr. Kurt Hacker

Click to edit the document details