Abstract
Road blocking due to thawing or heavy rains annually contribute to a considerable loss in Swedish forestry. Companies are forced to build up large stocks of raw material (saw and pulp logs) in order to secure a continuous supply when access to the road network is uncertain. Storage outdoors leads to quality deterioration and monetary losses. Other related costs due to road blocking are road damage and longer haulage distances. One approach to reduce the losses due to road blocks is to upgrade the road network to a standard that guarantees accessibility. We consider the road upgrade problem from the perspective of Swedish forest companies with a planning horizon of about one decade. The objective is to minimize the combined upgrade and transportation costs. We present two mixed integer programming models, which are uncapacitated fixed charge network flow problems including multiple assortments, several time periods and a set of road classes. One model is based on arc flows and one on route flows. For a typical planning instance, the models become large and we propose how to improve solution performance through model strengthening. The models are tested in a case study for a major Swedish forest company.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs, New Jersey (2003)
Andaleft, N., Andaleft, P., Guignard, M., Magendzo, A., Wainer, A., Weintraub, A.: A problem of forest harvesting and road building solved through model strengthening and lagrangean relaxation. Oper. Res. 51, 613–628 (2003)
Anon. Nationell vägbatabas – specifikation av innehåll. Technical report, Vägverket – avd. för väginformatik, Version 3.0. (1999)
Arvidsson, P-Å., Flisberg, P., Forsberg, M., Jönsson, A., Rönnqvist, M.: BIT, beslutstöd för investeringar i bärighetshöjande åtgärder. working report 470. Technical report, The Forest Research Institute of Sweden (2000) (in Swedish)
Arvidsson, P-Å., Jönsson, A.: Industrivisa effekter av bristande bärighet, working report 445. Technical report, The Forest Research Institute of Sweden (2000) (in Swedish)
Barnhardt, C., Jin, H., Vance, P.H.: Railroad blocking: a network design application. Oper. Res. 48(4), 603–615 (2000)
Barnhardt, C., Johnson, E.L., Nemhauser, G.L., Savelsbergh, M.V.P., Vance, P.: Branch-and-price: column generation for solving huge integer programs. Oper. Res. 46(1), 316–332 (1998)
Barnhardt, C., Johnson, E.L., Nemhauser, G.L., Sigismondi, G., Vance, P.: Formulating a mixed integer programming problem to improve solvability. Oper. Res. 41(6), 1013–1019 (1993)
Brimberg, J., Hansen, P., Lih, K.-W., Mladenovic, N., Breton, M.: An oil pipeline design problem. Oper. Res. 51(2), 228–239 (2003)
Cea, C., Jofre, A.: Linking strategic and tactical forestry planning decisions. Ann. Oper. Res. 95(1–4), 131–158 (2000)
Fourer, R., Gay, D.M., Kernighan, B.W.: AMPL – A Modelling Language for Mathematical Programming. Scientific Press Danvers, Massachusetts, USA (1993)
Frisk, M., Karlsson, J., Rönnqvist, M.: Roadopt – A decision support system for road upgrading in forestry. Scand. J. For. Res. 21(Suppl. 7), 5–15 (2006)
Ghamlouche, I., Crainic, T.G., Gendreau, M.: Cycle-based neighbourhoods for fixed-charge capacitated multicommodity network design. Oper. Res. 51(4), 655–667 (2003)
Guignard, M., Ryu, C., Spielberg, K.: Model tightening for integrated timber harvest and transportion planning. Eur. J. Oper. Res. 111, 448–460 (1998)
Gunn, E.A., Richards, E.: Optimizing stand level forest harvesting using a tradeoff objective function. In: Proceeding of the Seventh Symposium on Systems Analysis in Forest Resources, Bellaire, Michigan, 28–31 May 1997
Holmberg, K., Yuan, D.: Optimization of internet protocol network design and routing. Networks 43(1), 39–53 (2003)
Karlsson, J., Flisberg, P., Gunnarsson, H., Rönnqvist, M.: Modelling of road investments. Technical report LiTH-MAT-R-2002-13, Department of Mathematics, Linköping Institute of Technology, Sweden (2003)
Kim, H.-J., Hooker, J.N.: Solving fixed-charge network flow problems with a hybrid optimization and constraint programming approach. Ann. Oper. Res. 115(1), 95–124 (2002)
Kirby, M.W., Hager, W.A., Wong, P.: Simultaneous planning of wildland management and transportation alterations. In: TIMS Studies in the Management Sciences, vol. 21, pp. 371–387. Elsevier, North Holland, The Netherlands (1986)
Kirby, M.W., Wong, P., Hager, W.A., Huddleston, M.E.: Guide to the integrated resources planning models. Technical report, USDA Management Sciences Staff, Berkeley, California (1980)
Löfroth, C., Adolfsson, J., Persson, B., Persson, T., Bergström, J.: Handledning av nvdb - registrering av skogsbilvägar. Technical report, The Forest Research Institute of Sweden (2000) (in Swedish)
Olsson, L.: Optimization of forest road investments and the roundwood supply chain. PhD thesis, The Swedish University of Agricultural Sciences (2004)
Ortega, F., Wolsey, L.A.: A branch-and-cut algorithm for the single commodity, uncapacitated, fixed-charged network flow problem. Networks 41(3), 143–158 (2003)
Patriksson, M.: The Traffic Assignment Problem – Models and Methods. VSP, Utrecht, The Netherlands (1994)
Rardin, R.L., Wolsey, L.A.: Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems. Eur. J. Oper. Res. 71, 95–109 (1993)
Richards, E., Gunn, E.A.: Tabu search for difficult forest management optimization problems. Can. J. For. Res. 33, 1126–1133 (2003)
Weintraub, A., Navon, D.: A forest management planning model integrating silvicultural and transportaion activities. Manage. Sci. 22(12), 1299–1309 (1976)
Wolsey, L.A.: Integer Programming Wiley Interscience Series in Discrete Mathematics and Optimization. Wiley, New York (1998)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Henningsson, M., Karlsson, J. & Rönnqvist, M. Optimization Models for Forest Road Upgrade Planning. J Math Model Algor 6, 3–23 (2007). https://doi.org/10.1007/s10852-006-9047-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10852-006-9047-0