OPTSICOM
Rafael Martí coordinates the OPTSICOM research project. The acronym comes from
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 Ciencia e Innovación under codes TIN2006-02696 (2007-2009) and
TIN2009-07516 (2010-2012), and by the Ministerio de Economía y Competitividad under code TIN2012-35632 (2013-2015).
In the OPTSICOM website , codes, instances and best known solutions for the problems in which we are working are available.
Multi-Start Methods for Combinatorial Optimization
R. Martí, M. Resende, and C. Ribeiro. ,
European Journal of Operational Research 226, 1-8 (2013)
Designing effective improvement methods for Scatter Search
Lars M. Hvattum, A. Duarte, F. Glover and R. Martí,
Soft Computing. 17, 49-62 (2013)
Tabu Search with SO for the Quadratic Mininum Spanning Tree
Lozano, Glover, García-Martinez, Rodríguez and Martí,
IIE Transactions, Accepted in January 2013
A Black-Box Scatter Search for Optimization Problems with Integer Variables
Laguna, Gortázar, Gallego, Duarte, and Martí.
Journal of Global Optimization, Accepted in March 2013
A Hybrid Metaheuristic for the Cyclic Antibandwidth Problem
M. Lozano, A. Duarte, F. Gortázar and R. Martí,
University of Granada, January 2013
Strategic Oscillation for the Quadratic Multiple Knapsack Problem
García-Martinez, Glover, Rodríguez, Lozano, and Martí.
OptTek systems (Boulder, Colorado). February 2013
GRASP with Ejection Chains for the Dynamic Memory Allocation
Sevaux, Rossi, Soto, Duarte, and Martí,
Université de Bretagne-Sud (France). March 2013
GRASP with Path Relinking for the Orienteering Problem
Campos, Martí, Sanchez-Oro, and Duarte,
University Rey Juan Carlos, March 2013
GRASP for the Uncapacitated r-Allocation p-Hub Mediam Problem,
Peiró, Corberán, and Martí,
University of Valencia, April 2013