scholarly journals EFEITO DAS RESTRIÇÕES ESPACIAIS DE ADJACÊNCIA NO PLANEJAMENTO FLORESTAL OTIMIZADO

FLORESTA ◽  
2010 ◽  
Vol 40 (3) ◽  
Author(s):  
Lucas Rezende Gomide ◽  
Julio Eduardo Arce ◽  
Arinei Lindbeck da Silva
Keyword(s):  
Linear Programming ◽  
Integer Linear Programming ◽  
Net Present Value ◽  
Forest Planning ◽  
Type I ◽  
Harvest Scheduling ◽  
Forest Harvest ◽  
Horizon Planning ◽  
Management Alternatives ◽  
The Impact

O objetivo do estudo foi aplicar restrições espaciais de adjacência no agendamento da colheita florestal em um modelo tradicional de planejamento florestal. Foi analisado e comparado o impacto no VPL (valor presente líquido) e na produção volumétrica de madeira. A área de estudo foi composta por 52 talhões de eucalipto. Foram simuladas 254 alternativas de manejo, sendo então criados 4 cenários de agendamento da colheita florestal envolvendo o uso da programação linear inteira, seguindo a formulação pelo modelo tipo I com maximização do VPL e um horizonte de planejamento de 7 anos. O cenário 1 não considerou a adjacência, enquanto que os cenários 2 (URM), 3 (ARM50) e 4 (ARM70) continham restrições de adjacência. Os resultados demonstraram que as restrições de adjacência reduzem o VPL em 3,74%, 2,24% e 2,10%, e a produção volumétrica em 2,92%, 1,79% e 1,73%, nos cenários 2, 3 e 4 respectivamente. Porém, os cenários 2, 3 e 4 obtiveram sucesso no controle de corte de talhões adjacentes, segundo suas restrições, e impedindo a formação de extensas áreas contiguas como encontrado no cenário 1 (153,25 ha).Palavras-chave: Programação linear inteira; restrição URM; restrição ARM. AbstractSpatial adjacency constraints effect in optimized forest planning. The objective of the study was to apply the spatial adjacency constraints in the forest harvest scheduling when using the traditional forest planning model. It was analyzed and compared the impact on NPV (Net Present Value) and the volumetric production of wood. The area of study was formed by 52 stands of eucalyptus. A total of 254 forest management alternatives were simulated, where 4 forest harvest scheduling scenarios contained the integer linear programming were created, following the model type I and the maximization of the NPV for 7 years of the horizon planning. Spatial adjacency constraints were applied to scenarios 2 (URM), 3 (ARM50) and 4 (ARM70) but not to scenario 1. The results showed that the spatial adjacency constraints reduced NPV in 3,74%, 2,24% and 2,10%, and the volumetric production in 2,92%, 1,79% e 1,73% through the scenarios 2, 3, and 4, respectively. Therefore, the scenarios 2, 3, and 4 obtained success in controlling the adjacent harvested stands, according to their restrictions, and avoiding the creation of large and continuous areas such as observed in the scenario 1 (153,25ha).Keywords: Integer linear programming; URM constraint; ARM constraint.

scholarly journals META-HEURISTIC CLONAL SELECTION ALGORITHM FOR OPTIMIZATION OF FOREST PLANNING

2018 ◽  
Vol 41 (6) ◽  
Author(s):  
Carlos Alberto Araújo Júnior ◽  
João Batista Mendes ◽  
Christian Dias Cabacinha ◽  
Adriana Leandra de Assis ◽  
Lisandra Maria Alves Matos ◽  
...  
Keyword(s):  
Linear Programming ◽  
Integer Linear Programming ◽  
Net Present Value ◽  
New Technologies ◽  
Clonal Selection ◽  
Forest Planning ◽  
Initial Population ◽  
Planning Problem ◽  
Clonal Selection Algorithm ◽  
Selection Algorithm

ABSTRACT It is important to evaluate the application of new technologies in the field of computational science to forest science. The goal of this study was to test a different kind of metaheuristic, namely Clonal Selection Algorithm, in a forest planning problem. In this problem, the total management area is 4.210 ha that is distributed in 120 stands in ages between 1 and 6 years and site indexes of 22 m to 31 m. The problem was modeled considering the maximization of the net present value subject to the constraints: annual harvested volume between 140,000 m3 and 160,000 m3, harvest ages equal to 5, 6 or 7 years, and the impossibility of division of the management unity at harvest time. Different settings for Clonal Selection Algorithm were evaluated to include: varying selection, cloning, hypermutation, and replacement rates beyond the size of the initial population. A generation value equal to 100 was considered as a stopping criteria and 30 repetitions were performed for each setting. The results were compared to those obtained from integer linear programming and linear programming. The integer linear programming, considered to be the best solution, was obtained after 1 hour of processing. The best setting for Clonal Selection Algorithm was 80 individuals in the initial population and selection. Cloning, hypermutation, and replacement rates equal to 0.20, 0.80, 0.20 and 0.50, respectively, were found. The results obtained by Clonal Selection Algorithm were 1.69% better than the integer linear programming and 4.35% worse than the linear programming. It is possible to conclude that the presented metaheuristic can be used in the resolution of forest scheduling problems.

