@phdthesis{Frank2022, author = {Frank, Markus}, title = {Modelle und Metaheuristiken f{\"u}r neuartige Tourenplanungsprobleme}, doi = {10.17904/ku.opus-768}, url = {http://nbn-resolving.de/urn:nbn:de:bvb:824-opus4-7684}, school = {Katholische Universit{\"a}t Eichst{\"a}tt-Ingolstadt}, pages = {xiv, 146 Seiten : Illustrationen, Diagramme}, year = {2022}, abstract = {This cumulative dissertation addresses issues related to different, innovative variants of the classical vehicle routing problem (VRP). In the first paper, we investigate a tactical VRP for regular deliveries to grocery retail stores over several planning periods. In contrast to previous approaches, multi-compartment vehicles are used, which allow joint deliveries of different product groups. Thus, synergy effects can be achieved if this is included in the planning of the specific delivery patterns. As a heuristic solution method for this planning problem, an Adaptive Large Neighborhood Search (ALNS) is designed. In the second paper, the VRP is extended to include time windows and customer-specific availability probabilities to improve the operational delivery of last-mile parcels. The data-driven approach that incorporates information on when recipients are more likely to be at home into delivery route planning can significantly reduce the number of failed delivery attempts. In order to efficiently solve the model developed for this purpose, the novel hybrid ALNS (HALNS), which combines elements of an ALNS and genetic algorithms. The HALNS is further developed in the third paper and applied to a whole class of VRPs that, in addition to the classical assignment and sequencing problem, also make decisions regarding the locations of the depots used. Finally, the fourth paper focuses on the multi-period VRP. The existing literature on its tactical and operational variants is surveyed and characterized, clearly distinguishing the two forms for the first time.}, subject = {Operations Research}, language = {mul} }