Cycles as a Solving Strategy for Matching Problems in Cooperative Full Truckload Networks

摘要

We present a graph theoretical approach for matching transports in a cooperative full-truckload network to prevent empty runs. In the simplest case of application so-called simple cycles are used to characterize matchings in directed and undirected graphs. These particular solutions allow estimates for the minimal and maximal solution of the whole optimization problem and can be used to calculate the optimal solution of the overall problem.