scholarly journals A Mixed Integer Linear Programming Method for Simultaneous Multi-Periodic Train Timetabling and Routing on a High-Speed Rail Network

2020 ◽  
Vol 12 (3) ◽  
pp. 1131
Author(s):  
Wenliang Zhou ◽  
Xiaorong You ◽  
Wenzhuang Fan
Keyword(s):  
Linear Programming ◽  
Integer Linear Programming ◽  
Mixed Integer Linear Programming ◽  
High Speed ◽  
Programming Model ◽  
Mixed Integer ◽  
High Speed Rail ◽  
Train Timetabling ◽  
Train Timetable ◽  
The Impact

To avoid conflicts among trains at stations and provide passengers with a periodic train timetable to improve service level, this paper mainly focuses on the problem of multi-periodic train timetabling and routing by optimizing the routes of trains at stations and their entering time and leaving time on each chosen arrival–departure track at each visited station. Based on the constructed directed graph, including unidirectional and bidirectional tracks at stations and in sections, a mixed integer linear programming model with the goal of minimizing the total travel time of trains is formulated. Then, a strategy is introduced to reduce the number of constraints for improving the solved efficiency of the model. Finally, the performance, stability and practicability of the proposed method, as well as the impact of some main factors on the model are analyzed by numerous instances on both a constructed railway network and Guang-Zhu inter-city railway; they are solved using the commercial solver WebSphere ILOG CPLEX (International Business Machines Corporation, New York, NY, USA). Experimental results show that integrating multi-periodic train timetabling and routing can be conducive to improving the quality of a train timetable. Hence, good economic and social benefits for high-speed rail can be achieved, thus, further contributing to the sustained development of both high-speed railway systems and society.

scholarly journals Association rule hiding using integer linear programming

2021 ◽  
Vol 11 (4) ◽  
pp. 3451
Author(s):  
Suma B. ◽  
Shobha G.
Keyword(s):  
Data Mining ◽  
Linear Programming ◽  
Integer Linear Programming ◽  
Association Rule ◽  
Real Life ◽  
Linear Program ◽  
Integer Linear Program ◽  
Optimization Approach ◽  
Integer Linear Program Formulation ◽  
The Impact

<span>Privacy preserving data mining has become the focus of attention of government statistical agencies and database security research community who are concerned with preventing privacy disclosure during data mining. Repositories of large datasets include sensitive rules that need to be concealed from unauthorized access. Hence, association rule hiding emerged as one of the powerful techniques for hiding sensitive knowledge that exists in data before it is published. In this paper, we present a constraint-based optimization approach for hiding a set of sensitive association rules, using a well-structured integer linear program formulation. The proposed approach reduces the database sanitization problem to an instance of the integer linear programming problem. The solution of the integer linear program determines the transactions that need to be sanitized in order to conceal the sensitive rules while minimizing the impact of sanitization on the non-sensitive rules. We also present a heuristic sanitization algorithm that performs hiding by reducing the support or the confidence of the sensitive rules. The results of the experimental evaluation of the proposed approach on real-life datasets indicate the promising performance of the approach in terms of side effects on the original database.</span>

scholarly journals The Effects of Spatial Harvest Scheduling Constraints on the Value of a Medium-Sized Forest Holding in the Southeastern United States

2005 ◽  
Vol 29 (4) ◽  
pp. 185-193 ◽  
Author(s):  
Wise H. Batten ◽  
Pete Bettinger ◽  
Jianping Zhu
Keyword(s):  
Net Present Value ◽  
Southeastern United States ◽  
Economic Value ◽  
Forest Planning ◽  
Harvest Scheduling ◽  
Present Value ◽  
Period 2 ◽  
Planning Technique ◽  
Programming Solution ◽  
Forest Plans

Abstract Forest plans related to a number of spatial harvest scheduling scenarios were developed for a medium-sized forest holding using a heuristic forest planning technique (tabu search). Green-up periods of 2 to 7 years were assessed in conjunction with the two types of adjacency constraints. The results indicate for this one property that a short green-up period (2–3 years) did not significantly affect the economic value of the forest holding studied. Longer green-up periods and smaller maximum clearcut sizes could reduce the net present value of this forest holding by as much as 5 to 15% depending on the clearcut adjacency rules used. In a validation of the heuristic solutions, we found that the best solution generated with the heuristic (for three separate problems) was within 0.25% of the integer programming solution. South. J. Appl. For. 29(4):185–193.

