In this study, we focus on a form of joint transportation called mixed transportation and enumerate the combinations with high cooperation effects from among a number of transport lanes registered in a database (logistics big data). As a measure of the efficiency of mixed transportation, we consider the reduction rate that represents how much the total distance of loading trips is shortened by cooperation. The proposed algorithm instantly presents the set of all mixed transports with a reduction rate of a specified value or less. This algorithm is more than 7,000 times faster than simple brute force.

翻译：本研究聚焦于一种称为混合运输的联合运输形式，从数据库（物流大数据）中注册的大量运输线路中枚举出具有高协作效应的组合。作为混合运输效率的衡量指标，我们考虑了表示装载行程总距离通过协作缩短程度的缩减率。所提出的算法能即时呈现缩减率小于或等于指定值的所有混合运输集合。该算法比简单暴力枚举快7000倍以上。