Look-Ahead Insertion Policy for a Shared-Taxi System Based on Reinforcement Learning

This paper proposed a reinforcement learning method to improve the level-of-service (LOS) for a shared-taxi system. In practice, shared-taxi operators usually insert a new arrival request into a vehicle routing system that can minimize current total waiting time and detour distance. However, the LOS of a shared-taxi system does not involve only the total waiting time and detour distance but also the quantity of serviced trip volume. If operators emphasize only on the reduction of the total waiting time and detour distance for current requests, the transport capacity of a shared-taxi system can be excessively expended and cannot reflect future requests effectively. This could lead to a high rejection rate for future requests and damage the global LOS. The proposed reinforcement learning method takes into account the uncertainty of future requests and can make a look-ahead decision to help the operator improve the global LOS of a shared-taxi system. We also tested the proposed method on large-scale networks to verify the performance of the method.

[1]  Min Chen,et al.  Mobility-Aware Caching and Computation Offloading in 5G Ultra-Dense Cellular Networks , 2016, Sensors.

[2]  Daxin Tian,et al.  A Dynamic and Self-Adaptive Network Selection Method for Multimode Communications in Heterogeneous Vehicular Telematics , 2015, IEEE Transactions on Intelligent Transportation Systems.

[3]  Mark E. T. Horn,et al.  Fleet scheduling and dispatching for demand-responsive passenger services , 2002 .

[4]  Joseph Y. J. Chow,et al.  A scalable non-myopic dynamic dial-a-ride and pricing problem , 2015 .

[5]  Richard S. Sutton,et al.  Reinforcement Learning: An Introduction , 1998, IEEE Trans. Neural Networks.

[6]  Reijo Sulonen,et al.  Non-myopic vehicle and route selection in dynamic DARP with travel time and workload objectives , 2012, Comput. Oper. Res..

[7]  Victor C. M. Leung,et al.  Robust Energy-Efficient MIMO Transmission for Cognitive Vehicular Networks , 2016, IEEE Transactions on Vehicular Technology.

[8]  Gilbert Laporte,et al.  Parallel Tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem , 2004, Parallel Comput..

[9]  John N. Tsitsiklis,et al.  Neuro-Dynamic Programming , 1996, Encyclopedia of Machine Learning.

[10]  Russell Bent,et al.  Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers , 2004, Oper. Res..

[11]  Hassan Artail,et al.  The shared-taxi problem: Formulation and solution methods , 2014 .

[12]  Martijn R.K. Mes,et al.  Anticipatory freight selection in intermodal long-haul round-trips , 2017 .

[13]  Min Chen,et al.  Green and Mobility-Aware Caching in 5G Networks , 2017, IEEE Transactions on Wireless Communications.

[14]  Robert H. Storer,et al.  An approximate dynamic programming approach for the vehicle routing problem with stochastic demands , 2009, Eur. J. Oper. Res..

[15]  Mohsen Guizani,et al.  Deep Features Learning for Medical Image Analysis with Convolutional Autoencoder Neural Network , 2017 .

[16]  Walter Ukovich,et al.  A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem , 2006, Eur. J. Oper. Res..

[17]  Nigel H. M. Wilson,et al.  A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows , 1986 .

[18]  Warren B. Powell,et al.  Approximate Dynamic Programming - Solving the Curses of Dimensionality , 2007 .

[19]  Warren B. Powell,et al.  An Approximate Dynamic Programming Algorithm for Large-Scale Fleet Management: A Case Application , 2009, Transp. Sci..

[20]  Chengbin Chu,et al.  The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments , 2008, Eur. J. Oper. Res..

[21]  Gilbert Laporte,et al.  A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem , 2012, INFORMS J. Comput..

[22]  Michel Gendreau,et al.  Exploiting Knowledge About Future Demands for Real-Time Vehicle Dispatching , 2006, Transp. Sci..

[23]  Richard F. Hartl,et al.  Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports , 2011, Comput. Oper. Res..

[24]  Min Chen,et al.  Disease Prediction by Machine Learning Over Big Data From Healthcare Communities , 2017, IEEE Access.

[25]  Gianpaolo Ghiani,et al.  Anticipatory algorithms for same-day courier dispatching , 2009 .

[26]  Warren B. Powell,et al.  “Approximate dynamic programming: Solving the curses of dimensionality” by Warren B. Powell , 2007, Wiley Series in Probability and Statistics.

[27]  Li Zhao,et al.  LTE-V: A TD-LTE-Based V2X Solution for Future Vehicular Network , 2016, IEEE Internet of Things Journal.

[28]  Zhengguo Sheng,et al.  Learning to Be Energy-Efficient in Cooperative Networks , 2016, IEEE Communications Letters.

[29]  Nicola Secomandi,et al.  Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands , 2000, Comput. Oper. Res..

[30]  Zhengguo Sheng,et al.  An Adaptive Fusion Strategy for Distributed Information Estimation Over Cooperative Multi-Agent Networks , 2017, IEEE Transactions on Information Theory.