Lane covering with partner bounds in collaborative truckloadn transportation procurement

摘要

In collaborative truckload transportation procurement, the collaborating shippers aim to jointly identify and submit tours with little or no asset repositioning to a carrier, as opposed to submitting individual lanes, in return for more favorable rates. In order to maximize savings, the shippers must solve a Lane Covering Problem (LCP), which in more mathematical terms means to cover a subset of arcs in a directed graph by a set of constrained cycles with minimum total cost. Previous works in th