##
**Cost allocation in collaborative forest transportation.**
*(English)*
Zbl 1188.90154

Summary: Transportation planning is an important part of the supply chain or wood flow chain in forestry. There are often several forest companies operating in the same region and collaboration between two or more companies is rare. However, there is an increasing interest in collaborative planning as the potential savings are large, often in the range 5-15%. There are several issues to agree on before such collaborative planning can be used in practice. A key question is how the total cost or savings should be distributed among the participants. In this paper, we study a large application in southern Sweden with eight forest companies involved in a collaboration. We investigate a number of sharing mechanisms based on economic models including Shapley value, the nucleolus, separable and non-separable costs, shadow prices and volume weights. We also propose a new allocation method, with the aim that the participants relative profits are as equal as possible. We use two planning models, the first is based on direct flows between supply and demand points and the second includes backhauling. We also study how several time periods and geographical distribution of the supply and demand nodes affect the solutions. Better planning within each company can save about 5% and collaboration can increase this about another 9% to a total of 14%. The proposed allocation method is shown to be a practical approach to share the overall cost/savings.

### MSC:

90B90 | Case-oriented studies in operations research |

90B06 | Transportation, logistics and supply chain management |

90C05 | Linear programming |

### Keywords:

transportation; OR in natural resources; supply chain management; logistics; economics; group decisions and negotiations; linear programming; backhauling
PDF
BibTeX
XML
Cite

\textit{M. Frisk} et al., Eur. J. Oper. Res. 205, No. 2, 448--458 (2010; Zbl 1188.90154)

### References:

[1] | Anderson, R. C.; Claus, A., Cost allocation in transportation system, Southern Economic Journal, 43, 1, 793-803 (1976) |

[2] | Bottema, O., On the area of a triangle in Barycentric coordinates, Crux Mathematicorum, 8, 228-231 (1982) |

[3] | Carlsson, D.; Rönnqvist, M., Backhauling in forest transportation – models, methods and practical usage, Canadian Journal of Forest Research, 37, 2612-2623 (2007) |

[4] | Epstein, R.; Morales, R.; Sern, J.; Weintraub, A., Use of OR systems in the Chilean forest industries, Interfaces, 29, 7-29 (1999) |

[6] | Forsberg, M.; Frisk, M.; Rönnqvist, M., FlowOpt - A decision support tool for strategic and tactical transportation planning in forestry, International Journal of Forest Engineering, 16, 101-114 (2005) |

[7] | Granot, D., A generalized linear production model: A unifying model, Mathematical Programming, 34, 212-222 (1986) · Zbl 0604.90142 |

[8] | Hof, J.; Field, R., On the possibility of using joint cost allocation in forest management decision making, Forest Science, 33, 4, 1035-1046 (1987) |

[9] | Lemaire, J., An application of game theory: Cost allocation, Astin Bulletin, 14, 1 (1984) |

[10] | Megido, N., Computational complexity of the game theory approach to cost allocation for a tree, Mathematics of Operations Research, 3, 3 (1978) |

[11] | Owen, G., On the core of linear production games, Mathematical Programming, 9, 358-370 (1975) · Zbl 0318.90060 |

[12] | Schmeidler, D., The nucleolus of a characteristic function game, SIAM Journal on Applied Mathematics, 17/6, 1163-1170 (1969) · Zbl 0191.49502 |

[13] | Shapley, L. S., A value for \(n\)-person Games, Annals of Mathematics Studies, 28, 307-317 (1953) · Zbl 0050.14404 |

[14] | Tijs, S. H.; Driessen, T. S.H., Game theory and cost allocation problems, Management Science, 32, 8, 1015-1028 (1986) · Zbl 0595.90110 |

[15] | Weintraub, A.; Epstein, R.; Morales, R.; Sern, J.; Traverso, P., A truck scheduling system improves efficiency in the forest industries, Interfaces, 26, 4, 1-12 (1996) |

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.