Tournament acceptance is able to improve search efficiency by restricting the number of candidates passed from the nested, to the master GA. To exploit this further, the MLaGA can also be run with a pool based population where the surrogate model is trained for each new data point resulting from an electronic structure calcu-lation. In this case, the search must progress in serial. Despite the potential for further reduction in the number of calculations required, this may end up being time consuming. This is because, performing the electronic structure calculations cannot be parallelized, as would be possible with the generational population. When this methodology is utilized the number of energy calculations required to search the convex hull is approximately 310.