Question 1: STRATEGIES FOR THE PROBLE Define and defend two strategies for determining an initial solution to this knapsack problem for a neighborhood-based heuristic. Copy and paste relevant excerpts of commented Python code to implement your preferred choice. t for several problems you will modify some provided Python code to implement algorithms to solve the same instance of the knapsack problem. After implementing all of the code and solving the problem, you must provide a single table of all results similar to the following: Table 1: Example of results summary (numbers are not realistic) Algorithm Iterations Items Selected Weight Objective Local Search (Best Improvement) 3102 49 97 117 Local Search with Random Restarts (k = 100) Local Search with Random walk (p = 0.25) 9510 121 21 147 2102 87 32 184 etc. Knapsack Problem Definition Given n different items, where each item i has an assigned value (v.) and weight (w), select a combination of the items to maximize the total value without exceeding the weight limitations, W, of the knapsack. IMPORTANT!: When generating random problem instance set you must use the code provided and values: n = 150; max weight of 2500; and, use a seed value (for the random number generator) of 51132023.
Question 1: STRATEGIES FOR THE PROBLE Define and defend two strategies for determining an initial solution to this knapsack problem for a neighborhood-based heuristic. Copy and paste relevant excerpts of commented Python code to implement your preferred choice. t for several problems you will modify some provided Python code to implement algorithms to solve the same instance of the knapsack problem. After implementing all of the code and solving the problem, you must provide a single table of all results similar to the following: Table 1: Example of results summary (numbers are not realistic) Algorithm Iterations Items Selected Weight Objective Local Search (Best Improvement) 3102 49 97 117 Local Search with Random Restarts (k = 100) Local Search with Random walk (p = 0.25) 9510 121 21 147 2102 87 32 184 etc. Knapsack Problem Definition Given n different items, where each item i has an assigned value (v.) and weight (w), select a combination of the items to maximize the total value without exceeding the weight limitations, W, of the knapsack. IMPORTANT!: When generating random problem instance set you must use the code provided and values: n = 150; max weight of 2500; and, use a seed value (for the random number generator) of 51132023.
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
Transcribed Image Text:Question 1: STRATEGIES FOR THE PROBLE
Define and defend two strategies for determining an initial solution to this knapsack
problem for a neighborhood-based heuristic. Copy and paste relevant excerpts of commented Python
code to implement your preferred choice.
Transcribed Image Text:t for several problems you will modify some provided Python code to implement algorithms
to solve the same instance of the knapsack problem. After implementing all of the code and solving the
problem, you must provide a single table of all results similar to the following:
Table 1: Example of results summary (numbers are not realistic)
Algorithm
Iterations Items Selected Weight Objective
Local Search (Best Improvement)
3102
49
97
117
Local Search with Random Restarts (k = 100)
Local Search with Random walk (p = 0.25)
9510
121
21
147
2102
87
32
184
etc.
Knapsack Problem Definition Given n different items, where each item i has an assigned value (v.) and
weight (w), select a combination of the items to maximize the total value without exceeding the weight
limitations, W, of the knapsack.
IMPORTANT!: When generating random problem instance set you must use the code provided and values:
n = 150; max weight of 2500; and, use a seed value (for the random number generator) of 51132023.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY