Efficient Subpopulation Based Parallel TLBO Optimization Algorithms
AbstractA numerous group of optimization algorithms based on heuristic techniques have been proposed in recent years. Most of them are based on phenomena in nature and require the correct tuning of some parameters, which are specific to the algorithm. Heuristic algorithms allow problems to be solved more quickly than deterministic methods. The computational time required to obtain the optimum (or near optimum) value of a cost function is a critical aspect of scientific applications in countless fields of knowledge. Therefore, we proposed efficient algorithms parallel to Teaching-learning-based optimization algorithms. TLBO is efficient and free from specific parameters to be tuned. The parallel proposals were designed with two levels of parallelization, one for shared memory platforms and the other for distributed memory platforms, obtaining good parallel performance in both types of parallel architectures and on heterogeneous memory parallel platforms. View Full-Text
Share & Cite This Article
García-Monzó, A.; Migallón, H.; Jimeno-Morenilla, A.; Sánchez-Romero, J.-L.; Rico, H.; Rao, R.V. Efficient Subpopulation Based Parallel TLBO Optimization Algorithms. Electronics 2019, 8, 19.
García-Monzó A, Migallón H, Jimeno-Morenilla A, Sánchez-Romero J-L, Rico H, Rao RV. Efficient Subpopulation Based Parallel TLBO Optimization Algorithms. Electronics. 2019; 8(1):19.Chicago/Turabian Style
García-Monzó, Alejandro; Migallón, Héctor; Jimeno-Morenilla, Antonio; Sánchez-Romero, José-Luis; Rico, Héctor; Rao, Ravipudi V. 2019. "Efficient Subpopulation Based Parallel TLBO Optimization Algorithms." Electronics 8, no. 1: 19.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.