陀地驱魔人类似电影:用lingo求解 加权 多目标

有七种规格的包装箱要装到两辆平板车上去。包装箱的宽和高是一样的，但是厚度（t,以厘米计）及其重量（w以公斤计）是不同的。

下表给出了每种包装箱的厚度、重量和数量。每辆平板车有10.2米长的地方可用来装包装箱（像面包片一样），载重为40吨。

由于当地货运的限制，对C5,C6,C7类的包装箱的总数有一定的限制：这类箱子所占的空间（厚度）不能超过302.7厘米。试把包装箱（见下表）装到平板车上去使得浪费的空间最小。C1 C2 C3 C4 C5 C6 C7t厘米 48.7 52.0 61.3 72.0 48.7 52.0 64.0W公斤 2000 3000 1000 500 4000 2000 1000件数 8 7 9 6 6 4 8

model:sets:liu/1..7/:t,w,p;wen/1..2/:;jie(liu,wen):x;endsetsmin=obj;obj=2*k-@sum(jie(i,j):x(i,j)*t(i));@for(wen(j):@sum(liu(i):x(i,j)*t(i))<=k);@for(wen(j):@sum(liu(i)|i#ge#5:x(i,j)*t(i))<=q);@for(wen(j):@sum(liu(i):x(i,j)*w(i))<=M);@for(liu(i):@sum(wen(j):x(i,j))<=p(i));@for(jie(i,j):@gin(x(i,j)));data:t=48.7,52.0,61.3,72.0,48.7,52.0,64.0;w=2,3,1,5,4,2,1;p=8,7,9,6,6,4,8;k=1020;M=40;q=302.7;@text('f:\new\wen.txt')=@write('obj:',' ',obj,@newline(1));@text('f:\new\wen.txt')=@writefor(wen(j):j,' ',@writefor(liu(i):' ',x(i,j)),@newline(1));enddataEndmodel:sets:liu/1..7/:t,w,p;wen/1..2/:;jie(liu,wen):x;endsetsmin=obj;obj=2*k-@sum(jie(i,j):x(i,j)*t(i));@for(wen(j):@sum(liu(i):x(i,j)*t(i))<=k);@for(wen(j):@sum(liu(i)|i#ge#5:x(i,j)*t(i))<=q);@for(wen(j):@sum(liu(i):x(i,j)*w(i))<=M);@for(liu(i):@sum(wen(j):x(i,j))<=p(i));@warn('警告可用',m#lt#10);@for(jie(i,j):@gin(x(i,j)));data:t=48.7,52.0,61.3,72.0,48.7,52.0,64.0;w=2,3,1,5,4,2,1;p=8,7,9,6,6,4,8;k=1020;!M=?;m=40;q=302.7;@text('f:\new\wen.txt')=@write('obj:',' ',obj,@newline(1));@text('f:\new\wen.txt')=@writefor(wen(j):j,' ',@writefor(liu(i):' ',x(i,j)),@newline(1));enddataendmodel:sets:liu/1..7/:t,w,p;wen/1..2/:;jie(liu,wen):x;endsetsmin=obj;obj=2*k-@sum(jie(i,j):x(i,j)*t(i));@for(wen(j):@sum(liu(i):x(i,j)*t(i))<=k);@for(wen(j):@sum(liu(i)|i#ge#5:x(i,j)*t(i))<=q);@for(wen(j):@sum(liu(i):x(i,j)*w(i))<=M);@for(liu(i):@sum(wen(j):x(i,j))<=p(i));@for(jie(i,j):@gin(x(i,j)));data:t=48.7,52.0,61.3,72.0,48.7,52.0,64.0;w=2,3,1,5,4,2,1;p=8,7,9,6,6,4,8;k=1020;M=40;q=302.7;@TEXT('f:\sj\liul.txt') = 'The final chessboard:';@TEXT('f:\sj\liul.txt') = @TABLE(t);@text('f:\sj\wen.txt')=@write('obj:',' ',obj,@newline(1));@text('f:\sj\wen.txt')=@writefor(wen(j):j,' ',@writefor(liu(i):' ',x(i,j)),@newline(1));enddataEndwen.txt中的输出结果obj: 0.61  7 3 4 0 2 1 22  1 3 5 3 1 1 32问题二属于多目标规划方法加权对平板车求最优解的加权model:sets:liu/1..7/:t,w,p;wen/1..2/:qw;jie(liu,wen):x;endsetsmin=obj;obj=lw1+lw2;lw1=qw(1)*(k-@sum(liu(i):x(i,1)*t(i)));lw2=qw(2)*(k-@sum(liu(i):x(i,2)*t(i)));@for(wen(j):@sum(liu(i):x(i,j)*t(i))<=k);@for(wen(j):@sum(liu(i)|i#ge#5:x(i,j)*t(i))<=q);@for(wen(j):@sum(liu(i):x(i,j)*w(i))<=M);@for(liu(i):@sum(wen(j):x(i,j))<=p(i));@for(jie(i,j):@gin(x(i,j)));data:t=48.7,52.0,61.3,72.0,48.7,52.0,64.0;w=2,3,1,5,4,2,1;p=8,7,9,6,6,4,8;k=1020;M=40;q=302.7;qw=1000,1;@text('f:\new\wenjie.txt')=@write('obj:',' ',obj,@newline(1));@text('f:\new\wenjie.txt')=@write('lw1:',' ',lw1,@newline(1),'lw2:',' ',lw2,@newline(1));@text('f:\new\wenjie.txt')=@writefor(wen(j):j,' ',@writefor(liu(i):' ',x(i,j)),@newline(1));enddataendobj: 38.7lw1: 0lw2: 38.71  6 2 6 0 0 0 42  2 3 3 4 0 0 4