软件可靠性分配的遗传模型研究

对软件可靠性分配的遗传模型进行了研究,结合相关知识缩小了基本遗传算法的搜索区域,比较灵活地处理了非线性约束条件,提高了搜索效率,避免了早熟收敛现象.此外,在基本遗传算法中增加了保优操作,从而能够在理论上保证实现分配的最优化.算例表明,该算法十分有效.     

能量均衡的围捕任务分配方法

随着水下机器人反围捕策略研究的不断深入,水下机器人围捕变得越来越困难。为此构建一种多层环状伏击围捕模型并设计了基于围捕任务的任务分配方法,使得水下机器人能够充分利用自身的特点更好地完成任务。同时,考虑在围捕过程中随时间推移,系统内能量会出现消耗不均的现象,据此提出一种能量均衡方法平衡系统能量的消耗。实验证明所提出的基于多层环状围捕模型的能量均衡策略任务分配方法能有效提高围捕成功率,延长系统寿命。     

Evergreening and operational risk under price competition

“Evergreening” is a strategy wherein an innovative pharmaceutical firm introduces an upgrade of its current product when the patent on this product expires. The upgrade is introduced with a new patent and is designed to counter competition from generic manufacturers that seek to imitate the firm's existing product. However, this process is fraught with uncertainty because the upgrade is subject to stringent guidelines and faces approval risk. Thus, an incumbent firm has to make an upfront production capacity investment without clarity on whether the upgrade will reach the market. This uncertainty may also affect the capacity investment of a competing manufacturer who introduces a generic version of the incumbent's existing product but whose market demand depends on the success or failure of the upgrade. We analyze a game where capacity investment occurs before uncertainty resolution and firms compete on prices thereafter. Capacity considerations that arise due to demand uncertainty introduce new factors into the evergreening decision. Equilibrium analysis reveals that the upgrade's estimated approval probability needs to exceed a threshold for the incumbent to invest in evergreening. This threshold for evergreening increases as the intensity of competition in the generic market increases. If evergreening is optimal, the incumbent's capacity investment is either decreasing or nonmonotonic with respect to low end market competition depending on whether the level of product improvement in the upgrade is low or high. If the entrant faces a capacity constraint, then the probability threshold for evergreening is higher than the case where the entrant is not capacity constrained. Finally, by incorporating the risk‐return trade‐off that the incumbent faces in terms of the level of product improvement versus the upgrade success probability, we can characterize policy for a regulator. We show that the introduction of capacity considerations may maximize market coverage and/or social surplus at incremental levels of product improvement in the upgrade. This is contrary to the prevalent view of regulators who seek to curtail evergreening involving incremental product improvement. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 71–89, 2016     

面向多平台多目标协同跟踪的指派问题

针对多平台多目标协同跟踪中要求多个无人地面平台尽可能均匀地协同跟踪多个目标的特点,提出了改进的离散粒子群优化算法。首先采用连续型粒子群优化算法中的速度和位置迭代公式,然后对粒子位置进行离散编码,使粒子编码对应于可行的指派方案;其次,在优化算法中引入局部搜索,提高算法寻优性能。最后将所提算法应用于多平台多目标协同跟踪中的指派问题,并与未加入局部搜索的粒子群优化算法比较,仿真结果表明,加入局部搜索后的离散粒子群优化算法具有较好的寻优性能。     

蜂窝网络中基于干扰控制的D2D通信联合资源分配方案

在蜂窝网络中部署D2D(Device-to-Device)通信能够有效提升频谱利用率,降低基站负载,但D2D用户与蜂窝用户共享无线信道时会产生信号干扰。提出了一种联合资源分配算法,通过综合考虑信道分配对网络中已有的蜂窝用户和D2D用户的信号干扰,并在小区范围内寻找具有最小干扰值的信道资源分配给用户,以实现有效的干扰控制。仿真结果显示:联合资源分配能够提升D2D链路、蜂窝链路的信噪比及系统总吞吐量,使得蜂窝网络的整体性能优于独立资源分配。     

基于Riccati方程的动态传感器分配算法

针对组网跟踪系统传感器分配算法计算量过大的问题,提出了一种基于Riccati方程的动态传感器分配算法。该算法通过Riccati方程离线计算各传感器组合跟踪下的稳态滤波协方差,根据稳态滤波协方差与期望协方差的接近程度动态分配传感器资源。仿真结果显示,与传统协方差控制和贪婪算法相比,基于Riccati方程的动态传感器分配算法在大大减少计算量的同时能够保持较好的跟踪性能。该方法能够更好地应用于大规模传感器组网目标协同跟踪系统。     

