求解CVRP问题的一种改进启发式蚁群算法

针对蚁群算法求解CVRP问题时收敛速度慢、求解质量不高的缺点,提出了一种改进启发式蚁群算法。该算法借鉴蚁群系统和基于排列的蚂蚁系统的优点设计信息素更新策略,既加强了对每次迭代最好解的利用,又避免了陷入局部最优;按一定比例使用基本方法和基于PFIH方法构造路径,扩大了算法的搜索空间;采用一种混合局部搜索算子,增强了算法局部寻优能力。实验结果表明,改进启发式蚁群算法可以大幅度减少车辆运行成本,具有较快的收敛速度。     

A learning tabu search for a truck allocation problem with linear and nonlinear cost components

The two‐level problem studied in this article consists of optimizing the refueling costs of a fleet of locomotives over a railway network. The goal consists of determining: (1) the number of refueling trucks contracted for each yard (truck assignment problem denoted TAP) and (2) the refueling plan of each locomotive (fuel distribution problem denoted FDP). As the FDP can be solved efficiently with existing methods, the focus is put on the TAP only. In a first version of the problem (denoted (P1)), various linear costs (e.g., fuel, fixed cost associated with each refueling, weekly operating costs of trucks) have to be minimized while satisfying a set of constraints (e.g., limited capacities of the locomotives and the trucks). In contrast with the existing literature on this problem, two types of nonlinear cost components will also be considered, based on the following ideas: (1) if several trucks from the same fuel supplier are contracted for the same yard, the supplier is likely to propose discounted prices for that yard (Problem (P2)); (2) if a train stops too often on its route, a penalty is incurred, which represents the dissatisfaction of the clients (Problem (P3)). Even if exact methods based on a mixed integer linear program formulation are available for (P1), they are not appropriate anymore to tackle (P2) and (P3). Various methods are proposed for the TAP: a descent local search, a tabu search, and a learning tabu search (LTS). The latter is a new type of local search algorithm. It involves a learning process relying on a trail system, and it can be applied to any combinatorial optimization problem. Results are reported and discussed for a large set of instances (for (P1), (P2), and (P3)), and show the good performance of LTS. © 2014 Wiley Periodicals, Inc. 62:32–45, 2015     

圆周SAR与线性SAR成像特性分析与对比

圆周合成孔径雷达因其独特优势已经成为雷达领域的研究热点。分析圆周合成孔径雷达与线性合成孔径雷达在成像区域大小、点散布函数特性、回波频谱特点、三维成像能力等方面的差异,凸显了圆周合成孔径雷达的成像特点。发现单航过圆周合成孔径雷达频域成像处理的难点在于其回波频谱的空变性。为提高频域成像处理的效率,分析了平面圆周合成孔径雷达与多航过圆周合成孔径雷达成像模式,并指出这两种模式易于在频域开展一致化处理。仿真试验证明了分析内容的正确性。     

迭代插值FPFH特征点云配准算法

针对三维激光扫描点云数据的配准问题,提出了一种基于FPFH特征的迭代插值配准新方法。配准过程中考虑到点云数据获取时,受扫描仪分辨率影响,点云局部或整体密度偏小,两次测量点云数据的相同位置不存在完全相同的点,以致对应点之间存在误差。为减小误差对配准精度影响,引入迭代插值方法,增加点云整体密度。配准过程通过计算关键点处FPFH特征寻找对应相关关系求得粗配准旋转平移矩阵,再使用ICP算法进行点云的精确配准。实验结果表明,改进的配准方法简单、稳定可靠、计算速度快且计算复杂度小,对实现点云配准具有实用价值。     

基于创新人才培养的高等代数教学改革探析

高等代数作为高师院校数学与应用专业学生的一门专业基础课,它对于训练学生的数学思维、培养学生的数学素养具有重要作用。文章结合当前高等代数教学中存在的一些问题,基于创新人才的培养,具体从培养学生学习兴趣、培养学生问题意识、培养学生的数学基础能力以及创新能力、加强高等代数与解析几何、近世代数课程的联系、倡导学生学习评价的多元化等多个方面进行了高等代数课程教学改革的探索。     

卫星在役考核相关问题研究

各类卫星在现代战争中发挥着重要和关键作用。我国传统的卫星试验和鉴定具有很强的科研试验性质,承制单位和用户重点关注的是性能检验,较少考虑作战效能和部队适用性等指标。为推动卫星装备建设和应用,装备试验鉴定部门初步组织开展了相应的在役考核工作。文章对比了美军装备作战试验与鉴定、我国作战试验与在役考核的概念;提出卫星在役考核的六大特点;分析卫星在役考核的组织方式、组织机构和组织保障的不足,提出相应发展建议;研究卫星在役考核指标体系设计、分析评估方法、问题反馈与整改等方面的不足,并提出相应措施建议。     

两类新的Nash平衡点的精选

本文从系统的观点出发,对n-人非合作对策的解点作了探讨,提出了两类新的Nash平衡点的精选,并证明了其存在性。这两种Nash平衡点分别称之为第一类Nash平衡点和第二类Nash平衡点。第一类Nash平衡点具有冒险性,第二类Nash平衡点具有保守性,二者都满足整体上的最优性。     

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.     

基于窗口预测匹配的序列图像点目标轨迹检测算法

序列图像中运动点目标轨迹的实时检测算法,是目标识别、实时跟踪处理系统中的关键算法之一。在分析不同层次处理方法的基础上,给出了一种基于预测、窗口匹配的点轨迹预测—匹配检测算法,并根据仿真实验的效果,指出此算法可有效地对低信噪比序列图像运动点目标轨迹进行实时检测,具有多目标轨迹检测能力。     

A balancing problem for mixed model assembly lines with a paced moving conveyor

We state a balancing problem for mixed model assembly lines with a paced moving conveyor as: Given the daily assembling sequence of the models, the tasks of each model, the precedence relations among the tasks, and the operations parameters of the assembly line, assign the tasks of the models to the workstations so as to minimize the total overload time. Several characteristics of the problem are investigated. A line‐balancing heuristic is proposed based on a lower bound of the total overload time. A practical procedure is provided for estimating the deviation of any given line‐balance solution from the theoretical optimum. Numerical examples are given to illustrate the methodology. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.