[1] Jaehn F, Otto A, Selfried K. Shunting operations at flat yards: retrieving freight railcars from storage tracks[J]. Or Spectrum, 2018, 40(2): 367-393. [2] Li B, Qu W Y, Xuan H, Xu C Q, Wang X Y, Geng Y F. Shunting strategy for placing-in and taking-out wagons on branch-shaped freight operation network with simulation method[J]. Journal of Advanced Transportation, 2020, 2020(1): 1-25. [3] 张文晰,陈崇双,薛锋,牟峰.树枝形专用线直达车流取送车模型及算法[J].铁道学报,2014,36(6):1-8. [4] 牟峰,王慈光,牟从凯.铁路车站取送车作业问题一般模型解的构造方法[J].中国铁道科学,2012,33(5):105-113. [5] 李冰,张志宁,轩华,王薛苑. 基于树枝形铁路专用线网络的小运转货物作业系统优化[J].系统管理学报,2021,30(2):201-214. [6] 李冰,李明向,轩华.基于单机作业的树枝形专用线非直达车流取送优化[J].系统工程,2021,39(3):1-11. [7] 李冰,李明向,轩华.树枝形专用线非直达车流取送的三阶段综合协调优化[J].管理工程学报,2022,36(4):140-151. [8] Bettinelli A, Cacchiani V, Crainic T G, Vigo D. A Branch-and-cut-and-price algorithm for the multi-trip separate pickup and delivery problem with time windows at customers and facilities[J]. European Journal of Operational Research, 2019, 279(3): 824-839. [9] Alyasiry A M, Forbes M, Bulmer M. An exact algorithm for the pickup and delivery problem with time windows and last-in-first-out loading[J]. Transportation Science, 2019, 53(6): 1695-1705. [10] Zhang Z Z, Cheang B, Li C S, Lim A. Multi-commodity demand fulfillment via simultaneous pickup and delivery for a fast fashion retailer[J]. Computer & Operations Research, 2019, 103: 81-96. [11] Wang J W, Yu Y, Tang J F. Compensation and profit distribution for cooperative green pickup and delivery problem[J]. Transportation Research Part B: Methodological, 2018, 113: 54-69. [12] Danloup N, Allaoui H, Goncalves G. A comparison of two meta-heuristics for the pickup and delivery problem with transshipment[J]. Computer & Operations Research, 2018, 100: 155-171. [13] Haddad M N, Martinelli R, Vidal T, Martins S, Ochi L S, Souza M J F, Hartl R. Large neighborhood-based metaheuristic and branch-and-price for the pickup and delivery problem with split loads[J]. European Journal of operational research, 2018, 270(3): 1014-1027. |