求解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     

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

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

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

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

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.     

利用几何结构求解欧氏平面TSP的改进遗传算法

TSP是经典的组合优化问题。根据欧氏平面TSP最优环路的性质提出了子路径及相关的概念,利用点集凸壳设计了环路构造算法,并以点集Delaunay三角剖分图为启发信息设计了改进的遗传算法,通过中国144城市TSP等验证了算法的有效性。     

逆边界无网格法声源识别的理论与实验

针对逆向求解声源识别中的声辐射传输建模问题,采用无网格法将Kirchhoff- Helmholtz边界积分方程离散为受边界条件约束的有限维线性方程组,通过分块矩阵法对该约束方程组进行求解,得到了离散后声辐射传输模型的数值表达式.在此基础上,进一步研究了逆向求解声源识别问题的基本原理及其不适定性.为克服其不适定性,采用Tikhonov正则化和L曲线正则化参数选取方法,从而确立了有效的逆向求解方法.此外,还进行了扬声器阵列声源识别实验,实验结果验证了逆边界无网格声源识别理论和方法的可行性及可靠性.     

一类具变号非线性项和p-Laplacian算子的仇点·边值问题的多个正解

研究一类具Laplacian算子的m点边值问题（Ф（u＇））＇＋q（t）f（t,u）=0,0〈t〈1,u（0）=^m-2∑i=1aiu（ζi）,u＇（1）=βu＇（0）.利用锥上的不动点指数定理,对上述具有变号的非线性项的边值问题进行研究,得到多个正解存在的充分条件．     

基于安全库存的战时应急弹药储备库选址建模研究

为了更好适应战时弹药需求的不确定性,必须做好对战时应急保障系统的管理工作,应急弹药储备库的选址问题就是应急保障系统的关键环节．首先依据战时弹药需求特点,从库存策略的角度出发,引入安全库存概念;其次,建立了以建设成本和运输总距离为目标函数的战时应急弹药储备库选址模型;最后,运用Matlab对模型进行了仿真,验证了该模型的有效性．     

基于AHP算法的精确作战目标价值排序问题研究

针对精确作战中的目标价值排序问题,从战场实际出发建立了目标价值体系,并在此基础上应用AHP原理提出了目标价值排序的递阶层次结构模型．通过成对比较实现作战目标价值的精确排序,为指挥员基于目标价值的决策提供理论依据．