Skip to main content

Research Repository

Advanced Search

On the comparison of initialisation strategies in differential evolution for large scale optimisation (2017)
Journal Article
Segredo, E., Paechter, B., Segura, C., & González-Vila, C. I. (2018). On the comparison of initialisation strategies in differential evolution for large scale optimisation. Optimization Letters, 12(1), 221-234. https://doi.org/10.1007/s11590-017-1107-z

Differential Evolution (DE) has shown to be a promising global opimisation solver for continuous problems, even for those with a large dimensionality. Different previous works have studied the effects that a population initialisation strategy has on... Read More about On the comparison of initialisation strategies in differential evolution for large scale optimisation.

Parallelization of the nearest-neighbour search and the cross-validation error evaluation for the kernel weighted k-nn algorithm applied to large data dets in matlab (2009)
Presentation / Conference Contribution
Rubio, G., Guillen, A., Pomares, H., Rojas, I., Paechter, B., Glosekotter, P., & Torres-Ceballos, C. I. (2009, June). Parallelization of the nearest-neighbour search and the cross-validation error evaluation for the kernel weighted k-nn algorithm applied to large data dets in matlab. Presented at 2009 International Conference on High Performance Computing & Simulation

The kernel weighted k-nearest neighbours (KWKNN) algorithm is an efficient kernel regression method that achieves competitive results with lower computational complexity than Least-Squares Support Vector Machines and Gaussian Processes. This paper pr... Read More about Parallelization of the nearest-neighbour search and the cross-validation error evaluation for the kernel weighted k-nn algorithm applied to large data dets in matlab.

Finding feasible timetables using group-based operators. (2007)
Journal Article
Lewis, R. M. R., & Paechter, B. (2007). Finding feasible timetables using group-based operators. IEEE Transactions on Evolutionary Computation, 11, 397-413. https://doi.org/10.1109/TEVC.2006.885162

This paper describes the applicability of the so-called "grouping genetic algorithm" to a well-known version of the university course timetabling problem. We note that there are, in fact, various scaling up issues surrounding this sort of algorithm a... Read More about Finding feasible timetables using group-based operators..