Modeling, Optimization and Solving Strategies for Matching Problems in Cooperative Full Truckload Networks∗

A formal description of processes in cooperative full-truckload networks is developed. Based on this a matching concept between transport routes is introduced to prevent empty runs. As an application of this framework an optimization problem is formulated to find matchings, which guarantee a maximal number of matched transports. A solution of this optimization problem and strategies and algorithms for data reduction and augmentation are presented as well.