MATHeuristics

I think “MATHeuristics” can be a nice topic for cooperation between our department at K.U.Leuven and Universität Paderborn (especially the Decision Support & OR Lab with professor Leena Suhl).

I quote a recent call for papers on MATHeuristics to explain the concept:
“
Metaheuristic algorithms and frameworks, such as tabu search, genetic algorithms, VNS, etc., have become important tools for solving problems encountered in logistics, planning and scheduling manufacturing systems. These methods were in fact usually proposed in years when
Mixed Integer Programming (MIP) or other exact solution procedures were seldom a viable option for solving real-world problem instances, or significant sub-problems thereof. However, research on mathematical programming, and in particular on discrete optimization, has led to a state of the art where MIP solvers or mathematical programming techniques can be effective even in a heuristic context, both for finding good primal solutions or as procedures for the exact solution of sub-problems. The term “MATHeuristics” has emerged to distinguish this new research option.
“

MATHeuristics are probably not suitable as an “innovative research concept“ for a “challenging research programme”, but they might be suitable to solve (many types of) decision problems, whatever the joined research concept might be, that we decide to work on. If the research concept is considered as “what we will be doing” (or a definition of the problem), MATHeuristics can possibly be considered as “how to do things” (or a solution method). Bringing together our knowledge on metaheuristics and Paderborn’s expertise in exact solution procedures can certainly be beneficial for both partners.

Feel free to comment on this topic.
Kind regards,
Pieter