战时车辆装备定点维修保障效能仿真评估研究

战时适时适地开设定点维修保障机构，对故障车辆进行集中抢修，对提高故障车辆的修复率、保持车辆装备的完好率具有重要的意义。借助IDEF理论和数学方法建立了战时车辆装备定点维修保障概念模型和数学模型。在此基础上，以某机步师的一次进攻战斗为背景，对战时车辆装备定点维修保障效能进行了仿真评估，并对评估结果进行了分析和总结，以期为优化战时车辆装备定点维修保障方案提供参考。     

基于车辆稳态动力学特性的汽车动态轨迹规划

针对高动态环境下驾驶辅助系统（ADAS）的轨迹规划问题,提出基于车辆稳态动力学特性的动态轨迹规划算法。该算法首先在交通车轨迹预估基础上建立搜索空间,接着利用车辆稳态动力学模型作为轨迹发生器,在搜索空间中对轨迹发生器产生的轨迹进行评价,最后根据驾驶意图和优化条件选择最优轨迹。文章采用基于最优加速度预瞄理论的轨迹跟踪算法,建立了七自由度车辆动力学模型,并在Simulink环境下搭建仿真平台,进行超车仿真实验。实验结果表明,本文提出的算法可行、有效。     

战场环境下无人车辆战术机动路径规划方法

针对不同类型威胁体存在的战场环境中无人车辆战术机动路径规划问题,提出了一种基于威胁代价地图的粒子群优化（Particle Swarm Optimization,PSO）方法。借助极坐标系中关键点的极角进行路径描述,并使用分段3次Hermite插值方法形成光滑路径,将路径规划问题转化为关键点极角的参数优化问题。针对基本PSO（BPSO）算法存在的早熟收敛和后期迭代效率低的缺陷,借鉴以群集方式生活的物种按照不同任务对种群进行分工的机制,提出了一种基于多任务子群协同的改进粒子群优化（Particle Swarm Optimization based on the Multi—tasking Subpopu—lation Cooperation,PSO-MSC）算法。借助该算法的快速收敛和全局寻优特性实现了最优路径规划。实验结果表明：该算法可以快速有效地实现战场环境下无人车辆的战术机动路径规划,且规划路径安全、平滑。     

车辆应急维修保障能力评估指标体系研究

通过对影响和制约车辆应急维修保障能力的因素进行全面系统地分析，把应急维修保障活动分为五大要素，并根据维修保障系统内部因素和外部因素，建立了车辆应急维修保障能力评估静态指标体系和外部条件制约度指标体系，为实现车辆应急维修保障静态能力和动态能力的评估打下了基础。     

美军无人地面车辆概述（二）（续）

对美国陆军无人地面车辆（又称军用机器人）进行概要介绍，编译的原文为截止到2007年底的美国政府公开发布资料，分为引言、轻型无人地面车辆、中型无人地面车辆、重型无人地面车辆、大型无人地面车辆等5章，包括20多种研制和投入使用的型号，本文为第二部分。     

浅议武警部队车辆使用管理信息自动采集系统总体方案

在武警部队车辆使用管理过程中，伴随各项勤务工作的开展，有大量信息产生，如车辆使用控制中的车辆派遣信息、车辆出场信息、车辆里程消耗信息；车辆安全监控中的车辆出场技术状况检查信息；车辆运行过程中的驾驶操作信息，以及油料和器材使用消耗信息等。在武警部队车辆管理信息化建设中，只有做好信息采集工作，建立完善的信息管理系统，对信息资源合理开发和有效利用，实现信息资源的优化配置与共享，才能提高车辆使用管理水平，满足车辆保障需求。     

装甲保障车辆

保障车辆通常是在主战坦克或轻型坦克、步兵战车以及履带式装甲输送车和轮式装甲车的底盘上,安装专用设备和装置研制而成,主要用于保障坦克及其他战斗车辆的行动。按照用途分为工程保障车辆、技术保障车辆和后勤保障车辆3类。     

对武警部队车辆维修工作改革的思考

武警部队车辆维修工作是组织实施车辆装备技术保障的重要组成部分，是保持车辆技术状况完好和完成“处突”车辆抢修任务的技术手段，是巩固部队战斗力的重要因素。武警部队组建以来，车辆装备数量不断增加，车辆装备更新换代步伐加快，特别是新材料、新技术在新型车辆装备上广泛应用，车辆技术结构向模块化、集成化发展，这对现行车辆维修工作的理念、维修保障方式、方法都产生了重大影响，也对在现代条件下完成车辆维修保障任务提出了更高的要求。     

美军无人地面车辆概述（四）（续）

对美国陆军无人地面车辆（又称军用机器人）进行概要介绍，编译的原文为截止到2007年底的美国政府公开发布资料，分为引言、轻型无人地面车辆、中型无人地面车辆、重型无人地面车辆、大型无人地面车辆等5章，包括20多种研制和投入使用的型号，本文为第四部分。     

车辆装备保障业务工程的基本问题及其相关研究

本文阐述了车辆装备保障业务工程研究的背景与需求;在介绍业务工程理论基本内容的基础上,提出了车辆装备保障业务工程的概念;结合车辆装备保障活动属性对概念内涵进行了阐释,提出了车辆装备保障业务工程研究的最终愿景及体系结构;最后对车辆装备保障业务工程理论与相关理论的关系进行了分析和阐述。     

求解不确定型车辆路径问题的弱鲁棒优化方法

