Neighborhood search heuristics for selecting hierarchically well‐formulated subsets in polynomial regression

The importance of subset selection in multiple regression has been recognized for more than 40 years and, not surprisingly, a variety of exact and heuristic procedures have been proposed for choosing subsets of variables. In the case of polynomial regression, the subset selection problem is complicated by two issues: (1) the substantial growth in the number of candidate predictors, and (2) the desire to obtain hierarchically well‐formulated subsets that facilitate proper interpretation of the regression parameter estimates. The first of these issues creates the need for heuristic methods that can provide solutions in reasonable computation time; whereas the second requires innovative neighborhood search approaches that accommodate the hierarchical constraints. We developed tabu search and variable neighborhood search heuristics for subset selection in polynomial regression. These heuristics are applied to a classic data set from the literature and, subsequently, evaluated in a simulation study using synthetic data sets. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

链约束下加工时间恶化的Flow Shop排序问题

讨论作业具有线性加工时间,作业间具有链约束的两台处理机流水作业排序问题,目标函数为极小化完工时间。在作业加工时间简单线性恶化下,提出作业的非负开始和停止延迟恶化率,构造了满足约束条件的复合作业。在此基础上,给出作业间具有平行链约束的两台处理机流水作业排序问题的最优多项式算法。     

基于多点空间直线拟合的调炮精度检测方法

针对火炮身管上标记两个点检测调炮精度受制于单个空间点坐标测量精度的问题,提出通过增加身管上标记点的冗余数量来提高调炮精度的检测方法。应用最小二乘原理对多个空间点进行直线拟合,并采用Monte Carlo方法对身管指向的测量精度进行分析。结果表明:标记4个点、5个点、6个点和7个点与标记2个点(传统方法)相比,其身管指向的测量精度分别提高了约6%、18%、19%和21%。该方法适用于对调炮精度检测要求较高的场合,综合考虑工作效率和测量精度这两个因素,推荐标记5个点测量身管指向。     

某装备系统机电产品贮存可靠性评估方法

针对某装备系统机电产品长期自然贮存环境下可靠性无法准确评估的难题,提出了一种基于极小χ2估计和拟合优度检验的贮存可靠性评估方法,并对试验数据进行了分析、计算和处理。该方法通过拟合产品的失效分布来确定其分布函数参数,并根据确定的分布函数来预测产品的贮存可靠寿命。与现有的评估方法相比,采用该方法确定的分布函数更能反映产品的可靠性变化规律,对机电产品的贮存寿命预测结果更加合理,在工程研究领域具有很好的实用价值。     

Single batch machine scheduling with deliveries

We consider the problem of scheduling a set of n jobs on a single batch machine, where several jobs can be processed simultaneously. Each job j has a processing time p_j and a size s_j. All jobs are available for processing at time 0. The batch machine has a capacity D. Several jobs can be batched together and processed simultaneously, provided that the total size of the jobs in the batch does not exceed D. The processing time of a batch is the largest processing time among all jobs in the batch. There is a single vehicle available for delivery of the finished products to the customer, and the vehicle has capacity K. We assume that K = rD, where and r is an integer. The travel time of the vehicle is T; that is, T is the time from the manufacturer to the customer. Our goal is to find a schedule of the jobs and a delivery plan so that the service span is minimized, where the service span is the time that the last job is delivered to the customer. We show that if the jobs have identical sizes, then we can find a schedule and delivery plan in time such that the service span is minimum. If the jobs have identical processing times, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most 11/9 times the optimal service span. When the jobs have arbitrary processing times and arbitrary sizes, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most twice the optimal service span. We also derive upper bounds of the absolute worst‐case ratios in both cases. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 470–482, 2015     

基于三次B样条曲线的一维弹道修正弹空气阻力系数拟合

为提高弹道修正弹的射击精度,对一维弹道修正弹空气阻力系数的拟合方法进行了研究。在分析Logistic曲线对43年阻力定律拟合缺点的基础上,提出了一种采用三次B样条曲线对其进行拟合的新方法。并通过某型号一维弹道修正弹验证了该拟合方法具有可行性好、拟合精度高、运算简单、结果可靠等优点。该拟合方法的提出为一维弹道修正弹空气阻力系数的拟合提供了一种新的研究方法,更便于外弹道的仿真计算。     

On the uncapacitated K‐commodity network design problem with zero flow‐costs

Extending Sastry's result on the uncapacitated two‐commodity network design problem, we completely characterize the optimal solution of the uncapacitated K‐commodity network design problem with zero flow costs for the case when K = 3. By solving a set of shortest‐path problems on related graphs, we show that the optimal solutions can be found in O(n³) time when K = 3, where n is the number of nodes in the network. The algorithm depends on identifying a list of “basic patterns”; the number of basic patterns grows exponentially with K. We also show that the uncapacitated K‐commodity network design problem can be solved in O(n³) time for general K if K is fixed; otherwise, the time for solving the problem is exponential. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

Limiting survival functions of self‐similar structures

We show the existence of a unique analytic single parameter limiting survival function arising from the repeated composition of a coherent structure as the number of components tends to infinity. Examples include the repeated composition process of the bridge structure. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

一种RS码快速盲识别方法

为了获取数字通信中未知线路的纠错编码信息,提出了一种RS码快速盲识别方法.通过对RS码的二进制表示进行码根求解的方法来检测未知线路的RS码长、本原多项式阶数以及可能的本原多项式;进而遍历得到的本原多项式对RS序列进行伽罗华域的傅里叶变换(GFFT),通过连零位置和个数最终确定未知线路的真实本原多项式和生成多项式.实验验...     

电控共轨柴油机初始控制MAP研究

为合理快捷地获取电控柴油机的控制参数表MAP,进行了共轨柴油机电控初始MAP研究。分析了柴油机运行工况特点和试验获取特征工况数据的原则;引入了散点曲面拟合方法,简要说明了Shepard有理插值曲面理论和它的Lagrange插植的形式;根据柴油机运行工况的特点,提出了变步长试验点,减小试验量,引入均方根误差衡量不同试验点数拟合控制MAP的精度,结合实例给出了电控初始MAP的散点曲面拟合过程,并在493共轨柴油机上进行初始MAP的控制效果试验,试验数据表明：该方法能满足电控柴油机初始MAP的要求。