Abstract

Abstract 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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call