New models and algorithms for distribution logistics

In our research, we will focus on applying state-of-the-art solution methods from combinatorial optimization for finding high-quality solutions to the models to be developed. For optimal procedures, this especially includes integer-programming-based approaches such as branch-and-price, branch-and-cut, and variants of those methods. For heuristic procedures, we envisage various meta-heuristic frameworks (genetic algorithms, tabu search, etc.), and hybrids of exact and heuristic procedures. Specific starting points for our own research are routing under uncertainty (see, e.g., Jaillet, Qi, & Sim, 2016); integration of production, inventory and delivery (Li, Chen, & Tang, 2017), combined location and routing decisions (Akca, Berger, & Ralphs, 2009) and other practice-oriented generalizations of the VRP (Schneider, Stenger, & Hof, 2015). The handbook of Brandimarte and Zotteri (2007) will be our starting point for getting a grasp of the literature in this area (Brandimarte & Zotteri, 2007), and the doctoral courses attended during the first year of the PhD will further guide in mastery of both the models as well as the methods described in this proposal.