HOME	EE509 Fuzzy Logic and applications
	Homework#5                       Due: Thursday, 11/07/05 1. Implement a GA optimization procedure for 0/1 knapsack problem:         Requirements: -    For the given list of 10, 15, 20, 740 items, load the knapsack with weight capacity 200 and volume of 500. Each item can be present only once. -    Use exhaustive search for the problems with 10,15 and 20 items. Measure the time it takes to find the solution. -    Use GA for all problems. Measure the time it takes to stabilize for at least 20 generations at a particular solution. - Use the greedy algorithm for all problems. Measure the time to find a solution. -    Compare times and solutions for exhaustive search, greedy algorithms and GA. Supply charts in the report. Make conclusions. Grading:     60 pts.    The algorithm finds a realistic solution for all problems.     10 pts.    Report satisfying all requirements listed in the syllabus     5 pts.    The (10) GA solution is found within 5%  of being optimal. Determined as the best of 3 runs.     5 pts.    The (15) GA solution is found within 5%  of being optimal. Determined as the best of 3 runs.     5 pts.    The (20) solution is found within 5%  of being optimal. Determined as the best of 3 runs.     10 pts.    The (740) solution is found within 5%  of being the average of class. Determined as the best of 3 runs.     5 pts.    The (740) solution stabilizes to a value within 5% of class average within 5 minutes.     The 740 data file For 10 items use: items 740, 735, 700, 654, 617, 528, 474, 346, 283, 195 For 15 items use: items 528, 474, 346, 283, 195, 59, 94, 182, 244,325, 394, 452, 493, 518, 563 For 20 items use: items 394, 452, 493, 518, 563, 740, 735, 700, 654, 617, 483, 436, 377, 364, 348, 260, 216, 92, 29, 7
BACK TO TOP  Last Updated: October 24, 2005	Contact the instructor at: esazonov@clarkson.edu