What is the correct way to program in GAMS the following Subtours elimination equation for VRP approach MTZ?
1) u(i) - u(j) + n*x(i,j) <= n - dj
2) di<=u(i)<=n[/b][/i][/i]
Fuente : Toth, P. and Vigo, D,Vehicle Routing: Problems,Methods and applications, second edition, 2014.
Thanks.
subtour elimination constraints VRP
-
- User
- Posts: 8
- Joined: 6 years ago
Re: subtour elimination constraints VRP
Hi,
I am pretty not sure what d_i means, but I suggest u should start with look for
tsp2.gms in GAMS model library. Your equation looks quite similar as the subtour
elimination constraint in travelling salesman problem (TSP).
I am pretty not sure what d_i means, but I suggest u should start with look for
tsp2.gms in GAMS model library. Your equation looks quite similar as the subtour
elimination constraint in travelling salesman problem (TSP).