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 Spanish Goverment for more than 10 years, currently with the code PGC2018-095322-B-C21 (2019-2021).
In the OPTSICOM website, codes, instances and best known solutions for the problems in which we are working are available.
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, 27, 336-360 (2020)
Tabu Search for Min-Max Edge Crossings in Graphs
Pastore, T., Martínez-Gavara, A., Napoletano, A., Festa, P., Martí, R. Computers and Operations Research, 114, (2020)
Adaptive memory programming for the dynamic bipartite drawing problem
Peng, Bo, Donghao Liu, Rafael Martí, Junwen Ding Information Sciences Submitted (under evaluation), (2019)
Heuristics for the Constrained Incremental Graph Drawing Problem
Napoletano, A., Martínez-Gavara, A., Festa, P., Pastore, T., Martí, R. European Journal of Operational Research 274, 710-729 (2019)
Iterated Greedy with VNS for a MultiObjective Waste Collection Problem
Delgado, L., Caballero, R., Sánchez-Oro, J., Colmenar, J.M., Martí, R., Expert Systems with Applications Submitted, in evaluation (2019)