scholarly journals Fitting Volume Models for Parana Pine With a Nonlinear Regression, Genetic Algorithm and Simulated Annealing

2022 ◽  
Vol 14 (2) ◽  
pp. 36
Author(s):  
Emanuel Arnoni Costa ◽  
Cristine Tagliapietra Schons ◽  
César Augusto Guimarães Finger ◽  
André Felipe Hess

Improving volumetric quantification of Parana pine (Araucaria angustifolia) in Mixed Ombrophilous Forest is a constant need in order to provide accurate and timely information on current and future growing stock to ensure forest management. Thus, the present study aimed to evaluate and compare the volume estimates obtained through Nonlinear Regression (NR), Genetic Algorithm (GA) and Simulated Annealing (SA) in order to generate accurate volume estimates. Volumetric equations were developed including the independent variables diameter at breast height (dbh), total height (h) and crown rate (cr) and from the fit through the NR, GA and SA approaches. The GA and SA approaches evaluated proved to be a reliable optimization strategy for parameter estimation in Parana pine volumetric modelling, however, no significant differences were found in comparison with the NR approach. This study therefore contributes through the generation of robust equations that could be used for accurate estimates of the volume of the Parana pine in southern Brazil, thus supporting the planning and establishment of management and conservation actions.

2011 ◽  
Vol 189-193 ◽  
pp. 3131-3136
Author(s):  
Yu Yu Zhou ◽  
Yun Qing Rao ◽  
Chao Yong Zhang ◽  
Guo Jun Zhang

In this paper we address a rectangular packing problem (RPP), which is one of the most difficult NP-complete problems. First, greedy biggest space sequencing (GBSS) is presented as a new placement strategy, which is very essential to RPP. Then, borrowing from the respective advantages of the two algorithms, genetic algorithm (GA) and simulated annealing (SA), a hybrid optimization policy is developed. The hybrid GASA is subjected to a test using a set of benchmarks. Compared to other approaches from the literature the hybrid optimization strategy performs better.


1995 ◽  
Vol 21 (1) ◽  
pp. 1-28 ◽  
Author(s):  
Samir W. Mahfoud ◽  
David E. Goldberg

2013 ◽  
Vol 651 ◽  
pp. 548-552
Author(s):  
Parinya Kaweegitbundit

This paper considers two stage hybrid flow shop (HFS) with identical parallel machine. The objectives is to determine makespan have been minimized. This paper presented memetic algorithm procedure to solve two stage HFS problems. To evaluated performance of propose method, the results have been compared with two meta-heuristic, genetic algorithm, simulated annealing. The experimental results show that propose method is more effective and efficient than genetic algorithm and simulated annealing to solve two stage HFS scheduling problems.


Sign in / Sign up

Export Citation Format

Share Document