• Formulations and Metaheuristics for combinatorial optimization problems
  • Rey Barra, Carlos Rodrigo <1990>


  • MAT/09 Ricerca operativa


  • Combinatorial optimization problems have been strongly addressed throughout history. Their study involves highly applied problems that must be solved in reasonable times. This doctoral Thesis addresses three Operations Research problems: the first deals with the Traveling Salesman Problem with Pickups and Delivery with Handling cost, which was approached with two metaheuristics based on Iterated Local Search; the results show that the proposed methods are faster and obtain good results respect to the metaheuristics from the literature. The second problem corresponds to the Quadratic Multiple Knapsack Problem, and polynomial formulations and relaxations are presented for new instances of the problem; in addition, a metaheuristic and a matheuristic are proposed that are competitive with state of the art algorithms. Finally, an Open-Pit Mining problem is approached. This problem is solved with a parallel genetic algorithm that allows excavations using truncated cones. Each of these problems was computationally tested with difficult instances from the literature, obtaining good quality results in reasonable computational times, and making significant contributions to the state of the art techniques of Operations Research.


  • 2022-04-08


  • Doctoral Thesis
  • PeerReviewed


  • application/pdf



Rey Barra, Carlos Rodrigo (2022) Formulations and Metaheuristics for combinatorial optimization problems, [Dissertation thesis], Alma Mater Studiorum Università di Bologna. Dottorato di ricerca in Ingegneria biomedica, elettrica e dei sistemi , 34 Ciclo. DOI 10.48676/unibo/amsdottorato/10031.