Rafa Martí and Abraham Duarte coordinate the OPTSICOM research project with 11 members in 2 universities. The acronym stands for
Optimization of Complex Systems. In this project we develop algorithms, based on metaheuristic methods,
which integrated in a software, solve hard optimization problems. It has
been funded by the Ministerio de Economía y Competitividad with the code TIN2015-65460-C02 (2016-2018).
In the OPTSICOM website, codes, instances and best known solutions for the problems in which we are working are available.
Multi-Objective Memetic Optimization for the Bi-Objective Obnoxious p-Median Problem
J.M. Colmenar, R. Martí, A. Duarte, Knowledge-Based Systems, In press
A Parallel Variable Neighborhood Search Approach for the Obnoxious p-median p-dispersion problem
Herrán, A., J.M. Colmenar, R. Martí, A. Duarte International Transactions in Operations Research, In press
Tabu Search for the Dynamic Bipartite Drawing Problem
R. Martí, A. Martínez-Gavara, J. Sánchez-Oro, A. Duarte Computers and Operations Research, In press
Scatter Search for the Bi-criteria p-median p-dispersion problem,
Colmenar, J.M., A. Hoff, R. Martí, A. Duarte, Progress in Artificial Intelligence, In press.
Models and solution methods for the uncapacitated r-allocation p-hub center problem,
J. Peiró, A. Corberán, M. Laguna, and R. Martí, Int. Transactions in Operations Research, In press.
Intelligent Multi-Start Methods
R. Martí, R. Aceves, M.T. León, J.M. Moreno-Vega and A. Duarte, Handbook of MetaHeuristics, 3rd edition, Gendreau and Potvin (Eds.), Springer (2017), in press
Principles and Strategies of Tabu Search,
Glover, F., M. Laguna, R. Martí, Approximation Algorithms and Metaheuristics, Chapman & Hall/CRC (2017), in press.