基于LMI的磁轴承-转子系统鲁棒增益调度控制器设计

针对陀螺效应明显的磁轴承-转子系统转速变化引起的模型变化而带来的控制问题,提出基于LMI的鲁棒增益调度方法设计控制器.通过建立系统依转速变化的LPV模型,设计了鲁棒增益调度控制器,使转子在全转速范围内保证了鲁棒稳定性和性能.为降低控制器设计的保守性,可缩小转速区间设计控制器使控制性能得到提高.与基于LTI模型设计的鲁棒...     

Fashion products with asymmetric sales horizons

In this study, we explore an inventory model for a wholesaler who sells a fashion product through two channels with asymmetric sales horizons. The wholesaler can improve profitability by employing joint procurement and inventory reallocation as a recourse action in response to the dynamics of sales. In this research, a simple stochastic programming model is analyzed to specify the properties of the optimal inventory decisions. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

线性系统的降维状态观测器参数化设计方法

在线性系统可观测的情况下,研究了降维状态观测器设计问题。通过非奇异线性变换,得到代数等价系统的同时分离出需观测的部分状态。基于Sylvester矩阵方程的参数化解,给出降维观测器的增益矩阵的参数化表达形式,从而给出了线性系统的降维状态观测器设计的一种参数化方法。数值算例表明：所提降维状态观测器的参数化设计方法是简单有效的。     

求最大数目不相交多约束QoS路由的一种新方法

针对多约束QoS路由问题中从资源点到目的点的最大数目的不相交路由,文章给出了一种基于罚函数与整数规划的求满足QoS约束的最大数目的互不相交路由算法。该算法利用了路由模型的结构特性,使整数规划问题转化为线性规划问题,初步的算例表明算法是有效的。     

被动声纳浮标目标运动分析及其仿真计算

针对直升机搜索潜艇的特点,研究了被动声纳浮标目标运动分析问题。对固定目标和匀速直线运动目标,分别应用确定性计算和线性最小二乘法进行数学建模及其仿真。仿真结果表明该模型可行,能对被动式声纳浮标搜潜的目标定位提供算法依据。     

火控系统线性与非线性理论

从学科发展的角度,研究了火控系统线性与非线性理论;指出了火控系统在各环节上呈现的非线性关系;强调了其中的线性、拟线性理论是其重要的组成部分;给出了线性、拟线性火控系统理论的典型成果;最后指出:目标机动、量测统计特性、武器射击方式变化,推动着非线性火控系统理论发展。该问题有待继续深入研究。     

基于二人有限零和对策的防空兵火力分配方法

为了优化防空作战过程中火力分配问题,使射击达到最佳效果,运用对策论、线性规划等理论方法,采用对策矩阵建立了防空火力分配的线性规划模型,并通过计算示例和计算机仿真初步预测了敌方的空袭兵器使用情况和我方相应的兵力分配对策。该模型建立的防空火力分配方法较好地满足了要地防空装备的战术应用问题,对提高作战效能具有一定的参考价值。     

遗传规划在机载电子设备费用估算中的应用

在对现有电子设备费用估算方法进行简要回顾的基础上,对遗传规划的原理与方法进行了分析和研究,提出了基于遗传规划的机载电子设备生产费用估算模型,并完成了算法设计和程序编制工作.以历史数据为学习样本,根据所建模型对不同型号的机载电子设备生产费用进行了估算.结果表明, 模型简单易行、精度较高,为机载电子设备费用估算提供了一条新途径.     

Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures

In this paper, we study the problem of scheduling quay cranes (QCs) at container terminals where incoming vessels have different ready times. The objective is to minimize the maximum relative tardiness of vessel departures. The problem can be formulated as a mixed integer linear programming (MILP) model of large size that is difficult to solve directly. We propose a heuristic decomposition approach to breakdown the problem into two smaller, linked models, the vessel‐level and the berth‐level models. With the same berth‐level model, two heuristic methods are developed using different vessel‐level models. Computational experiments show that the proposed approach is effective and efficient. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

A stochastic programming approach for chemotherapy appointment scheduling

Chemotherapy appointment scheduling is a challenging problem due to the uncertainty in premedication and infusion durations. In this paper, we formulate a two‐stage stochastic mixed integer programming model for the chemotherapy appointment scheduling problem under limited availability of nurses and infusion chairs. The objective is to minimize the expected weighted sum of nurse overtime, chair idle time, and patient waiting time. The computational burden to solve real‐life instances of this problem to optimality is significantly high, even in the deterministic case. To overcome this burden, we incorporate valid bounds and symmetry breaking constraints. Progressive hedging algorithm is implemented in order to solve the improved formulation heuristically. We enhance the algorithm through a penalty update method, cycle detection and variable fixing mechanisms, and a linear approximation of the objective function. Using numerical experiments based on real data from a major oncology hospital, we compare our solution approach with several scheduling heuristics from the relevant literature, generate managerial insights related to the impact of the number of nurses and chairs on appointment schedules, and estimate the value of stochastic solution to assess the significance of considering uncertainty.