Wingkins
unread,Apr 6, 2011, 9:16:28 AM4/6/11Sign in to reply to author
Sign in to forward
You do not have permission to delete messages in this group
Either email addresses are anonymous for this group or you need the view member email addresses permission to view the original message
to AIMMS - The Modeling System, ie_w...@ust.hk
Hello,
I am currently building a model involving the vehicle routing problem
about distribution center distribute goods to different districts and
so to analyze the minimum cost. After I had amlost finish the model,
there are no optimal result came out. I doubt that it may be related
to the binary variable setting condition, but I am not sure. I would
be greatly appreciate for your help as this model is very essential to
me! Below are the describtion of the problem and the system that we
did.
Indices
i index of plant ( i = 1,2...m)
j index of warehouse( j = 1,2,..n)
Parameters
SupplyAi = number of units available at plant i
DemandBj= number of units demanded at warehouse j
unitcostCij= the cost of shipping one unit from plants i to warehouse
j
routinecostDij = fixed cost asociated with route ( i,j)
Decision variable
transportunitXij = the unknown quantity to be transproted on route
( i,j )
totaltransportcostfij(x) = total transportation cost for shipping per
unit from plant i to warehouse j in which fij(x) = Cij * Xij will be a
cost function if it is linear
The usual objective function is to minimiz the total variable cost
and fixed costs from the allocation. it is one of the combinatorial
problem invovlving constraints. This fcTP with m plants and n
warehouse can be formulated as follows:
min f(x) = summation( Fij(x) + Dij * Gij (x)) , i from
1 to n , j from 1 to m
Such that summation (Xij) <= Ai i = 1,2,...m
summation (Xij) >= Bj j = 1,2,....n
Xij >= 0 , for all i,j
wit BInaryGij ( x) = if Xij>0 then equal to 1
otherwise equal to 0
Here is our model file