Before revision:  As a consequence, the original NP-hard MPC problem is reduced to a polynomial time prediction and optimization  . Experimental results show that the hybrid approach achieves 27\% further reduction in rider waiting time than the MPC optimization , thanks to its ability to model a longer time horizonwithin the computational limits .
After revision:  As a consequence, the original NP-hard MPC problem is reduced to a polynomial time prediction and optimization , which allows the ride-sharing operators to consider a longer time horizon . Experimental results show that the hybrid approach achieves 27\% further reduction in rider waiting time than the MPC optimization , thanks to its ability to model a longer time horizonwithin the computational limits .