Current Theses (partially in German)
Retail distribution with limited after-hour access: a time-constrained vehicle routing extension
2025/07/21
Master thesis
In modern grocery logistics, late-night deliveries are possible through secure key-based access to dedicated supermarket storage areas. However, capacity restrictions mean only a few trucks can be delayed beyond official time windows. The objective of this thesis is to adapt the Multi-Commodity Multi-Depot Vehicle Routing Problem with Soft Time Windows to a setting in which a limited number of products may be delivered outside the opening hours without affecting the objective. To test computational performance, the model will then be implemented and solved with a standard solver.
Basic implementation skills in an object-oriented programming language are required for working on this topic.
Interested in this topic? Please read about the application procedure on our website!
Supervisor: Constantin Wildt, M.Sc.
A systematic literature review on the Family Traveling Salesperson Problem
2025/07/21
Bachelor thesis, Master thesis
The Family Traveling Salesperson Problem (FTSP) is a variant of the widely known Traveling Salesperson Problem (TSP) in which the set of nodes is subdivided into disjoint node families. The FTSP seeks for the shortest tour with a predetermined number of visits per node family. The objective of this thesis is to conduct a systematic literature review on the FTSP by analyzing different problem variants, their applications and solution procedures which exist in literature.
Interested in this topic? Please read about the application procedure on our website!
Supervisor: Constantin Wildt, M.Sc.
Debt settlement optimization with transaction constraints in peer-to-peer payment networks
2025/07/21
Bachelor thesis
Group activities often lead to shared expenses and complex webs of who owes whom. Furthermore, constraints like individual transaction limits or different repayment options of the peers impede the rebalancing of the debts. The objective of this thesis is to develop an optimization model by extending the classical transportation problem to this problem setting such that an optimal debt settlement plan (e.g., a plan with a minimal number of transactions, a plan with minimal transaction costs, …) is determined. To test computational performance, the model will then be implemented and solved with a standard solver.
Basic implementation skills in an object-oriented programming language are required for working on this topic.
Interested in this topic? Please read about the application procedure on our website!
Supervisor: Constantin Wildt, M.Sc.
A sensitivity analysis of problem parameters when solving the Traveling Salesperson Problem
2025/07/21
Bachelor thesis
The Traveling Salesperson Problem (TSP) is a widely known problem in OR and serves as a base for many routing applications. Consequently, numerous both heuristic and exact solution procedures exist to solve the TSP. The objective of this thesis is to implement and compare existing exact and heuristic solution procedures for the TSP and to conduct a sensitivity analysis regarding the problem instance parameters.
Basic implementation skills in an object-oriented programming language are required for working on this topic.
Interested in this topic? Please read about the application procedure on our website!
Supervisor: Constantin Wildt, M.Sc.
A systematic literature review on variants of the Traveling Salesperson Problem and their model formulations
2025/07/21
Bachelor thesis
The Traveling Salesperson Problem (TSP) is a widely known problem in OR and serves as a base for many routing applications. Over the years, a vast number of problem variations have been developed. The objective of this thesis is to give a systematic overview of the problem variants, their applications, and to analyze their model formulations in comparison to the classical TSP.
Interested in this topic? Please read about the application procedure on our website!
Supervisor: Constantin Wildt, M.Sc.
Cuts in vehicle routing problems
2025/07/17
Master thesis
The topic is on identifying, understanding, and classifying cuts in vehicle routing literature. Please be aware that modeling skills are needed to work on the topic.
Interested in this topic? Please read about the application procedure on our website!
Supervisor: Prof. Dr. Felix Weidinger
Modelling approaches for picker routing in warehouses
2025/07/17
Bachelor thesis
The topic is on different mixed integer linear modeling approaches for the picker routing problem in warehouses. Formulations must be identified in the literature, understood, explained, and compared.
Interested in this topic? Please read about the application procedure on our website!
Supervisor: Prof. Dr. Felix Weidinger
Graph Neural Networks: Concepts and Applications
2025/07/17
Bachelor thesis
The topic tackles fundamentals of Graph Neural Networks (GNN). The technique needs to be introduced and explained in your own words. Further, about three areas of application need to be discussed. Hereby, the setups solved by GNNs need to be explained as well as how the GNNs are technically implemented in the given setups.
Interested in this topic? Please read about the application procedure on our website!
Supervisor: Prof. Dr. Felix Weidinger
Room exploration algorithms in unknown environments
2025/07/17
Bachelor thesis, Master thesis
The topic tackles the implementation and testing of existing room exploration algorithms. The algorithms need to be identified, understood, and implemented in a virtual or real-world environment (via a microbit robot).
Interested in this topic? Please read about the application procedure on our website!
Supervisor: Prof. Dr. Felix Weidinger
Column Generation in Deep-Lane Storage Warehouses
2025/07/17
Master thesis
The idea of the topic is to develop a column generation approach for Deep Lane Storage Assignment as discussed in Boysen et al. (2018). Please note that programming and modeling skills are required to work on the topic. Furthermore, the successful completion of module Warehousing and Delivery Logistics is recommended.
Interested in this topic? Please read about the application procedure on our website!
Supervisor: Prof. Dr. Felix Weidinger