Scribd
Upload
59 views8 pages

Session-4-Knapsack+TSP (Heuristics)

The document discusses two combinatorial optimization problems: the knapsack problem and the travelling salesman problem (TSP). The knapsack problem involves packing items of different values and weights into a knapsack without exceeding its capacity while maximizing the total value. A greedy heuristic is presented that sorts items by their value-to-weight ratio and packs items in descending order. The TSP involves finding the shortest route to visit each city once. It can be modeled as an assignment problem and solved using branch and bound to eliminate subtours. An example 5-city TSP is shown.

Uploaded by

ttt
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
59 views8 pages

Session-4-Knapsack+TSP (Heuristics)

The document discusses two combinatorial optimization problems: the knapsack problem and the travelling salesman problem (TSP). The knapsack problem involves packing items of different values and weights into a knapsack without exceeding its capacity while maximizing the total value. A greedy heuristic is presented that sorts items by their value-to-weight ratio and packs items in descending order. The TSP involves finding the shortest route to visit each city once. It can be modeled as an assignment problem and solved using branch and bound to eliminate subtours. An example 5-city TSP is shown.

Uploaded by

ttt
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 8

Knapsack Problem

Decision Variables:

Objective Function:

Constraints:
• Applications
• Loading consignments in a truck or
railway wagon.
• Packing telecom bandwidth
requirement in high-capacity
facilities.
Knapsack • Heuristic Approach
Problem • For each item, compute the ratio of
vi/wi (Bang for the Buck ratio)
• Value per unit of Knapsack space
• Which item provides the maximum
value per unit of resource ?
• Highest vi/wi ratio.
• A Greedy Heuristic:
1. Compute Bang for the Buck ratio
for each item.
2. Sort items in decreasing ratio.
Knapsack
3. Pack items, one by one, from the
Problem sorted list, dropping those that
cannot be packed.
Knapsack Problem: Example
Consignment weight Value of Value/box
Number (wi) Cons. (vi) (vi/wi) 100
--------------- ---------------- ---------------- -----------
90
1 30 60 2.0
2 50 60 1.2 80
3 40 40 1.0 70
4 10 10 1.0
5 40 20 0.5 60
6 30 10 0.33 50
7 10 3 0.3
-------------------------------------------------------------------------------- 40
30
Solution: 20
x1 = x2 = x4 = x7 = 1
x3 = x5 = x6 = 0. 10
Z = 60+60+10+3 = 133 0
Travelling Salesman Problem

• Given a set of cities and distances among them, find


a minimum distance tour that visits each city exactly
once.
• Applications
• Routing of trucks
• Order Picking in a warehouse
• Circuit board drilling
Model of TSP

(Where S’ is the compliment of S


and N is the set of all cities)
Branch and Bound Algorithm for TSP

• Relaxing subtour breaking constraints, yields an assignment


problem.
• Easy to solve using Hungarian Algorithm.
• Provides a lower bound.
• Solution is integral but subtour breaking constraints may be
violated.
• How to fix that?
• Using a Branch and Bound Algorithm.
Example: 5-node TSP

Total cost = 154 1-2-5-1, 3-4-3


× 31 90 48 24 Z = 154

31 × 66 26 35 X34 = 0 X43 = 0
90 59 × 32 67
48 26 32 × 25 1-5-1, 2-4-3-2 1-5-1, 2-3-4-2
24 35 67 25 × Z = 165 Z = 172

F
Total cost = 171
165
172
180 X15 = 0 X51 = 0

× 31 90 48 24
×
24
31 × 66 26 35 1-2-4-3-5-1 1-5-4-3-2-1
Z = 180 Z = 171
90 59 × 32
× 67
F F
48 26 32
× × 25
24
× 35 67 25 ×

You might also like