转向限制网络中基于预知时间的快递车辆在线揽件路径选择研究.

Based on the turn restriction of network and the situation in which requests could not be serviced until its release time, this paper introduces the advanced information into online traveler salesman problem, proposes the online routing of express pick-up vehicles with advanced information on the turn restriction network. WBR-dd algorithm, REP-dd algorithm and PAH-dd algorithm are presented on halfpath, path and general metric space. Competitive analysis is given respectively. The lower bounds are given. The results indicate that the more advanced information, the better online algorithms perform. [ABSTRACT FROM AUTHOR]