Kopfer, HerbertSchopka, KristianKristianSchopka2020-03-092020-03-092018-03-12https://media.suub.uni-bremen.de/handle/elib/1395Both collaborative and dynamic vehicle routing represent intensively studied problems of discrete mathematics. However, scientific studies on the combination of these two fields are rare. Aspects of dynamic collaborative vehicle routing using the example of less than truckload transportation are examined in this dissertation. Independent actors use an auction mechanism to exchange transportation orders among each other. At the beginning of a planning horizon not all transportation orders are known. That is why a rolling horizon planning is used to overcome this uncertainty. In order to ensure long-term cooperationa s aspects of the cooperative game theory are respected. Therefore, allocation mechanisms are integrated into a rolling horizon planning for the first time. In computational experiments developed algorithms are tested and the practical impact is evaluated.deinfo:eu-repo/semantics/openAccessOperations ResearchCollaborative Vehicle RoutingDynamic Vehicle RoutingRolling Horizon PlanningShapley ValueAdapted Large Neighborhood SearchAuction-based Order Exchange330Dissertationurn:nbn:de:gbv:46-00106455-14