The potential transport network is represented by the directed

graph G $=($V $,$ A $)$ in Figure $2.$ Each arc $($i$,$ j$)$ in A corresponds to a

potential transport service from facility i to facility j$.$ If the service

is activated, a fixed transport cost $($in e$)$ fij occurs plus variable

costs which are proportional to the number of pallets of the

three categories transported; ck

ij $,$ k $=1,2,3,$ indicates the unit

variable transport cost $($in e$)$ for each pallet category k $.$ Variable

costs and fixed costs are reported in Tables $23.$

The model can be formulated as an LFCNDP$,$ whose optimal

solution leads to a daily cost of e $34532$ and the activation of

the transport services corresponding to the arcs $(1,3),(1,4),$

$(2,4),(2,5),(3,6),(4,6),(4,9),(5,7),(6,8)$ and $(7,10).$