Assgm 3 - Vehicle Routing Problem - MM

Given link $(i,j)$, cost on the link is given by:

where $x_i,y_i$ are the coordinates of node $i$.

DEPOT:
Since I have an even ID number (CA41844HP), I will use node A as a depot. This is node with coordinates:

also known as node 11.

Poin 3 - Fisher & Jaikumar's Heuristic

See slide 79 (page 70 in my iPad) for problem definition

.mod file

y {CLD cross {1..K}} binary;
subject to cc{k in {1..K}}: sum{j in CLD} a[j]*y{j,k} <= C;

.run file

let {p in Depot} a[p] := 0;
# Constraint d_iik = \min(...)

Deleted from ample

.dat file

param a :=

1 0

2 0

3 0

4 0

5 10

6 0

7 0

8 10

9 0

10 0

11 0

12 10

13 10

14 10

15 0

16 0

17 10

18 10

19 10

20 0

21 10

22 0

23 10

24 0 ;