SCOOP - OPTSICOM
Rafa Martí and Anna Martínez-Gavara coordinate the research project entitled Supply Chain Optimization (SCOOP)
This is a joint project with Rey Juan Carlos University (URJC) and includes 20 researchers. In this project we develop algorithms, based on metaheuristic methods,
which integrated in a software, solve hard optimization problems. It is funded by the Spanish Goverment with the code PID2021-125709OB (2022-2024).
The collaboration between our group and the URJC team (GRAFO) started in 2006 when Profs. Martí and Duarte published a paper in the European Journal of Operational Research. Since then, both teams have published together almost 50 JCR-indexed papers and 25 book chapters, and their research has been presented in more than 50 international conferences. This collaboration has received remarkable evaluations on previous joint funded projects, such as: TIN2012-35632, TIN2015-65460 or PGC2018-095322.
In the OPTSICOM website, codes, instances and best known solutions for the problems in which we are working are available. You can directly download from here the LOLIB and MDPLIB 2.0.
Discrete diversity and dispersion maximization. A review and an empirical analysis from an OR perspective
Martí, R., Martínez-Gavara, A., Sánchez-Oro, J., and S. Pérez-Peló European Journal of Operational Research 299 (3) Invited review, 795 - 813 (2022)
Max-min dispersion with capacity and cost for a practical location problem
Lozano-Osorio, I., Martínez-Gavara, A., Martí, R., Duarte, A. Expert Systems With Applications 200, 116899 (2022)
A Review of the Role of Heuristics in Stochastic Optimisation: from metaheuristics to learnheuristics
Juan, A., Keenan, P., Martí, R., McGarraghy, S., Panadero, J., Carroll, P., Oliva, D. Annals of Operations Research 2021 (available upon request)
Measuring diversity. A review and an empirical analysis
Francisco Parreño, Ramón Álvarez-Valdés, Rafael Martí European Journal of Operational Research 289, 515-532 (2021)
Scatter Search for the Minimum Leaf Spanning Tree Problem
Singh Kardam, Y., Kamal Srivastava, Pallavi Jain, and Rafael Martí Computers and Operations Research 145, 195858 (2022)
Tabu search tutorial. A Graph Drawing Application
Glover, F., Campos, V. Martí, R. TOP 29, 319–350 (2021)
The Capacitated Dispersion Problem. A mathematical model and a scatter search metaheuristic
Martí, R., Martínez-Gavara, A., Sánchez-Oro, J. Memetic Computing 13, 131-146 (2021)
Heuristics for the Capacitated Dispersion Problem
Peiró, J, I. Jiménez, J. Laguardia, R. Martí International Transactions in Operational Research 28, 119 - 141 (2021)
A Strategic Oscillation Simheuristic for the Time Capacitated Arc Routing Problem with Stochastic Demands
Panadero, J., P. Keenan, A. Juan, R. Martí, S. McGarraghy Computers and Operations Research 133, 105377 (2021)