In this thesis we consider three challenging vehicle routing problems representing specific aspects of complex real-world problems: (i) the vehicle routing problem with unit demands, (ii) the preemptive stacker crane problem and (iii) a multi-period vehicle and technician routing problem. For the vehicle routing problem with units demands we continue research on the exponential multi-insertion neighborhood, investigate its properties and propose heuristic solution methods utilizing the neighborhood. For the preemptive stacker crane problem we study structural properties and provide bounds on the benefits of preemption and the benefits of so-called explicit drop nodes that are used exclusively to facilitate preemption. We propose construction heuristics that improve on the state-of-the-art in computational time and solution quality. The multi-period vehicle and technician routing problem is the subject of the VeRoLog Solver Challenge 2019. We develop a solution method that adapts to the limited computational budget and the given instance parameters. In summary, this thesis contributes to the structural analysis of the considered problems and proposes efficient heuristic solution methods that are effective even on large-scale instances and under tight restrictions of the computational budget. The methods combine global and local search approaches and take the available computational budget into account to realize an adaptive best-effort allocation of the resources.
Identifer | oai:union.ndltd.org:uni-osnabrueck.de/oai:repositorium.ub.uni-osnabrueck.de:urn:nbn:de:gbv:700-202109025316 |
Date | 02 September 2021 |
Creators | Graf, Benjamin |
Contributors | Prof. Dr. Sigrid Knust, Prof. Dr. Stefan Irnich |
Source Sets | Universität Osnabrück |
Language | English |
Detected Language | English |
Type | doc-type:doctoralThesis |
Format | application/pdf, application/zip |
Rights | Attribution-NonCommercial-NoDerivs 3.0 Germany, http://creativecommons.org/licenses/by-nc-nd/3.0/de/ |
Page generated in 0.0021 seconds