含有p-Laplacian算子的非齐次边值问题正解的存在性

研究非齐次边界条件下，含有p-Laplacian算子的微分方程的可解性，在Banach空间中应用Krasnoselskii不动点定理，得到了边值问题正解存在性结果。     

New inequalities for finite and infinite group problems from approximate lifting

In this paper, we derive new families of facet‐defining inequalities for the finite group problem and extreme inequalities for the infinite group problem using approximate lifting. The new valid inequalities for the finite group problem include two‐ and three‐slope facet‐defining inequalities as well as the first family of four‐slope facet‐defining inequalities. The new valid inequalities for the infinite group problem include families of two‐ and three‐slope extreme inequalities. These new inequalities not only illustrate the diversity of strong inequalities for the finite and infinite group problems, but also provide a large variety of new cutting planes for solving integer and mixed‐integer programming problems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

蚁群算法在车辆巡回保障中的应用研究

应用蚁群算法（ACA）解决车辆巡回保障问题，建立了车辆巡回保障优化数学模型，对轨迹更新规则进行了重新设定，给出了算法的实现步骤。通过算例分析，将计算结果与遗传算法（GA）和粒子群算法（PSO）作了比较，对模型和算法的正确性、高效性和适用性进行了验证。实验结果表明，该算法可以快速、有效求得车辆巡回保障的优化解，得到车辆巡回保障过程中的较优方案。     

当前火灾自动报警系统运行中存在问题及对策

结合多年工作实践,对火灾自动报警系统设计、施工与运行中存在的诸多问题进行了探讨,分析了存在问题的原因,并从设计、产品选用、施工管理、消防验收、日常管理、提高认识程度、加强监督检查几个方面提出了相应的解决办法和建议。     

一阶非线性脉冲边值问题解的存在性

研究一阶非线性脉冲周期边值问题，应用微分不等式和Schaefer不动点定理，得到了脉冲边值问题解存在的充分性判据，并给出了相应的Green函数。     

Simple paths with exact and forbidden lengths

We study new decision and optimization problems of finding a simple path between two given vertices in an arc weighted directed multigraph such that the path length is equal to a given number or it does not fall into the given forbidden intervals (gaps). A fairly complete computational complexity classification is provided and exact and approximation algorithms are suggested.     

论中国教育现代化中的依附性问题

按照依附理论,从历史发展的过程及社会结构的角度来看,中国教育现代化有很强的依附性特征。基于此,中国教育在其现代化过程中,必须在利用依附发展特性的基础上,摆脱、超越对西方发达国家教育的依附;中国教育现代化必须处理好与经济发展、政治民主、法制建设之间的关系,以此促进自己的现代化进程。     

原始变量守恒形式控制方程的时间准确性分析

基于压力、速度和温度的原始变量为自变量的守恒形式的控制方程可应用于定常流动问题，但是在求解非定常问题，例如某一典型激波管问题时，激波后温度出现过冲现象，即使通过细化网格、提高空间格式精度或者换用其他通量格式仍不能消除，这表明误差可能来自该方法本身。采用一维Euler方程对该方法进行数值分析。分析结果表明，数值误差来自时间项。通过构造相应的双时间步方程，虚拟时间项采用原始变量，而物理时间项采用守恒变量，并在两个相邻物理时间步内作为定常问题求解，可以收敛到相应的守恒形式，消除上述误差，得到准确的非定常数值解。     

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     

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

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