Hello can any body suggest me how to solve the below given problem
model file:
set N; # N denotes the set of nodes
set L within {N,N}; # L denotes the set of links
set T := 1..NP; # T denotes the set all paths
set P{T} within {N,N}; # P[p] denotes the arcs in path p That is,
paths are directed.
set Q{N,N} within T; # Q[a,b] denotes the paths that can be
used
to satisfy demand pair (a,b)
param d{N,N} default 0.0; # d[a,b] denotes the demand between node a
& b
set lamda := 1..36;
var y{T,lamda} binary;
var c{L} >= 0;
minimize WorkingCapacity: sum {(i,j) in L} c[i,j];
subject to WorkingDemand {(i,j) in D}:
sum {b in lamda,p in Q[i,j]} y[p,b] = d[i,j];
data file:
param d :=
2 4 10
3 5 10
1 5 10
;
I try to route the above traffic and optimize, which is a static one.
But I need these demand/traffic modelling as per poissons
distribution
and comes with randomly and optimize the result. I think this may be
done using matlab.
Thanks to R.Fourer for the solution and on which I am trying.
Though one solution to the above problem is in AMPL
param d {i in N,j in N: i < j} := Poisson (2) ;
but I am unable to restrict the total number of demand by the above
method, is it possible to resttict it
Secondly is it possible to generate the above data periodically in
reference to system time in AMPL .
thanks & regards,
bm
--
You received this message because you are subscribed to the Google Groups "AMPL Modeling Language" group.
To post to this group, send email to
ampl@....
For more options, visit this group at
http://groups.google.com/group/ampl?hl=en.