Spatial pricing and product allocation in online retailing

Spatial pricing means a retailer price discriminates its customers based on their geographic locations. In this article, we study how an online retailer should jointly allocate multiple products and facilitate spatial price discrimination to maximize profits. When deciding between a centralized product allocation ((i.e., different products are allocated to the same fulfillment center) and decentralized product allocation (ie, different products are allocated to different fulfillment centers), the retailer faces the tradeoff between shipment pooling (ie, shipping multiple products in one package), and demand localization (ie, stocking products to satisfy local demand) based on its understanding of customers' product valuations. In our basic model, we consider two widely used spatial pricing policies: free on board (FOB) pricing that charges each customer the exact amount of shipping cost, and uniform delivered (UD) pricing that provides free shipping. We propose a stylized model and find that centralized product allocation is preferred when demand localization effect is relatively low or shipment pooling benefit is relatively high under both spatial pricing policies. Moreover, centralized product allocation is more preferred under the FOB pricing which encourages the purchase of virtual bundles of multiple products. Furthermore, we respectively extend the UD and FOB pricing policies to flat rate shipping (ie, the firm charges a constant shipping fee for each purchase), and linear rate shipping (ie, the firm sets the shipping fee as a fixed proportion of firm's actual fulfillment costs). While similar observations from the basic model still hold, we find the firm can improve its profit by sharing the fulfillment cost with its customers via the flat rate or linear rate shipping fee structure.     

Pricing and capacity allocation strategies: Implications for manufacturers with product sharing

Emerging sharing modes, like the consumer-to-consumer (C2C) sharing of Uber and the business-to-consumer (B2C) sharing of GoFun, have considerably affected the retailing markets of traditional manufacturers, who are motivated to consider product sharing when making pricing and capacity decisions, particularly electric car manufacturers with limited capacity. In this paper, we examine the equilibrium pricing for a capacity-constrained manufacturer under various sharing modes and further analyze the impact of capacity constraint on the manufacturer's sharing mode selection as well as equilibrium outcomes. We find that manufacturers with low-cost products prefer B2C sharing while those with high-cost products prefer C2C sharing except when the sharing price is moderate. However, limited capacity motivates manufacturers to enter into the B2C sharing under a relatively low sharing price, and raise the total usage level by sharing high-cost products. We also show that the equilibrium capacity allocated to the sharing market with low-cost products first increases and then decreases. Finally, we find that sharing low-cost products with a high limited capacity leads to a lower retail price under B2C sharing, which creates a win-win situation for both the manufacturer and consumers. However, sharing high-cost products with a low limited capacity creates a win-lose situation for them.     

Callable products with dependent demands

Capacity providers such as airlines often sell the same capacity to different market segments at different prices to improve their expected revenues. The absence of a secondary market, due to the nontransferability of airline tickets, gives rise to an opportunity for airlines to broker capacity between consumers with different willingness to pay. One way to broker capacity is by the introduction of callable products. The idea is similar to callable bonds where the issuer has the right, but not the obligation, to buy back the bonds at a certain price by a certain date. The idea of callable products was introduced before under the assumption that the fare-class demands are all independent. The independent assumption becomes untenable when there is significant demand recovery (respectively, demand cannibalization) when lower fares are closed (respectively, opened). In this case, consumer choice behavior should be modeled explicitly to make meaningful decisions. In this paper, we consider a general consumer choice model and develop the optimal strategy for callable products. Our numerical study illustrates how callable products are win-win-win, for the capacity provider and for both high and low fare consumers. Our studies also identify conditions for callable products to result in significant improvements in expected revenues.     

两跳OFDM译码转发中继系统的功率分配研究

分析了系统总功率约束和各节点独立功率约束条件下的中继信道,提出了以最大化系统容量为准则的两跳中继系统联合子载波配对和功率优化分配算法。算法先进行子载波配对,然后选出一组信道增益最大的子载波进行平均功率分配,最后通过迭代得到功率分配结果。为了进一步降低系统复杂度,我们利用相邻子载波之间的相关性,用若干相邻子载波组成一个等效子信道。仿真结果表明,所提算法可以在大大降低反馈量的情况下达到和注水功率分配几乎相同的系统容量。