The logistics industry in Japan is facing a severe shortage of labor. Therefore, there is an increasing need for joint transportation allowing large amounts of cargo to be transported using fewer trucks. In recent years, the use of artificial intelligence and other new technologies has gained wide attention for improving matching efficiency. However, it is difficult to develop a system that can instantly respond to requests because browsing through enormous combinations of two transport lanes is time consuming. In this study, we focus on a form of joint transportation called triangular transportation and enumerate the combinations with high cooperation effects. The proposed algorithm makes good use of hidden inequalities, such as the distance axiom, to narrow down the search range without sacrificing accuracy. Numerical experiments show that the proposed algorithm is thousands of times faster than simple brute force. With this technology as the core engine, we developed a joint transportation matching system. The system has already been in use by over 150 companies as of October 2022, and was featured in a collection of logistics digital transformation cases published by Japan's Ministry of Land, Infrastructure, Transport and Tourism.
翻译:日本的物流行业面临着严重的劳动力短缺。因此,采用联合运输的需求越来越大,可以使用较少的卡车运输大量货物。近年来,使用人工智能和其他新技术提高匹配效率得到了广泛关注。然而,浏览通过巨大的两个运输通道组合是耗时的,很难开发出可以立即响应请求的系统。在本研究中,我们关注一种叫做三角运输的联合运输形式,并枚举具有高合作效应的组合。所提出的算法充分利用隐藏的不等式,如距离公理,缩小搜索范围而不牺牲准确性。数值实验表明,所提出的算法比简单粗暴的算法快上千倍。以此技术为核心引擎,我们开发了一款联合运输匹配系统。该系统已经在截至2022年10月已有150多家公司使用,被日本国土交通省发布的物流数字化转型案例收录。