1 |
Song R D, Lau H C, Luo Xue, et al. Coordinated delivery to shopping malls with limited docking capacity[J]. Transportation Science, 2022, 56(2): 501-527.
|
2 |
van Zon M, Spliet R, van den Heuvel W. The joint network vehicle routing game[J]. Transportation Science, 2021, 55(1): 179-195.
|
3 |
Gansterer M, Hartl R F. Shared resources in collaborative vehicle routing[J]. Top, 2020, 28(1): 1-20.
|
4 |
Hacardiaux T, Tancrez J S. Assessing the en-vironmental benefits of horizontal cooperationusing a location-inventory model[J]. Central European Journal of Operations Research, 2020, 28(4): 1363-1387.
|
5 |
刘家利, 马祖军. 存在车辆租赁及共享且有时间窗的多配送中心开环VRP[J]. 系统工程理论与实践, 2013, 33(3): 666-675.
|
|
Liu J L, Ma Z J. Multi-depot open vehicle routing problem with time windows based on vehicle leasing and sharing[J]. Systems Engineering—Theory & Practice, 2013, 33(3): 666-675.
|
6 |
徐东洋, 李昆鹏, 崔利刚, 田倩南. 供需未匹配的多车场多车型多货品可拆分取送货车辆路径问题[J]. 中国管理科学, 2021, 29(1): 127-137.
|
|
Xu D Y, Li K P, Cui L G, et al. Multi-commodity unpaired supply-demand and split pickup and delivery vehicle routing problem with multi-depot and multi-type trucks[J]. Chinese Journal of Management Science, 2021, 29(1): 127-137.
|
7 |
徐小峰, 姜明月, 邓忆瑞. 整合逆向物流协同配送动态路径优化问题研究[J]. 管理科学学报, 2021, 24(10): 106-126.
|
|
Xu X F, Jiang M Y, Deng Y R. Dynamic vehicle routing problem with simultaneous pickup and delivery incollaborative distribution under demand concurrent[J]. Journal of Management Sciences in China, 2021, 24(10): 106-126.
|
8 |
饶卫振, 朱庆华, 刘从虎. 在线组建协作配送联盟中企业成本节约相对量估算方法研究[J]. 系统工程理论与实践, 2019, 39(3): 659-672.
|
|
Rao W Z, Zhu Q H, Liu C H. An estimation method for computing cost saving percentage of distribution enterprises in collaborative environment: Used for forming collaborative distribution coalition online[J]. Systems Engineering—Theory&Practice, 2019, 39(3): 659-672.
|
9 |
Li Y, Chen H X, Prins C. Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests[J]. European Journal of Operational Research, 2016, 252(1): 27-38.
|
10 |
Adenso-Díaz B, Lozano S, Garcia-Carbajal S,et al. Assessing partnership savings in horizontal cooperation by planning linked deliveries[J]. Transportation Research Part A: Policy and Practice, 2014, 66: 268-279.
|
11 |
Mancini S, Gansterer M, Hartl R F. The col-laborative consistent vehicle routing problem with workload balance[J]. European Journal of Operational Research, 2021, 293(3): 955-965.
|
12 |
Guajardo M, Rönnqvist M. A review on cost allocation methods in collaborative transportation[J]. International Transactions in Operational Research, 2016, 23(3): 371-392.
|
13 |
Shapley L S. A value for n-person games[J]. Contributions to the Theory of Games, 1953,2(28): 307-317.
|
14 |
Schmeidler D. The nucleolus of a characteristic function game[J]. SIAM Journal on Applied Mathematics, 1969, 17(6): 1163-1170.
|
15 |
Cuervo D P, Vanovermeire C, Sörensen K.Determining collaborative profits in coalitions formed by two partners with varying characteristics[J]. Transportation Research Part C: Emerging Technologies, 2016, 70: 171-184.
|
16 |
饶卫振, 朱庆华, 金淳, 等. 协作车辆路径成本分摊问题的B-T Shapley方法[J]. 管理科学学报, 2019, 22(1): 107-126.
|
|
Rao W Z, Zhu Q H, Jin C, et al. A binary tree Shapley method for cost sharing of the collaborative vehicle routing problem[J]. Systems Engineering—Theory & Practice,2019, 22(1): 107-126.
|
17 |
饶卫振, 张云东, 刘从虎, 于灏, 侯艳辉.一种求解协作配送成本分摊问题核仁解的近似迭代算法[J]. 系统工程理论与实践, 2019, 39(6): 1517-1534.
|
|
Rao W Z, Zhang Y D, Liu C H, et al. An approximate iterative algorithm for generating cost sharing nucleolus of collaborative vehicle routing problem[J].Systems Engineering—Theory & Practice, 2019,39(6): 1517-1534.
|
18 |
Wang Y, Li Q, Guan X Y, et al. Collaborative multi-depot pickup and delivery vehicle routing problem with split loads and time windows[J]. Knowledge-Based Systems, 2021, 231: 107412.
|
19 |
叶银芳, 李登峰, 余高锋. 联合订货区间值EOQ模型及变权Shapley值成本分摊方法[J]. 中国管理科学, 2019, 27(10): 90-99.
|
|
Ye Y F, Li D F, Yu G F. Joint replenishment interval-valued EOQ model andcost allocation approach based on variable-weighted Shapley value[J]. Chinese Journal of Management Science, 2019, 27(10): 90-99.
|
20 |
胡石清. 社会合作中利益如何分配?——超越夏普利值的合作博弈“宗系解”[J]. 管理世界,2018, 34(6): 83-93.
|
|
Hu S Q. How to distribute the benefits in social cooperation? “The Clique Solution” of cooperative game surpassing Shapley value[J]. Management World, 2018, 34(6): 83-93.
|
21 |
Ferrell W, Ellis K, Kaminsky P, et al. Horizontal collaboration: Opportunities for improved logistics planning[J]. International Journal of Production Research, 2020, 58(14): 4267-4284.
|
22 |
Krajewska M A, Kopfer H, Laporte G, et al. Horizontal cooperation among freight carriers: Request allocation and profit sharing[J]. Journal of the Operational Research Society, 2008, 59(11): 1483-1491.
|
23 |
Luo Z X, Qin H, Zhang D Z, et al. Adaptive large neighborhood search heuristics for the vehicle routing problem with stochastic demands and weight-related cost[J]. Transportation Research Part E: Logistics and Transportation Review, 2016, 85: 69-89.
|
24 |
Augerat P, Naddef D, Belenguer J M, et al. Computational results with a branch and cut code for the capacitated vehicle routing problem[R]. Working Paper,Institut National Polytechnique, 1995.
|
25 |
Marinakis Y, Iordanidou G R, Marinaki M. Particle swarm optimization for the vehicle routing problem with stochastic demands[J].Applied Soft Computing, 2013, 13(04): 1693-1704.
|
26 |
Marinakis Y, Marinaki M, Spanou P.A memetic differential evolution algorithm for the vehicle routing problem with stochastic demands[M]//Fister I, Fister Jr I. Adaptation and Hybridization in Computational Intelligence. vol 18.Cham: Springer, 2015, 185-204.
|