[1] CHEN Y T, HSU C H. Improve the carpooling applications with using a social community based travel cost reduction mechanism[J]. International Journal of Social Science & Humanity, 2013, 3(2): 87-91.
[2] 程杰, 唐智慧, 刘杰, 等. 基于遗传算法的动态出租车合乘模型研究[J]. 武汉理工大学学报(交通科学与工程 版), 2013, 37(1): 187-191. [CHENG J, TANG Z H, LIU J, et al. Research on dynamic taxi pooling model based on genetic algorithm[J]. Journal of Wuhan University of Technology(Transportation Science & Engineering), 2013, 37(1): 187-191.]
[3] MIAO F, HAN S, LIN S, et al. Data-driven robust taxi dispatch under demand uncertainties[J]. IEEE Transactions on Control Systems Technology, 2019, 27 (1): 175-191.
[4] LONG J, TAN W, SZETO W Y, et al. Ride-sharing with travel time uncertainty[J]. Transportation Research Part B: Methodological, 2018, 118: 143-171.
[5] LI Y, CHUNG S H. Ride-sharing under travel time uncertainty: Robust optimization and clustering approaches[J]. Computers & Industrial Engineering, 2020, 149: 106601.
[6] 张玺君, 张祺瑞, 张丽娟, 等. 基于改进遗传算法的出租车共乘线路规划研究[J]. 交通运输系统工程与信 息, 2019, 19(6): 123-128. [ZHANG X J, ZHANG Q R, ZHANG L J, et al. Taxi sharing route planning based on improved genetic algorithm[J]. Journal of Transportation Systems Engineering and Information Technology, 2019, 19(6): 123-128.]
[7] 肖强, 何瑞春, 张薇, 等. 基于模糊聚类和识别的出租车合乘算法研究[J]. 交通运输系统工程与信息, 2014, 14(5): 119- 125. [XIAO Q, HE R C, ZHANG W, et al. Algorithm research of taxi carpooling based on fuzzy clustering and fuzzy recognition[J]. Journal of Transportation Systems Engineering and Information Technology, 2014, 14(5): 119-125.]
[8] 吴玥琳, 袁振洲, 陈秋芳, 等. 考虑轨迹相似度的综合客运枢纽出租车合乘方法研究[J]. 交通运输系统工程 与信息, 2020, 20(2): 188-195. [WU Y L, YUAN Z Z, CHEN Q F, et al. Research on taxi pooling method of urban integrated passenger transport hub with trajectory similarity[J]. Journal of Transportation Systems Engineering and Information Technology, 2020, 20(2): 188-195.]
[9] PENG W, DU L. Investigating optimal carpool scheme by a semi-centralized ride-matching approach[J]. IEEE Transactions on Intelligent Transportation Systems, 2022, DOI: 10.1109/TITS.2021.3135648.
[10] BERTSIMAS D, SIM M. The price of robustness[J]. Operations Research, 2004, 52(1): 35-53.
[11] MUNARI P, MORENO A, JONATHAN D L V, et al. The robust vehicle routing problem with time windows: Compact formulation and branch-price-and-cut method[J]. Transportation Science, 2019, 53(4): 1043-1066.
[12] AGRA A, CHRISTIANSEN M, FIGUEIREDO R, et al. The robust vehicle routing problem with time windows[J]. Computers & Operations Research, 2013, 40(3): 856- 866.
[13] 刘志硕, 申金升, 柴跃廷. 基于自适应蚁群算法的车辆路径问题研究[J]. 控制与决策, 2005(5): 562-566. [LIU Z S, SHEN J S, CHAI Y T. Vehicle routing problem based on an adaptive ant colony algorithm[J]. Control and Decision, 2005(5): 562-566.]
[14] CLAUSET A, NEWMAN M E J, MOORE C. Finding community structure in very large networks[J]. Physical Review E, Statistical, Nonlinear, and Soft Matter Physics, 2004, 70(6/2): 66111.
[15] CORDEAU J, LAPORTE G. A tabu search heuristic for the static multi-vehicle dial-a-ride problem[J]. Transportation Research Part B: Methodological, 2003, 37(6): 579-594.
|