Francisco Parreno

Francisco Parreno

Universidad de Castilla-La Mancha
Albacete, Spain

Researcher


Bio

Francisco Parreño is a researcher at the University of Castilla-La Mancha, Ciudad Real, affiliated with the High School of Computer Engineering of Albacete. He has been cited over 1,339 times and has published 35 research papers in the field of combinatorial optimization and operations research.

His research focuses on the integration of mathematical programming methods and metaheuristics, recognizing the advantages and huge potentials of building hybrids of these approaches. His work demonstrates that many problems can be practically solved much better by exploiting synergies between different optimization approaches than by traditional “pure” algorithms.


Research Focus

Combinatorial Optimization: His work includes maximum diversity problems that arise in practical settings from facility location to social networks, and constitute an important class of NP-hard problems in combinatorial optimization.

Container Loading Problems: His research covers container loading problems (CLP), in which a set of boxes have to be loaded into containers or onto trucks, which are at the core of many transportation problems, with good solutions to these packing problems being crucial for the efficient use of logistic resources.

Cutting Problems: He has worked on the glass cutting problem proposed by Saint Gobain for the 2018 ROADEF challenge, which includes specific constraints that prevent the direct application of procedures developed for the standard cutting problem.

Hybrid Approaches: His research contributes to the growing area of integrating machine learning techniques into meta-heuristics for solving combinatorial optimization problems, representing a significant trend in operations research and optimization.


Affiliations

  • High School of Computer Engineering of Albacete - Universidad de Castilla-La Mancha
  • Operations Research and Combinatorial Optimization Group

Interests

Combinatorial Optimization | Integer Programming | Metaheuristics | Container Loading Problems | Cutting Problems