This study concentrates on the routing and scheduling problem of Demand Responsive Connector to build feeder plans for people traveling from and to transit hub. An in-depth analysis on the characteristics of feeder services was implemented to inspire the compatibility-based algorithm design. With the goal of reducing operating cost and passenger inconvenience, the proposed algorithm took several factors critical to the real-word operation into consideration, such as double time window assurance (the time constraints at the beginning and end of passenger travels), the flexibility of feeder plans, and the number of vehicles. Our method was validated on numerical instances of 400, 600, 800 and 1000 passengers. Simulation results show that the compatibility-based algorithm can effectively reduce the number of vehicles with acceptable increase of passengers' inconvenience, and can improve the algorithm efficiency considerably. In addition, the setting of flexible time window of shutter plan can hold some elasticity for feeder services. Sensitivity analysis was conducted to help service providers evaluate the trade-off between the operation cost and level of service. INDEX TERMS Compatibility-based approach, demand responsive connector, routing and scheduling.

Modeling lane changing driving behavior has attracted significant attention recently. Most of the existing models are homogeneous and do not recognize the anticipation and relaxation phenomena occurring during the maneuver. To fill this gap, we adopted long short-term memory (LSTM) network and used large quantities of trajectory data extracted from video footage collected by an unmanned automated vehicle in Nanjing, China. Then, we divided complete lane changing behavior into two stages, that is, anticipation and relaxation. Description analysis of lane changing behavior revealed that the factors affecting the two stages are significantly different. In this context, two LSTM models with different input variables were proposed to predict the anticipation and the relaxation during the lane changing activity, respectively. The vehicle trajectory data were further divided into an anticipation dataset and a relaxation dataset to train the two LSTM models. Then we applied numerical tests to compare our models with two baseline models using real trajectory data of lane changing behavior. The results suggest that our models achieved the best performance for trajectory prediction in both lateral and longitudinal positions. Moreover, the simulation results show that the proposed models can precisely replicate the impact of the anticipation phenomenon on the target lane, and the relationship between the speed and spacing of the lane changing vehicle during the relaxation process can be reproduced with reasonable accuracy.

No abstract

No abstract

No abstract