scholarly journals An Application of Linear Programming for Short-Term Harvest Scheduling

1988 ◽  
Vol 5 (2) ◽  
pp. 145-148 ◽  
Author(s):  
Douglas C. Macmillan ◽  
Stephen E. Fairweather
Keyword(s):  
Linear Programming ◽  
Net Present Value ◽  
Harvest Scheduling ◽  
Present Value ◽  
Short Term ◽  
Planning Period ◽  
Additional Information ◽  
Forest Ownership ◽  
Forest Enterprises ◽  
High Level

Abstract The technique of linear programming (LP) is illustrated by developing a harvest schedule for an industrial forest ownership in northwestern Pennsylvania. The objective was to maximize net present value of the harvest over a five-year planning period. The effect of changes in timber value and growth rate on the optimum schedule was determined. Sensitivity analysis provided additional information the manager could use to make decisions. In order to successfully apply LP, the forester must be able to define the management objective of the harvest schedule and the resource and managerial constraints that will influence its attainment. Data used in the model have to be available and reliable. Many forest enterprises should be in the position to adopt LP since commercial programs for microcomputers are now available for which a high level of computing expertise is not required. North. J. Appl. For. 5:145-148, June 1988.

Optimal harvest scheduling at the forest level in the presence of the risk of fire

1986 ◽  
Vol 16 (2) ◽  
pp. 266-278 ◽  
Author(s):  
W. J. Reed ◽  
D. Errico
Keyword(s):  
Dynamic Equations ◽  
Scheduling Problem ◽  
Deterministic Approach ◽  
Harvest Scheduling ◽  
Forest Harvest ◽  
Timber Supply ◽  
Reasonable Approximation ◽  
Optimal Harvest ◽  
The Impact ◽  
Scheduling Models

The effect of fire on forest yields has been well documented in stand-level analyses; however, forest-level effects are less widely known. A set of dynamic equations can be constructed that describe the evolution of a forest under the impact of harvesting and random fire. When fire is treated in a deterministic fashion, these equations can be used to formulate an optimal harvest scheduling problem that can be solved using linear programming. Examples using white spruce data for the Fort Nelson Timber Supply Area of British Columbia show that even modest rates of fire can have a dramatic impact and that present harvest scheduling models may be considerably overestimating projected forest harvest levels. Results also show that the deterministic approach appears to be a reasonable approximation of the true stochastic fire problem.

scholarly journals AN INTEGER LINEAR PROGRAMMING APPROACH APPLIED TO THE CERRADO (SAVANNA) MANAGEMENT

FLORESTA ◽  
2014 ◽  
Vol 44 (1) ◽  
pp. 1
Author(s):  
Henrique Moreira Dabien Haddad ◽  
Lucas Rezende Gomide ◽  
Bruno Rogério Cruz ◽  
Sérgio Teixeira Da Silva
Keyword(s):  
Linear Programming ◽  
Forest Management ◽  
Integer Linear Programming ◽  
Planning Horizon ◽  
Sensu Stricto ◽  
Programming Approach ◽  
Type I ◽  
Promising Alternative ◽  
Model Type ◽  
Regulation Model

AbstractCerrado presents great potential for the use of its resources, whether timber or non-timber, as fruits, firewood and charcoal. Thus, this study aimed to test the use of forest regulation model type I in a remnant of cerrado, applying the integer linear programming. The studied area was a remnant of cerrado sensu stricto located in São Romão – MG. The type of forest management carried out was the strip cutting. with post regeneration conduction. The model type I was applied generating 8 scenarios considering 14 years of planning horizon. The tested scenarios considered the area control, volume control and also both controls in the same model, where the objective function was to maximize the present value of revenues (PVR). After data processing it was observed that scenario 5 was the best, because it obtained the lowest amplitude variation (425 – 575 ha/year) and volume (18.000 – 21.000 m3/year) of the exploited surface limits, presenting a PVR of R$4,004,561.58. It is possible to conclude that the developed models were able to regulate the volumetric yield in constant flows over the planning horizon, representing a promising alternative for the sustainable planning of the wood resources of the cerrado.Keywords: Mathematical programming; forest regulation; forest management. ResumoUma abordagem aplicada da programação linear inteira no manejo do cerrado. O cerrado apresenta um grande potencial de uso de seus recursos, sejam eles madeireiros ou não madeireiros, como frutos, lenha e carvão vegetal. Assim, o trabalho teve como objetivo testar o uso do modelo tipo I de regulação florestal em um remanescente de cerrado utilizando a programação linear inteira. A área de estudo foi um remanescente de cerrado sensu stricto localizado em São Romão – MG. O regime de manejo elaborado foi o corte em faixas com posterior condução da regeneração. O modelo tipo I foi aplicado gerando 8 cenários em um horizonte de planejamento de 14 anos. Os cenários testados consideraram o controle por área, por volume, bem como ambos no mesmo modelo, sendo a função objetivo o valor presente das receitas (VPR) a ser maximizado. Após o processamento dos modelos observou-se que o cenário 5 foi o melhor, possuindo limites de área explorada (425 – 575 ha/ano) e volumétricos (18.000 – 21.000 m3/ano) com menor variação de amplitude, apresentando R$4.004.561,58 de VPR. Pôde-se concluir que os modelos formulados foram capazes de regular a produção volumétrica em fluxos constantes ao longo do horizonte de planejamento, em sua grande maioria, constituindo-se de uma alternativa promissora ao planejamento sustentável dos recursos madeireiros do cerrado.Palavras-chave: Programação matemática; regulação florestal; manejo florestal.

