Heuristics for the multi‐resource generalized assignment problem

The well‐known generalized assignment problem (GAP) involves the identification of a minimum‐cost assignment of tasks to agents when each agent is constrained by a resource in limited supply. The multi‐resource generalized assignment problem (MRGAP) is the generalization of the GAP in which there are a number of different potentially constraining resources associated with each agent. This paper explores heuristic procedures for the MRGAP. We first define a three‐phase heuristic which seeks to construct a feasible solution to MRGAP and then systematically attempts to improve the solution. We then propose a modification of the heuristic for the MRGAP defined previously by Gavish and Pirkul. The third procedure is a hybrid heuristic that combines the first two heuristics, thus capturing their relative strengths. We discuss extensive computational experience with the heuristics. The hybrid procedure is seen to be extremely effective in solving MRGAPs, generating feasible solutions to more than 99% of the test problems and consistently producing near‐optimal solutions. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 468–483, 2001     

An integer programming model for the weekly tour scheduling problem

We study a workforce planning and scheduling problem in which weekly tours of agents must be designed. Our motivation for this study comes from a call center application where agents serve customers in response to incoming phone calls. Similar to many other applications in the services industry, the demand for service in call centers varies significantly within a day and among days of the week. In our model, a weekly tour of an agent consists of five daily shifts and two days off, where daily shifts within a tour may be different from each other. The starting times of any two consecutive shifts, however, may not differ by more than a specified bound. Furthermore, a tour must also satisfy constraints regarding the days off, for example, it may be required that one of the days off is on a weekend day. The objective is to determine a collection of weekly tours that satisfy the demand for agents' services, while minimizing the total labor cost of the workforce. We describe an integer programming model where a weekly tour is obtained by combining seven daily shift scheduling models and days‐off constraints in a network flow framework. The model is flexible and can accommodate different daily models with varying levels of detail. It readily handles different days‐off rules and constraints regarding start time differentials in consecutive days. Computational results are also presented. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 607–624, 2001.     

化学物料泄漏的危害及安全处置中应注意的问题

化学物料泄漏具有引起火灾、爆炸事故,造成严重的毒害事故,污染、破坏生态环境等危害,其泄漏的原因有自然灾害、设备本身、人为及意外事故几方面,在处置化学物料泄漏事故应注意防止形成燃爆条件;严防毒害;防止冻伤;搞好现场监测等问题.     

GPS和类GPS测距技术联合用于双星编队星座的状态确定

编队卫星状态的高精度确定是编队星座功能实现的重要基础。针对对地观测的双星编队星座的状态确定问题,为了提高状态确定的精度,在GPS技术的基础上,引入了类GPS测距技术,建立了联合GPS和类GPS测距技术进行状态整体确定的两种数学模型,并讨论了GPS星间单差模糊度和类GPS星内单差模糊度的同时初始化方法,最后进行了数值仿真。仿真结果显示,类GPS观测值尤其是类GPS星内载波单差观测值的引入,明显提高了双星编队星座的状态确定精度,其中绝对姿态角的精度达到rad,相对位置的精度达到m,相对钟差的精度达到s。仿真证明方法正确有效,模型二更优于模型一。     

北斗双星系统车辆定向技术

基于卫星载波相位干涉测量原理,研究了利用北斗双星系统确定车辆航向的相关技术。首先建立了北斗定向的数学模型;接着讨论了基于交换天线思想的等效转动基线极大/极小值ERMM模糊度确定方法;然后利用构建的双天线定向系统设计了车载实时航向确定实验,并通过高精度激光陀螺捷联惯导系统对航向确定精度进行了校核。实验结果验证了ERMM解模糊方法的有效性,表明定向系统实时航向确定有效精度可达0.62°。研究结果表明,北斗双星系统可以用于实时确定车辆的航向。     

Decomposing inventory routing problems with approximate value functions

We present a time decomposition for inventory routing problems. The methodology is based on valuing inventory with a concave piecewise linear function and then combining solutions to single‐period subproblems using dynamic programming techniques. Computational experiments show that the resulting value function accurately captures the inventory's value, and solving the multiperiod problem as a sequence of single‐period subproblems drastically decreases computational time without sacrificing solution quality. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

一种基于多目标优化的QoS路由交互式算法

为了满足通信网络中一些特定业务对于多个网络指标性能的同时要求 ,研究了一类基于多目标决策的QoS路由算法。通过选取带宽作为约束条件 ,把时延和丢失率作为优化目标 ,建立了QoS路由选择的多目标非线性整数规划模型 ,并给出了一种求解模型的交互式算法。该算法通过逐步调整目标函数的上界 ,压缩目标函数的搜索空间来满足决策者的要求和网络条件。实例计算结果表明了算法的可行性     

水面舰艇防空作战能力的需求生成方法

为了更好地量化表达水面舰艇所具备的防空作战能力,提出了一种基于元活动的能力需求生成方法。建立了能力需求生成框架,在此框架下进行元活动库的提取,能力指标的分解,元活动-能力指标映射规则的分析得到中近程拦截能力的能力指标并进行了冲突消解,验证了所提方法的有效性。     

空中非合作目标旋转部件位置估计方法

针对当前空中非合作目标中旋转部件位置估计方法稳健性不足的问题,在分析旋转部件在高分辨距离像和逆合成孔径雷达像中分布特性的基础上,提出应用逆合成孔径雷达像的方位向距离单元熵和局部径向距离单元熵的旋转部件位置估计方法。该方法能够提升空中非合作目标逆合成孔径雷达成像过程中旋转部件信号分离的准确度。仿真数据和实测数据处理结果证明了所提方法的有效性,通过在实测数据中叠加额外噪声,进一步检验了所提方法对噪声的稳健性。     

基于子阵结构的相控阵MIMO雷达分辨能力分析

在阵元总数一定的情况下,不同的子阵划分方式和布阵间距对不同子阵发射正交波形,子阵内发射相干波形的相控阵-MIMO雷达系统的分辨力的影响,首先通过相控阵-MIMO雷达的信号模型推导出其广义模糊函数,然后以此分析子阵结构对距离、多普勒、方位三维分辨力的影响。仿真结果表明,在阵元总数一定的情况下,子阵越多,系统距离分辨力越高,子阵越大,多普勒分辨力越高,子阵间距满足一定条件才能有较好的系统分辨力。这些结论对相控阵-MIMO雷达子阵结构设计具有指导意义。