Discrete equal‐capacity p‐median problem

This paper examines the discrete equal‐capacity p‐median problem that seeks to locate p new facilities (medians) on a network, each having a given uniform capacity, in order to minimize the sum of distribution costs while satisfying the demand on the network. Such problems arise, for example, in local access and transport area telecommunication network design problems where any number of a set of p facility units can be constructed at the specified candidate sites (hence, the net capacity is an integer multiple of a given unit capacity). We develop various valid inequalities, a separation routine for generating cutting planes that are specific members of such inequalities, as well as an enhanced reformulation that constructs a partial convex hull representation that subsumes an entire class of valid inequalities via its linear programming relaxation. We also propose suitable heuristic schemes for this problem, based on sequentially rounding the continuous relaxation solutions obtained for the various equivalent formulations of the problem. Extensive computational results are provided to demonstrate the effectiveness of the proposed valid inequalities, enhanced formulations, and heuristic schemes. The results indicate that the proposed schemes for tightening the underlying relaxations play a significant role in enhancing the performance of both exact and heuristic solution methods for this class of problems. © 2000 John & Sons, Inc. Naval Research Logistics 47: 166–183, 2000.     

Planning gamma accelerated degradation tests with two accelerating variables

Gamma accelerated degradation tests (ADT) are widely used to assess timely lifetime information of highly reliable products with degradation paths that follow a gamma process. In the existing literature, there is interest in addressing the problem of deciding how to conduct an efficient, ADT that includes determinations of higher stress‐testing levels and their corresponding sample‐size allocations. The existing results mainly focused on the case of a single accelerating variable. However, this may not be practical when the quality characteristics of the product have slow degradation rates. To overcome this difficulty, we propose an analytical approach to address this decision‐making problem using the case of two accelerating variables. Specifically, based on the criterion of minimizing the asymptotic variance of the estimated q quantile of lifetime distribution of the product, we analytically show that the optimal stress levels and sample‐size allocations can be simultaneously obtained via a general equivalence theorem. In addition, we use a practical example to illustrate the proposed procedure.     

基于反正切函数的测试性分配方法

针对现有主流测试性分配方法存在的分配指标过低和过高等不合理问题,分析认为其根源在于现有方法采用线性分配函数,而该函数不符合测试性指标提升规律,为此,构造了一种基于反正切函数的测试性分配函数,设计故障检测率与故障隔离率指标的分配算法,开展案例应用并与经典故障率分配法和综合加权分配法进行对比分析,结果表明随着分配权重(故障率)的变大,本方法分配指标的增幅逐渐减小,不会出现极低指标和超1指标的不合理情形。     

装备保障人员优化配置方法研究

将装备保障人员按级别分为操作人员、维修人员及管理人员,结合人员进入、培训和退出的状态,构造了状态转移矩阵,求出了各级别人员数量。定义了不同级别针对不同任务的保障效率,按照保障人员完成最高效率任务构建了最优化配置模型。通过实例验证了模型的实用性。     

引入价格因素的网络资源分配模型与算法实现

引入价格因素,针对网络资源分配提出PE-EMRA网络资源分配模型,并给出算法实现。PE-EMRA模型综合考虑带宽、缓冲等多种网络资源,调节并限制各业务类流量,使系统总效率最大化。该方法可有效提高资源利用率,提供服务质量保证,并具有配置灵活、实现代价小等特点。     

战役野战油库油料输送力量优化分配研究

如何科学、合理分配战役野战油库油料输送力量是战时油料保障必须面临的一个实际问题。首先根据战役野战油库运油车分配模型得到一个运油车初始分配方案,然后运用计算机模拟技术对分配方案进行模拟,并根据模拟结果不断调整,直至得到优化的分配方案,为制定战役野战油库油料输送计划提供决策依据。     

基于NSGA-Ⅱ的WTA多目标优化(英文)

将多目标遗传算法NSGA-(改进的非支配排序遗传算法)应用于求解武器-目标分配(WTA)问题。首先,针对以往在建立防空型WTA问题的优化模型上的片面性,把WTA问题看做多目标优化问题,建立了综合考虑作战效能和防御效能的WTA双目标优化模型。然后在此基础上,研究和应用了NSGA-来求解WTA问题。最后由仿真算例验证了NSGA-在WTA问题中的应用可行性,表明了NSGA-可以快速地搜索到WTA多目标优化的Pareto最优解集,从而为求解WTA问题提供了一条有效途径。     

基于遗传模拟退火算法的OFDMA系统资源分配

针对多用户OFDMA系统,提出了一种基于遗传模拟退火算法的多用户OFDMA系统资源分配策略。在资源分配时,首先假设总功率在载波间均等分配,随后根据比例速率要求确定每个用户需要的子带数,最后引入遗传模拟退火算法求解联合优化中的子带分配,在保证用户间公平性的前提下最大化系统吞吐量。仿真结果表明,该策略系统容量较大,并且近似满足了不同用户间传输速率比例性要求。     

基于分阶段筛选评估的合同网任务分配机制

基于合同网的任务分配机制广泛应用于各领域的多Agent系统中,以解决分布式任务分配问题。在分析经典合同网协议优缺点的基础上,提出了分阶段筛选与招投标协商相结合的任务分配模型。通过招投标的可计算性评估,将主要计算任务放在招投标Agent内部进行并且缩小招投标范围,从而减少通信并提高效率;通过动态确定评估指标提高了机制的通用性。     

动态规划在消防增援调度中的应用

由于各消防中队一般规模较小,对于较大规模的火灾需要多个消防队共同救护,此时若能够实现增援调度的最优化可以提高这些同时出现的火灾被全部扑灭的概率。利用多阶段动态规划对增援调度进行了研究,并分析了具体案例。通过分析得出此方法有助于改善消防资源分配状况,以实现最大程度地减小经济损失。