Selective Maintenance in System Reliability with Random Costs of Repairing and Replacing the Components

In this paper we consider the problem of determining the optimum number of repairable and replaceable components to maximize a system's reliability when both, the cost of repairing the components and the cost of replacement of components by new ones, are random. We formulate it as a problem of non-linear stochastic programming. The solution is obtained through Chance Constrained programming. We also consider the problem of finding the optimal maintenance cost for a given reliability requirement of the system. The solution is then obtained by using Modified E-model. A numerical example is solved for both the formulations.     

Kiefer–Wolfowitz algorithm under quasi-associated random errors

In this article, we study the algorithm of Kiefer–Wolfowitz underquasi-associated random errors. We establish the complete convergence and obtain an exponential bound. Additionally, we build a confidence interval for the minimum. Numerical examples are sketched out to confirm the theoretical results and show the accuracy of the algorithm.     

Impact of investing in quality improvement on (Q,r, L) model involving the imperfect production process

This paper investigates the impact of quality improvement on the modified lot size reorder point models involving variable lead time and partial backorders. The formulated models include the imperfect production process and an investing option of improving the process quality. The objective is simultaneously optimizing the lot size, reorder point, process quality level and lead time. We first assume that the lead time demand follows a normal distribution, then relax this assumption to consider the distribution-free case where only the mean and standard deviation of lead time demand are known. An algorithm procedure of finding the optimal solution is developed, and two numerical examples are given to illustrate the results.     

分支蚁群动态扰动算法求解TSP问题

蚁群优化算法是一种求解组合优化难题的强启发式算法,它利用正反馈和并行计算原理,具备很强的搜索能力。近年来,蚁群优化算法广泛应用于TSP问题的研究。本文提出分支蚁群动态扰动(DPBAC)算法,该算法主要从5个方面对基本蚁群算法做出改进:引入分支策略选取出发城市;改进状态转移规则;引入变异策略改进蚂蚁路径;改进信息素更新规则;引入条件动态扰动策略。实验表明,该算法可以有效改善基本蚁群算法搜索时间较长、容易陷入局部极小等缺点。     

Benchmark Schedules for Subcontracted Operations: Decentralization Inefficiencies that Arise from Competition and First‐Come‐First‐Served Processing*

Subcontracting has become a prominent business practice across many industries. Subcontracting of industrial production is generally based on short‐term need for additional processing capacity, and is frequently employed by manufacturers to process customer orders more quickly than using only in‐house production. In this article, we study a popular business model where multiple manufacturers, each capable of processing his entire workload in‐house, have the option to subcontract some of their operations to a single third party with a flexible resource. Each manufacturer can deliver customer orders only after his entire batch of jobs, processed in‐house and at the third party, is completed. The third party facility is available to several manufacturers who compete for its use. Current business practice of First‐Come‐First‐Served (FCFS) processing of the subcontracted workloads as well as the competitive Nash equilibrium schedules developed in earlier studies result in two types of inefficiencies; the third party capacity is not maximally utilized, and the manufacturers incur decentralization cost. In this article, we develop models to assess the value created by coordinating the manufacturers' subcontracting decisions by comparing two types of centralized control against FCFS and Nash equilibrium schedules. We present optimal and/or approximate algorithms to quantify the third party underutilization and the manufacturers' decentralization cost. We find that both inefficiencies are more severe with competition than they are when the third party allocates capacity in an FCFS manner. However, in a decentralized setting, a larger percentage of the players prefer Nash equilibrium schedules to FCFS schedules. We extend our analysis to incomplete information scenarios where manufacturers reveal limited demand information, and find that more information dramatically benefits the third party and the manufacturers, however, the marginal benefit of additional information is decreasing. Finally, we discuss an extension wherein each manufacturer's objective takes into account asymmetries in subcontracting, in‐house processing, and delay costs.     

间歇用汽负荷的蒸汽优化调度方法

当蒸汽系统中存在着间歇用汽设备时，其用汽负荷将随用汽设备的启停而产生波动．蒸汽负荷的急剧波动不仅影响锅炉的经济运行，而且直接影响蒸汽品质和产品质量．本文提出用数学规划的方法对间歇用汽设备的开启时间进行合理调度，从而使整个系统的用汽负荷趋于均衡．此方法在实际应用中取得了良好的效果．     

交互效应矩阵理论及应用

交互效应矩阵理论,是一种定性与定量相结合的控制理论,用以解决和处理一些运用经典数学的方法难以解决的模糊信息问题.本文将交互效应矩阵理论引入教学控制范畴,研究和分析学校的教学问题.实践证明这是一种行之有效、效果显著的教育控制理论,具有重要的推广价值.     

一种新的求解离散型交通网络平衡设计问题的算法

本文提出了一种新的求解离散网络平衡设计二层规划模型的算法。模型求解中,上层问题采用粒子群算法,而下层问题则采用路径生成式logit非平衡交通分配算法。数值结果显示,本文提出的算法可以快速有效地求解这类网络平衡设计二层规划模型。     

基于模拟退火的进化算法性能对比研究

将模拟退火算法和遗传算法、粒子群优化算法分别进行结合,形成模拟退火—遗传算法以及模拟退火—粒子群优化算法,并作性能对比分析。研究结果表明,这两种算法都在进化代数和全局寻优能力方面有较大突破,在找寻最佳个体解的效率上,模拟退火—粒子群优化算法更突出。     

An Alternative to Transfer Function Forecasting Based on Subspace Methods

In the time series literature, recent interest has focused on the so-called subspace methods. These techniques use canonical correlations and linear regressions to estimate the system matrices of an ARMAX model expressed in state space form. In this article, we use subspace methods to forecast two series with the help of some exogenous variables related to them. We compare the results with those obtained using traditional transfer function models and find that the forecasts obtained with both methods are similar. This result is very encouraging because, in contrast to transfer function models, subspace methods can be considered as almost automatic.