Robust optimization for volume variation in timber processing

Wei Wang , Yongzhi Zhang , Jun Cao , Wenlong Song

Journal of Forestry Research ›› 2017, Vol. 29 ›› Issue (1) : 247 -252.

PDF
Journal of Forestry Research ›› 2017, Vol. 29 ›› Issue (1) : 247 -252. DOI: 10.1007/s11676-017-0416-5
Original Paper

Robust optimization for volume variation in timber processing

Author information +
History +
PDF

Abstract

Volume variation is an uncertainty element which affects timber processing. We studied the volume variation of logs caused by quality defects in traditional timber processing and set up an optimization approach, using a robust optimization method. We used total number of acceptable boards produced to study the relationship between board thickness and raw material logs, using a heuristic search algorithm to control the variation of board volume to improve the output of boards, reduce the quantity of by-products, and lower production costs. The robust optimization method can effectively control the impact of volume variations in timber processing, reduce cutting waste as far as possible using incremental processing and increase profits, maximize the utilization ratio of timber, prevent waste in processing, cultivate the productive type of tree species and save forest resources.

Keywords

Timber mill / Volume variation / Heuristic search algorithm / Robust optimization

Cite this article

Download citation ▾
Wei Wang, Yongzhi Zhang, Jun Cao, Wenlong Song. Robust optimization for volume variation in timber processing. Journal of Forestry Research, 2017, 29(1): 247-252 DOI:10.1007/s11676-017-0416-5

登录浏览全文

4963

注册一个新账户 忘记密码

References

[1]

Alem DJ, Morabito R. Production planning in furniture settings via robust optimization. Comput Oper Res, 2012, 39(2): 139-150.

[2]

Alvarez PP, Vera JR. Application of robust optimization to the sawmill planning problem. Ann Oper Res, 2014, 219(1): 457-475.

[3]

Ben-Tal A, Nemirovski A. Robust solutions of Linear Programming problems contaminated with uncertain data. Math Program, 2000, 88(3): 411-424.

[4]

Bental A, Goryashko A, Guslitzer E, Nemirovski A. Robust solutions to uncertain linear programs. OR Lett, 1999, 25(1): 1-13.

[5]

Bertsimas D, Sim M. Robust discrete optimization and network flows. Math Program, 2003, 98(1): 49-71.

[6]

Bertsimas D, Sim M (2004) Robust discrete optimization and downside risk measures. National University of Singapore, working paper

[7]

Bertsimas D, Sim M. The price of robustness. Oper Res, 2004, 52(1): 35-53.

[8]

Leung SCH, Chan SSW. A goal programming model for aggregate production planning with resource utilization constraint. Comput Ind Eng, 2009, 56(3): 1053-1064.

[9]

Liu SC, Lin CC. A heuristic method for the combined location routing and inventory problem. Int J Adv Manuf Technol, 2005, 26(4): 372-381.

[10]

Maturana S, Pizani E, Vera J. Scheduling production for a sawmill: a comparison of a mathematical model versus a heuristic. Comput Ind Eng, 2009, 59(4): 667-674.

[11]

Soyster AL. Convex programming with set-inclusive constraints and applications to inexact linear programming. Oper Res, 1973, 21(5): 1154-1157.

[12]

Varas M, Maturana S, Pascual R, Vargas I, Vera J. Scheduling production for a sawmill: a robust optimization approach. Int J Prod Econ, 2014, 150(6): 37-51.

[13]

Zanjani MK, Kadi DA, Nourelfath M. Robust production planning in a manufacturing environment with random yield: a case in sawmill production planning. Eur J Oper Res, 2010, 201(3): 882-891.

AI Summary AI Mindmap
PDF

125

Accesses

0

Citation

Detail

Sections
Recommended

AI思维导图

/