随机反应均衡是在有限理性条件下对纳什均衡的拓展.本文将随机反应均衡引入到供应链激励机制设计的模型中,建立依据反应函数的概率选择分析框架,修正依赖于决策者完全理性的激励相容和参与约束.通过理论分析和数值算例研究发现,随着供应商理性程度的不同,最优机制设计的形式发生变化,且对供应链渠道绩效产生显著影响.零售商和供应链渠道的期望利润随着供应商理性程度的提高而增加,而供应商的期望利润在其理性程度极低或极高时均较少.
Intercity goods distribution for e-commerce is usually realized in a three-echelon transportation network, where the delivery of goods from suppliers to customers passes two urban consolidation centres, one located in the origin city, and the other in the destination city, before arriving at the customers. In order to improve distribution efficiency, service quality, and reduce transportation costs, many cities in our country have carried out collaborative transportation pilot work, established resource-sharing urban consolidation centers, and constructed a collaborative three-echelon transportation network. The continuous development of digital platform technology provides information sharing foundation for collaborative transportation, reduces information asymmetry between logistics companies, integrates the supply and demand information of transportation requests, and reduces the empty load rate and improves transportation efficiency. The characteristics of transportation request delivery timeliness and mutual coupling in a three-echelon transportation network put forward new challenges for collaborative transportation. Based on the operation scenario of the digital platform providing information sharing for collaborative transportation, this paper studies a collaborative transportation problem in three-echelon transportation considering time windows constraints with the minimum of transportation cost. In this problem, all requests are served in a three-echelon transportation network, where goods are first delivered from suppliers located in a city（the city of origin） to their customers in another city（the city of destination） through two urban consolidation centers located at the outskirt of the two cities. Multiple shippers and customers are clustered in pick-up zones and delivery zones respectively. To handle the complicated linking constraints in a collaborative three-echelon transportation network, a multi-start iterated local search algorithm is proposed to obtain the approximate optimal solution of the problem. In the proposed algorithm, based on the coordination constraints among different echelons and the characteristic that each request in a three echelon transportation network must be served by the same carrier, the neighborhood structure is constructed by adding local branching constraints in local search operations and two perturbation strategies are adopted to select free variables in the perturbation operator. Extensive numerical experiment results have proved the effectiveness of the proposed algorithm, and demonstrated that in a three-echelon transportation network, collaborative transportation can significantly reduce the overall transportation cost. Moreover, the lower the proportion of reserved transportation requests, the more the number of transportation requests, and the larger the transportation network, the higher the possibility of collaboration among carriers, and the higher benefits can be achieved by collaborative transportation. This research enriches the study of collaborative transportation and provides quantitative decision support for carriers to solve the collaborative vehicle routing optimization problem in three-echelon transportation considering time windows with complete information sharing. However, this paper only considers the certain transportation requests, and ignores the randomness of transportation requests in the reality. Also, the proposed algorithm can only get approximate solutions for medium size and large size instances. In the future, the randomness of transportation requests should be considered when formulating a mathematical model and designing an algorithm to solve the problem with random transportation requests. In addition, accurate algorithms such as branch and cut algorithm and branch and cut and price algorithm can be adopt to obtain optimal solutions for this problem.
自贸试验区作为新时代建设更高水平开放型经济新体制的重大举措,自贸试验区必然成为推动我国高水平开放和经济可持续发展的重要载体.本文以自贸试验区设立作为准自然实验,使用DID方法识别了高水平开放政策的环境效应,并运用中介效应模型和Bootstrap法检验了其作用机制.研究表明:自贸试验区对环境质量有显著的正向效应,并且这一结果经过多项稳健性检验后仍成立;自贸试验区对环境质量改善效应存在着"东强西弱中部不明显"的空间差异性以及随成长周期递增的时间异质性;自贸试验区通过制度创新、高水平贸易、要素结构优化、产业结构高度化和金融创新发展等方面中介效应改善了环境质量.本研究为我国传统开放政策转型和高水平开放政策制定提供科学依据.
领导对员工知识共享行为的激发或抑制作用正在引起学术界的广泛关注,但既有研究大多聚焦于企业层面,针对项目层面的研究有所不足,更鲜有文献专注授权型领导与项目内知识共享的关系.基于情感事件理论,探究项目经理授权型领导对项目内知识共享的影响,着重分析组织支持感、内部人身份认知在此关系中起到的中介作用,探讨项目紧迫性的调节作用.在构建五者关系模型的基础上,运用结构方程模型对 220 份有效数据开展实证分析.实证结果表明:(1)项目经理授权型领导对项目内知识共享具有显著促进作用;(2)组织支持感、内部人身份认知在项目经理授权型领导与项目内知识共享的关系之间具有中介作用;(3)项目紧迫性在项目经理授权型领导与组织支持感关系间起倒U型调节作用,在内部人身份认知与项目内知识共享关系间起U型调节作用.
针对多人非合作博弈问题,提出了一种光滑修正Hestenes-Stiefel(HS)共轭梯度算法.通过将多人非合作博弈的一般模型转化为张量互补问题并利用互补函数将其转为非光滑方程系统,再对其进行光滑化处理,最终等价转换为求解无约束优化问题.提出的算法可以对初始点进行随机选取,同时该算法具有稳定性高,存储量小的特点,是求解多人非合作博弈问题的一种有效算法.文中最后给出了数值算例与结论,数值算例部分给出了表明所提算法有效性的结果.
