Example of an a) algorithm chain and b) algorithm tree. In both cases, we start with the bees swarm algorithm and use the best a) and the three best results b) as starting values for the Levenberg-Marquardt local optimization algorithm (LM), respectively. Afterwards, we apply the error estimation algorithm (Error) to the result(s) of the Levenberg-Marquardt algorithm. In case of an algorithm chain we get one final result (R1), whereas we get three different results (R1, R2, R3) for an algorithm tree.