求求哪位大哥或大姐帮下忙，我的模型不会用Lingo求解

denniceyang

下面是我摘得一部分，QQ号为363786435，如果能加我，非常感谢！
{Q} set of RDCs;
{R } set of predetermined service routes, each is a sequence of drop-off sites;
{S} set of predetermined shipping shedules, each specifies a sequence of drop-off tasks;
{L}  set of locations;
{O}  set of orders;
TLijkt = 1: if order i from location j to RDC k during period t is assigned to a TL route; 0 otherwise;
TLijkt= 1: if order i from location j to RDC k during period t is assigned to a LTL service; 0 otherwise;
Xkrt = number of TL trucks assigned to route r from RDC k during t;
PTL = unit capacity of TL trucks;
PLTL = unit capacity of LTL vehicles;
CTL(r) = unit cost of TL service along route r ;
CLTL(jk) = unit cost of LTL service from RDC k for location j;
dijkt = demand by order i from location j to RDC k during t;
eijkt = expected due date of order i from location j to RDC k during t;
aijkt = arrival time of order i from j to RDC k during t;
mjkr = transportation time from RDC k to location j  along route r;
mjkL = transportation time from RDC k to location j by LTL service;
T  distribution radius;   
dkj  distance from RDC k to location j
M  an enough larger positive number
Zkj=1:if RDC k serves location j; 0 otherwise.

        
    The objective function in (1) aim to minimize the total operating cost including total TL service cost and total LTL service cost.  Constraint set (2) assigns any order to either a TL route or a LTL service.  Constraint set (3) ensures that the demands (quantity) generated during period t along any route r can be satisfied by total TL and LTL resources assigned to the route during t.  constraint set (4) ensures that in an extreme case when no order uses TL route, xkrt hould be zero. Constraint sets (5) and (6) are timing constraints that force the orders to be delivered on time, either by TL or LTL service.  Constraint set (7) guarantees that the demand of each customer or location will be met by at least one RDC.  Constraint set (8) guarantees that each RDC’s distribution zone is limited within a circle with the radius of T.  If the distance from RDC k to location j is not exceed the distribution radius T, then the demand from location j may be met by RDC k; otherwise, the demand from location j can only be met by other RDCs.  Constraint set (9) ensures that in an extreme case when RDC k does not serve location j, Zkj should be zero, namely the demand of location j satisfied by RDC k equals 0.  Otherwise the demand of location j satisfied by RDC k must be taken a positive number which is less than or equal to M.

olh2008

RDC选址优化模型？Lingo的资料论坛上都有，你去看一看，其实不难的。最好是自己用Lingo求解一下，如果有不明白的可以和我探讨一下。

suxiangshiwoha

~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~`

denniceyang

回复 2# olh2008


   好的，谢谢你

为你奋斗

～～～～～能力不足，正在学习中！

数学达人@

努力中。。。。。。。。。。。。。。。

可叹烟雨

饿的能力也太差了，唉，失败啊~~

缦埗

回复 olh2008 的帖子

嗯？发个链接吧，很有兴趣啊。想看看，不过找不着啊