|
Description of algorithms
The optimization algorithms are required for optimization process.
There are global algorithms and local algorithms. Global algorithms find solutions in all space of rough. Local algorithms find one more diamond in already existent solution or improving already existent diamonds.
Currently total list of global optimization algorithms is following (17 algorithms):
09.Adaptive. Beta
08.Complex 1
08.Single.Flex
08.Adaptive
08. Single
06. Single
08. Quick Duo
07. Complex
07. Adaptive (beta)
|
06. Smart C1
06. Complex 1
06. Semicut
06. Semicut (final)
05. Adaptive
05. Complex
05. Complex 1 (37.5)
|
Single - allocates one diamond in solution
Single Flex is better for allocating one diamond in rough with flat shape
Complex & Adaptive are the most common algorithms for finding two diamonds in solution. Adaptive be able to find better solution than Complex but Adaptive works longer time
Quick Duo is quick algorithm for allocating two diamonds
Complex and Single algorithms work especially efficient with several inclusions in yellow smart mode
SemiCut is better for semi-cuts
The local algorithms:
Next (Space) - allows to find one more diamond in solution.
Searching the next diamond in the whole volume of stone. Existing diamonds of solution are used as limitations.
It finds a maximum by price diamond.
Next (Facet) - allows to find one more diamond in solution. It finds a maximum by price diamond but the table of future diamond is parallels to selected facet of already existent diamond in solution.
Swim - allows to improve already existent diamonds in solution.
And many others.
The local algorithms are used by option Tool.
|