scholarly journals Transportation Optimization Models for Intermodal Networks with Fuzzy Node Capacity, Detour Factor, and Vehicle Utilization Constraints

Mathematics ◽  
2020 ◽  
Vol 8 (12) ◽  
pp. 2109
Author(s):  
Chia-Nan Wang ◽  
Thanh-Tuan Dang ◽  
Tran Quynh Le ◽  
Panitan Kewcharoenwong
Keyword(s):  
Linear Programming ◽  
Objective Function ◽  
Integer Linear Programming ◽  
Mixed Integer Linear Programming ◽  
Deterministic Model ◽  
Mixed Integer ◽  
Model Parameters ◽  
Total Cost ◽  
The Impact ◽  
Node Capacity

This paper develops a mathematical model for intermodal freight transportation. It focuses on determining the flow of goods, the number of vehicles, and the transferred volume of goods transported from origin points to destination points. The model of this article is to minimize the total cost, which consists of fixed costs, transportation costs, intermodal transfer costs, and CO2 emission costs. It presents a mixed integer linear programming (MILP) model that minimizes total costs, and a fuzzy mixed integer linear programming (FMILP) model that minimizes imprecise total costs under conditions of uncertain data. In the models, node capacity, detour, and vehicle utilization are incorporated to estimate the performance impact. Additionally, a computational experiment is carried out to evaluate the impact of each constraint and to analyze the characteristics of the models under different scenarios. Developed models are tested using real data from a case study in Southern Vietnam in order to demonstrate their effectiveness. The results indicate that, although the objective function (total cost) increased by 20%, the problem became more realistic to address when the model was utilized to solve the constraints of node capacity, detour, and vehicle utilization. In addition, on the basis of the FMILP model, fuzziness is considered in order to investigate the impact of uncertainty in important model parameters. The optimal robust solution shows that the total cost of the FMILP model is enhanced by 4% compared with the total cost of the deterministic model. Another key measurement related to the achievement of global sustainable development goals is considered, reducing the additional intermodal transfer cost and the cost of CO2 emissions in the objective function.

scholarly journals Confusion Analysis and Detection for Workflow Nets

2014 ◽  
Vol 2014 ◽  
pp. 1-14 ◽  
Author(s):  
Xiao-liang Chen ◽  
Zhong-yuan Jiang ◽  
Jian-hong Ye
Keyword(s):  
Linear Programming ◽  
Integer Linear Programming ◽  
High Performance ◽  
Resource Competition ◽  
Reachability Graph ◽  
Decision Behavior ◽  
Workflow Nets ◽  
Detection Approach ◽  
The Impact ◽  
Workflow Net

Option processes often occur in a business procedure with respect to resource competition. In a business procedure modeled with a workflow net (WF-net), all decision behavior and option operations for business tasks are modeled and performed by the conflicts in corresponding WF-net. Concurrency in WF-nets is applied to keep a high-performance operation of business procedures. However, the firing of concurrent transitions in a WF-net may lead to the disappearance of conflicts in the WF-net. The phenomenon is usually called confusions that produces difficulties for the resolution of conflicts. This paper investigates confusion detection problems in WF-nets. First, confusions are formalized as a class of marked subnets with special conflicting and concurrent features. Second, a detection approach based on the characteristics of confusion subnets and the integer linear programming (ILP) is developed, which is not required to compute the reachability graph of a WF-net. Examples of the confusion detection in WF-nets are presented. Finally, the impact of confusions on the properties of WF-nets is specified.

Sign in / Sign up

Export Citation Format

Share Document