Due to the advances in exact methods and in technology, several mixed integer linear programming (MILP) models can be solved to optimality or close to optimality within a reasonable amount of time. This has encouraged a number of researchers to design heuristics that incorporate phases where MILP or more generally mathematical programming models are solved, the so-called matheuristics. The relation between the original problem and the mathematical programming model or models incorporated in a matheuristic may vary significantly. The scope of this talk is to present the literature on matheuristics proposed for the solution of routing problems, classify the approaches proposed and analyze the characteristics of the different methodologies. The goal is to understand which are the features that make a matheuristic a competitive solution approach for a routing problem and to highlight promising lines of research.
Welcome to everyone!