安定マッチングに基づく貨客混載車両のキャリア間提携経路最適化

抄録

In this paper, we propose a route optimization algorithm for mixed cargo and passenger vehicles by incorporating ridesharing based on matching theory to the delivery planning problem for cargo transportation in order to reduce the total route cost in transportation. First, we consider the cargo-specific delivery route problem, which is formulated as two alternative mixed integer linear programming problems aimed at minimizing the transportation route cost by sharing the delivery tasks among multiple carriers. We then present an algorithm for determining passengers for ridesharing based on stable matching that considers the detour distance of each passenger, describe the passenger travel route search problem based on the cargo transportation route, and propose a series of algorithms for determining the optimal route of mixed cargo and passenger vehicles. Finally, the effectiveness of the proposed algorithm is evaluated through numerical simulations.