scholarly journals Using Mixed Integer Goal Programming in Final Yield Harvest Planning: A Case Study from the Mediterranean Region of Turkey

Forests ◽  
2020 ◽  
Vol 11 (7) ◽  
pp. 744
Author(s):  
Mehmet Demirci ◽  
Ahmet Yeşil ◽  
Pete Bettinger

A mixed integer goal programming model is developed to address the regeneration planning problems of even-aged forests in the Mediterranean region of Turkey. The unique aspect of the goal programming formulation is to minimize deviations in scheduled wood product volumes and the size of harvest areas within each time period, as these are important goals for the management area. About 98% of the forests in Turkey are considered even-aged, and 2% are uneven-aged. Therefore, an age class method is used for the planning of even-aged forests. For the areas where this method is applied, reaching the optimal age class structure is the first priority. This involves implementing final harvests (clearcuts) to regenerate an amount of forest area into each age class. To meet the local market’s needs, forest enterprises also require the final yield to be fairly equal each year. Further, it is desired that the harvest area (regeneration area) is relatively equal each year, to address operational considerations. A linear goal programming model is developed to address the problem. The minimization of deviations from both the harvest area and harvest volume targets are incorporated as goals in the objective function of the model. Several scenarios are solved using the extended version of Lingo 16. A scenario with weights of 0.8 for area and 0.2 for volume produces the best results. Here, the total deviation for 20 years is 3.8 ha in area and 2889 m3 in volume. In the actual regeneration plan, the area deviation for 10 years is 54.72 ha (6.2% of total regeneration area), and the volume deviation is 20,472 m3 (9.8% of harvest volume). The model described through this study can be developed further and integrated into forest management planning software and processes used for the planning of even-aged forests in the Mediterranean region.

2016 ◽  
Vol 33 (02) ◽  
pp. 1650012 ◽  
Author(s):  
Prerna Manik ◽  
Anshu Gupta ◽  
P. C. Jha ◽  
Kannan Govindan

Digital revolution has resulted in a paradigm shift in the field of marketing with online advertising becoming increasingly popular as it offers the reach, range, scale and interactivity to organizations to influence their target customers. Moreover, web advertisement is the primary revenue stream for several websites that provide free services to internet users. The website management team needs to do a lot of planning and optimally schedule various advertisements (ads) to maximize revenue, taking care of advertisers’ needs under system constraints. In this paper, we have considered the case of news websites that provide news to its viewers for free with ads as the primary source of their revenue. The considered news website consists of many webpages with different banners for advertisement. Each banner consists of different number of partitions and cost per partition varies for different rectangular banners. Many ads compete with each other for their placement on a webpage on a specific banner, based on partition requirement, at specific time interval(s). Here, we have formulated a mixed integer 0–1 linear programming advertisement scheduling problem to maximize the revenue over planning horizon divided into time intervals under various system and technical constraints. A case is presented to show the applicability of the model. Branch and bound integer programming and goal programming techniques have been used to solve the formulated problem.


Sign in / Sign up

Export Citation Format

Share Document