为降低鲁棒优化模型最优解的保守性,以最小化违约车辆数和总惩罚成本为目标,建立针对旅行时间不确定的开放式车辆路径问题的弱鲁棒优化模型。对于不确定数据集的每个取值,该模型的最优解可以使其目标函数值始终不超过某数值,进而改善最优解的保守性。为提高启发式算法发现最优解的概率,提出一种自设计遗传算法对模型进行求解,其主要思想是利用粒子群算法搜索出可使遗传算法预期产生最好解的算法要素,并将其进行组合,从而产生新的遗传算法。采用新产生的遗传算法对模型继续求解,输出最好解。计算结果表明:与以往的鲁棒优化方法相比,弱鲁棒优化方法的最优解的保守性显著降低。     

需求可拆分的应急物资调度问题的蚁群算法

应急物资调度问题是个典型的需求可拆分的车辆路径问题,区别于传统的车辆路径问题,将每个需求节点只能由一辆车访问的约束去除,允许需求节点由多辆车进行访问。针对应急物资调度问题的特点,建立相应的多目标车辆路径数学规划模型(SDVRP),并根据模型特点设计改进蚁群优化算法。最后,进行相应的算例分析,验证了该模型和算法的有效性。     

Flexibility and complexity in periodic distribution problems

In this paper, we explore trade‐offs between operational flexibility and operational complexity in periodic distribution problems. We consider the gains from operational flexibility in terms of vehicle routing costs and customer service benefits, as well as the costs of operational complexity in terms of modeling, solution methods, and implementation challenges for drivers and customers. The period vehicle routing problem (PVRP) is a variation of the classic vehicle routing problem in which delivery routes are constructed for a period of time; the PVRP with service choice (PVRP‐SC) extends the PVRP to allow service (visit) frequency to become a decision of the model. For the periodic distribution problems represented by PVRP and PVRP‐SC, we introduce operational flexibility levers and a set of quantitative measures to evaluate the trade‐offs between flexibility and complexity. We develop a Tabu Search heuristic to incorporate a range of operational flexibility options. We analyze the potential value and the increased operational complexity of the flexibility levers. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Transformations of node‐balanced routing problems

This article describes a polynomial transformation for a class of unit‐demand vehicle routing problems, named node‐balanced routing problems (BRP), where the number of nodes on each route is restricted to be in an interval such that the workload across the routes is balanced. The transformation is general in that it can be applied to single or multiple depot, homogeneous or heterogeneous fleet BRPs, and any combination thereof. At the heart of the procedure lies transforming the BRP into a generalized traveling salesman problem (TSP), which can then be transformed into a TSP. The transformed graph exhibits special properties which can be exploited to significantly reduce the number of arcs, and used to construct a formulation for the resulting TSP that amounts to no more than that of a constrained assignment problem. Computational results on a number of instances are presented. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 370–387, 2015     

A branch‐and‐cut algorithm for the nonpreemptive swapping problem

In the Swapping Problem (SP), we are given a complete graph, a set of object types, and a vehicle of unit capacity. An initial state specifies the object type currently located at each vertex (at most one type per vertex). A final state describes where these object types must be repositioned. In general, there exist several identical objects for a given object type, yielding multiple possible destinations for each object. The SP consists of finding a shortest vehicle route starting and ending at an arbitrary vertex, in such a way that each object is repositioned in its final state. This article exhibits some structural properties of optimal solutions and proposes a branch‐and‐cut algorithm based on a 0‐1 formulation of the problem. Computational results on random instances containing up to 200 vertices and eight object types are reported. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009     

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

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

What you should know about the vehicle routing problem

In the Vehicle Routing Problem (VRP), the aim is to design a set of m minimum cost vehicle routes through n customer locations, so that each route starts and ends at a common location and some side constraints are satisfied. Common applications arise in newspaper and food delivery, and in milk collection. This article summarizes the main known results for the classical VRP in which only vehicle capacity constraints are present. The article is structured around three main headings: exact algorithms, classical heuristics, and metaheuristics. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

坦克团装备技术保障能力评价模型

在效能—费用分析的基础上,提出了一个坦克团装备保障评价模型.该模型通过对坦克团有关统计数据的分析、加工和综合处理,生成一个评价参数,量化反映坦克团装备保障的能力.     

Vehicle routing problems with regular objective functions on a path

We investigate the problem of scheduling a fleet of vehicles to visit the customers located on a path to minimize some regular function of the visiting times of the customers. For the single‐vehicle problem, we prove that it is pseudopolynomially solvable for any minsum objective and polynomially solvable for any minmax objective. Also, we establish the NP‐hardness of minimizing the weighted number of tardy customers and the total weighted tardiness, and present polynomial algorithms for their special cases with a common due date. For the multivehicle problem involving n customers, we show that an optimal solution can be found by solving or O(n) single‐vehicle problems. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 61: 34–43, 2014     

基于活跃度和任务的目标导向VANETs路由算法

针对车载自组织网络(VANETs)中节点移动速度快、节点任务分布不均、网络拓扑结构不稳定等特点,提出了一种基于节点活跃度和任务的目标导向VANETs路由算法GATRA(goal-oriented routing algorithm based on activity and task)。该算法根据当前运动节点的运动方向与目标节点的关系,以及任务饱和程度,综合考虑采用消息携带还是转发策略,以节约传输平均时延。在选择中继节点时,综合考虑邻接节点的位置、运动速度和方向等影响因素,设计节点活跃度的计算方法,作为选择中继节点的策略,从而提高了消息传输的成功率。仿真结果表明,与当前典型的VANETs路由算法相比,GATRA算法在传输成功率和平均延迟时间上具有较大提升。