My research interests focus on mathematical programming models, as well as exact, heuristic, and hybrid algorithms for solving NP-hard combinatorial optimization problems, with an emphasis on variants of the traveling salesman problem, the vehicle routing problem, the knapsack problem, and various graph-related problems. I have worked on automatic algorithm generation methods based on genetic programming and adaptive operator combination, applied to these combinatorial optimization problems. In recent years, my research has evolved toward hybrid approaches that integrate machine learning and optimization, exploring the use of machine learning for intelligent search space reduction and for enhancing the performance of metaheuristic algorithms.