Difference between revisions of "Version 1.7"
Jump to navigation
Jump to search
| Line 21: | Line 21: | ||
*MaturityClass is not mandatory when import stand register data. | *MaturityClass is not mandatory when import stand register data. | ||
| + | *A new function is available to get an overview of all non-default control table settings. Right-click on a control category or control table and select "Show all non-default settings"/"Visa alla ändrade inställningar". A dialog will then open which shows all non-default settings. You can also edit values in this dialog. | ||
| + | |||
==Improvements== | ==Improvements== | ||
*The treatment program generator in PlanWise has a new algorithm which gives more variation in the timing of final felling, and puts more emphasis on early periods. There is now only one setting for how many alternatives to save. The old algoritm would often stop prematurely, before all alternatives had been evaluated, and this happened if "Max Number of Alternatives (to generate)" had been reached. The new algorithm works differently. If 100 alternatives should be saved, and there are 4 possible final felling periods for the first generation, then at most 25 alternatives are saved under each "branch", where each first generation final felling period constitutes a branch. If only 4 programs should be saved in the same example, these will have different final felling periods in the first generation, while the old algorithm often have saved four programs with the same final felling period (in the first generation). | *The treatment program generator in PlanWise has a new algorithm which gives more variation in the timing of final felling, and puts more emphasis on early periods. There is now only one setting for how many alternatives to save. The old algoritm would often stop prematurely, before all alternatives had been evaluated, and this happened if "Max Number of Alternatives (to generate)" had been reached. The new algorithm works differently. If 100 alternatives should be saved, and there are 4 possible final felling periods for the first generation, then at most 25 alternatives are saved under each "branch", where each first generation final felling period constitutes a branch. If only 4 programs should be saved in the same example, these will have different final felling periods in the first generation, while the old algorithm often have saved four programs with the same final felling period (in the first generation). | ||