查看文章

Sharing capacity across decentralized service providers can lead to improvements in logistics efficiency. However, sharing the information needed to determine if capacity can be shared poses interesting problems. We focus on a problem faced by independent trucking companies that have separate pickup and delivery tasks; the identification of potential efficiency enhancing task swaps between these companies. A second goal is to limit the information the parties must reveal to identify these swaps. By integrating state-of-the-art techniques from cryptography into an operations context we present an algorithm that finds opportunities to swap loads without revealing any information except the loads swapped, along with proofs of the security. We then apply this algorithm to an empirical dataset from a large transportation company and present results that suggest significant opportunities to improve efficiency through …