| |||||||||||||||||
| |||||||||||||||||
Coco - A full production planning example Description The Coco productional planning problem: multi-item,
multi-period, multi-site production planning. A sequence
of model versions show how the model
was developed, to (a) use more sophisticated modeling features
and (b) to extend the model, taking it from a simple linear model
to one with fixed prices and logical decisions.
Source Files By clicking on a file name, a preview is opened at the bottom of this page.
Data Files xbcoco.c
/********************************************************
BCL Example Problems
====================
file xbcoco.c
`````````````
Complete Coco Problem.
Specify phase by PHASE parameter.
Data input in the model, not via data files.
(c) 2008-2024 Fair Isaac Corporation
author: S.Heipcke, Jan. 2000, rev. Mar. 2011
********************************************************/
#include <stdio.h>
#include "xprb.h"
#define PHASE 5
/* Phase = 3: Multi-period parameterised model; mines always open
* Phase = 4: Mines may open/closed freely; when closed save 20000 per month
* Phase = 5: Once closed always closed; larger saving */
#define NP 2 /* Number of products (p) */
#define NF 2 /* factories (f) */
#define NR 2 /* raw materials (r) */
#define NT 4 /* time periods (t) */
/****DATA****/
double REV[][NT] = /* Unit selling price of product p in period t */
{{400, 380, 405, 350},
{410, 397, 412, 397}};
double CMAK[][NF] = /* Unit cost to make product p at factory f */
{{150, 153},
{ 75, 68}};
double CBUY[][NT] = /* Unit cost to buy raw material r in period t */
{{100, 98, 97, 100},
{200, 195, 198, 200}};
double COPEN[] = /* Fixed cost of factory f being open for one period */
{50000, 63000};
double CPSTOCK = 2.0; /* Unit cost to store any product p */
double CRSTOCK = 1.0; /* Unit cost to store any raw material r */
double REQ[][NR] = /* Requirement by unit of prod. p for raw material r */
{{1.0, 0.5},
{1.3, 0.4}};
double MXSELL[][NT] = /* Max. amount of p that can be sold in period t */
{{650, 600, 500, 400},
{600, 500, 300, 250}};
double MXMAKE[] = /* Max. amount factory f can make over all products */
{400, 500};
double MXRSTOCK = 300; /* Max. amount of r that can be stored each f and t */
double PSTOCK0[][NF] = /* Initial product p stock level at factory f */
{{50, 100},
{50, 50}};
double RSTOCK0[][NF] = /* Initial raw material r stock level at factory f*/
{{100, 150},
{ 50, 100}};
/***********************************************************************/
int main(int argc, char **argv)
{
XPRBvar make[NP][NF][NT], sell[NP][NF][NT], pstock[NP][NF][NT+1],
buy[NR][NF][NT], rstock[NR][NF][NT+1], openm[NF][NT];
XPRBctr ctr;
int p,f,r,t;
XPRBprob prob;
prob=XPRBnewprob("Coco"); /* Initialize a new problem in BCL */
/****VARIABLES****/
for(p=0;p<NP;p++)
for(f=0;f<NF;f++)
{
for(t=0;t<NT;t++)
{
make[p][f][t]=XPRBnewvar(prob,XPRB_PL, XPRBnewname("make_p%d_f%d",p+1,f+1),
0, XPRB_INFINITY);
/* Amount of prod. p to make at factory f in period t */
sell[p][f][t]=XPRBnewvar(prob,XPRB_PL, XPRBnewname("sell_p%d_f%d",p+1,f+1),
0, XPRB_INFINITY);
/* Amount of prod. p sold from factory f in period t */
}
for(t=0;t<NT+1;t++)
pstock[p][f][t]=XPRBnewvar(prob,XPRB_PL, XPRBnewname("pstock_p%d_f%d",p+1,f+1),
0, XPRB_INFINITY);
/* Stock level of prod. p at factory f at start of period t */
}
for(r=0;r<NR;r++)
for(f=0;f<NF;f++)
{
for(t=0;t<NT;t++)
buy[r][f][t]=XPRBnewvar(prob,XPRB_PL, XPRBnewname("buy_r%d_f%d",r+1,f+1),
0, XPRB_INFINITY);
/* Amount of raw material r bought for factory f in period t */
for(t=0;t<NT+1;t++)
rstock[r][f][t]=XPRBnewvar(prob,XPRB_PL, XPRBnewname("rstock_r%d_f%d",r+1,f+1),
0, XPRB_INFINITY);
/* Stock level of raw mat. r at factory f at start of per. t */
}
for(f=0;f<NF;f++)
for(t=0;t<NT;t++)
openm[f][t]=XPRBnewvar(prob,XPRB_BV, XPRBnewname("open_f%d",f+1), 0, 1);
/* 1 if factory f is open in period t, else 0 */
/****OBJECTIVE****/
ctr = XPRBnewctr(prob,"OBJ",XPRB_N);
for(f=0;f<NF;f++) /* Objective: maximize total profit */
{
for(p=0;p<NP;p++)
{
for(t=0;t<NT;t++)
{
XPRBaddterm(ctr, sell[p][f][t], REV[p][t]);
XPRBaddterm(ctr, make[p][f][t], -1*CMAK[p][f]);
}
for(t=1;t<NT+1;t++)
XPRBaddterm(ctr, pstock[p][f][t], -1*CPSTOCK);
}
if(PHASE==4)
for(t=0;t<NT;t++)
XPRBaddterm(ctr, openm[f][t], 20000-COPEN[f]);
else if(PHASE==5)
for(t=0;t<NT;t++)
XPRBaddterm(ctr, openm[f][t], -1*COPEN[f]);
for(r=0;r<NR;r++)
{
for(t=0;t<NT;t++)
XPRBaddterm(ctr, buy[r][f][t], -1*CBUY[r][t]);
for(t=1;t<NT+1;t++)
XPRBaddterm(ctr, rstock[r][f][t], -1*CRSTOCK);
}
}
XPRBsetobj(prob,ctr); /* Select objective function */
/****CONSTRAINTS****/
for(p=0;p<NP;p++)
for(f=0;f<NF;f++)
for(t=0;t<NT;t++)
{
ctr=XPRBnewctr(prob,"PBal",XPRB_E); /* Product stock balance */
XPRBaddterm(ctr, pstock[p][f][t], 1);
XPRBaddterm(ctr, make[p][f][t], 1);
XPRBaddterm(ctr, sell[p][f][t], -1);
XPRBaddterm(ctr, pstock[p][f][t+1], -1);
}
for(r=0;r<NR;r++)
for(f=0;f<NF;f++)
for(t=0;t<NT;t++)
{
ctr=XPRBnewctr(prob,"RBal",XPRB_E); /* Raw material stock balance */
XPRBaddterm(ctr, rstock[r][f][t], 1);
XPRBaddterm(ctr, buy[r][f][t], 1);
XPRBaddterm(ctr, rstock[r][f][t+1], -1);
for(p=0;p<NP;p++)
XPRBaddterm(ctr, make[p][f][t], -1*REQ[p][r]);
}
for(p=0;p<NP;p++)
for(t=0;t<NT;t++)
{ /* Limit on the amount of product p to be sold */
ctr=XPRBnewctr(prob,"MxSell",XPRB_L);
for(f=0;f<NF;f++)
XPRBaddterm(ctr, sell[p][f][t], 1);
XPRBaddterm(ctr, NULL, MXSELL[p][t]);
}
for(f=0;f<NF;f++)
for(t=0;t<NT;t++)
{
ctr=XPRBnewctr(prob,"MxMake",XPRB_L); /* Capacity limit at factory f */
for(p=0;p<NP;p++)
XPRBaddterm(ctr, make[p][f][t], 1);
XPRBaddterm(ctr, openm[f][t], -1*MXMAKE[f]);
}
for(f=0;f<NF;f++)
for(t=1;t<NT+1;t++)
{
ctr=XPRBnewctr(prob,"MxRStock",XPRB_L); /* Raw material stock limit */
for(r=0;r<NR;r++)
XPRBaddterm(ctr, rstock[r][f][t], 1);
XPRBaddterm(ctr, NULL, MXRSTOCK);
}
if(PHASE==5)
for(f=0;f<NF;f++)
for(t=0;t<NT-1;t++)
{
ctr=XPRBnewctr(prob,"Closed",XPRB_L); /* Once closed, always closed */
XPRBaddterm(ctr, openm[f][t+1], 1);
XPRBaddterm(ctr, openm[f][t], -1);
}
/****BOUNDS****/
for(p=0;p<NP;p++)
for(f=0;f<NF;f++)
XPRBfixvar(pstock[p][f][0], PSTOCK0[p][f]); /* Initial product levels */
for(r=0;r<NR;r++)
for(f=0;f<NF;f++)
XPRBfixvar(rstock[r][f][0], RSTOCK0[r][f]); /* Initial raw mat. levels */
if(PHASE<=3)
for(f=0;f<NF;f++)
for(t=0;t<NT;t++)
XPRBfixvar(openm[f][t],1);
/****SOLVING + OUTPUT****/
XPRBsetsense(prob, XPRB_MAXIM); /* Choose the sense of the optimization */
XPRBmipoptimize(prob, ""); /* Solve the MIP-problem */
printf("Objective: %g\n", XPRBgetobjval(prob)); /* Get objective value */
/* Uncomment to print out the solution values: */
/* for(p=0;p<NP;p++)
for(f=0;f<NF;f++)
for(t=0;t<NT;t++)
printf("%s:%g %s:%g ", XPRBgetvarname(make[p][f][t]),
XPRBgetsol(make[p][f][t]), XPRBgetvarname(sell[p][f][t]),
XPRBgetsol(sell[p][f][t]));
printf("\n");
for(p=0;p<NP;p++)
for(f=0;f<NF;f++)
for(t=0;t<NT+1;t++)
printf("%s:%g ", XPRBgetvarname(pstock[p][f][t]), XPRBgetsol(pstock[p][f][t]));
printf("\n");
for(r=0;r<NR;r++)
for(f=0;f<NF;f++)
{
for(t=0;t<NT;t++)
printf("%s:%g ", XPRBgetvarname(buy[r][f][t]), XPRBgetsol(buy[r][f][t]));
for(t=0;t<NT+1;t++)
printf("%s:%g ", XPRBgetvarname(rstock[r][f][t]), XPRBgetsol(rstock[r][f][t]));
}
for(f=0;f<NF;f++)
for(t=0;t<NT;t++)
printf("%s:%g ", XPRBgetvarname(openm[f][t]), XPRBgetsol(openm[f][t]));
printf("\n");
*/
return 0;
}
| |||||||||||||||||
| © Copyright 2023 Fair Isaac Corporation. |
