A Distributed Scheme for the Taxi Cruising Route Recommendation Problem Using a Graph Neural Network

Abstract

Despite considerable research efforts being devoted to the taxi cruising route recommendation (TCRR) problem, existing studies still have some shortcomings. To begin with, the competition and collaboration between taxis are not sufficiently taken into account. Furthermore, the TCRR is heavily reliant on potential taxi demand, which is time-variant and difficult to accurately predict due to the underlying spatiotemporal correlation and dynamic traffic patterns. Moreover, the consideration of competition and cooperation among taxis increases the complexity of the TCRR problem, making conventional centralized algorithms computationally expensive. In this paper, we first formulate TCRR as a biobjective optimization problem to balance the collaboration and competition between taxis. Subsequently, we forecast short-term taxi demand using the proposed long-short-term-memory-based graph convolutional network (LSTM-GCN), which considers diverse factors such as road topology, points of interest (POIs), and multiple time-scale features. Lastly, we propose a distributed algorithm based on a Lagrange dual decomposition. The experimental and simulation results demonstrate that our TCRR scheme performs better than any other counterpart, (i) resulting in a 3% reduction in idle taxis per hour, (ii) performing four times faster than the centralized algorithms to obtain the optimal solution, and (iii) resulting in a 7% increase in average profit.