Variability management in metaheuristics-based algorithms by David Méndez-Acuña

Hi Everybody,

Today’s presentation will be about variability management in metaheuristics-based algorithms, such as simulated annealing or taboo search (oh, sounds so dirty!). The presentation will be given by our newly incorporated Ph.D. student and colombian national, David Méndez-Acuña, a.k.a., the guy that is always cold.

In particular, the talk will explore the case study of a family of algorithms where the members share some commonalities and where the variability can be modeled through feature models. We will also talk about how to use these ideas for building an experimentation platform that allows algorithms to be compared each other in order to find the one offering the best results for a specific problem.

This work was funded by the University of Los Andes (in Bogotá, Colombia). The objective was to find good algorithms for solving some combinatorial problems in the context of sustainable mobility in big Latin-American cities.

Don’t forget your coffee cups and your scientific spirit.

Best regards,
Walter Rudametkin

Update: here’s David’s presentation.