无线传感器网络技术及应用研究

传感器网络是由用于收集并传播环境数据的一些微小的，低功耗的传感器组成的密集的无线网络。他们可以很精确的在较远距离侦测和收集到物理环境的相关数据。无线传感器网络在军事、环境监测、交通管理、医疗、工业和民用等许多方面的潜在的巨大应用价值致使军事部门和工业界都对它非常关注。介绍了传感器网络的特点、结构形式及传感器网络的相关标准，概述了其广泛的应用前景，对当前国内外的研究动态进行了归纳总结，并提出几点应用中需注意的问题。     

基于MFC的机车交路图辅助设计系统研究

为适应机务发展新环境,提高机车交路绘图效率,采用Visual Studio 2010开发工具研究并设计支持Win7环境的机车交路图辅助设计系统(CAD),该系统基于Microsoft Foundation Classes(MFC)类库运用面向对象的C++语言编程实现,兼容性好,操作简单,所绘矢量图缩放不失真,满足铁道机务绘图需求。     

基于流量矩阵估计的路由推断算法

路由信息对网络而言非常重要。现有的路由推断技术很难适用于任意网络。本文提出了一种路由推断算法,在已知网络的拓扑结构和链路流量的情况下,先通过期望最大化算法对一个包含了多种路由可能性的流量矩阵进行估计,然后根据对应的可能需求的估计值的差异来推断实际路由。仿真结果证明了方法的有效性。     

半开放式的多配送中心纯电动车辆路径优化问题

电子商务促使越来越多的物流企业采用多配送中心模式优化车辆的配送路径,纯电动汽车逐渐替代了传统的燃油配送车辆,以改善生态环境. 结合多配送中心联合服务模式的特点和纯电动物流车辆的行驶特征,构建带时间窗的半开放式多配送中心纯电动车辆路径优化模型,设计蚁群算法对其求解. 算例对比分析结果表明：半开放式的多配送中心联合服务,能合理利用相关物流资源,改善车辆路径,降低物流费用,但需要寻找合适数量和位置的配送中心进行联合,才能达到节约成本的最佳效果;相比单配送中心,多配送中心联合服务提供了更多潜在的较低价格的充电点,在配送中心补充电量可在一定程度上节约物流成本.     

A model and optimization-based heuristic for the operational aircraft maintenance routing problem

This paper investigates the Operational Aircraft Maintenance Routing Problem (OAMRP). Given a set of flights for a specific homogeneous fleet type, this short-term planning problem requires building feasible aircraft routes that cover each flight exactly once and that satisfy maintenance requirements. Basically, these requirements enforce an aircraft to undergo a planned maintenance at a specified station before accumulating a maximum number of flying hours. This stage is significant to airline companies as it directly impacts the fleet availability, safety, and profitability. The contribution of this paper is twofold. First, we elucidate the complexity status of the OAMRP and we propose an exact mixed-integer programming model that includes a polynomial number of variables and constraints. Furthermore, we propose a graph reduction procedure and valid inequalities that aim at improving the model solvability. Second, we propose a very large-scale neighborhood search algorithm along with a procedure for computing tight lower bounds. We present the results of extensive computational experiments that were carried out on real-world flight networks and attest to the efficacy of the proposed exact and heuristic approaches. In particular, we provide evidence that the exact model delivers optimal solutions for instances with up to 354 flights and 8 aircraft, and that the heuristic approach consistently delivers high-quality solutions while requiring short CPU times.     

A reinforcement learning framework for the adaptive routing problem in stochastic time-dependent network

Most previous work in addressing the adaptive routing problem in stochastic and time-dependent (STD) network has been focusing on developing parametric models to reflect the network dynamics and designing efficient algorithms to solve these models. However, strong assumptions need to be made in the models and some algorithms also suffer from the curse of dimensionality. In this paper, we examine the application of Reinforcement Learning as a non-parametric model-free method to solve the problem. Both the online Q learning method for discrete state space and the offline fitted Q iteration algorithm for continuous state space are discussed. With a small case study on a mid-sized network, we demonstrate the significant advantages of using Reinforcement Learning to solve for the optimal routing policy over traditional stochastic dynamic programming method. And the fitted Q iteration algorithm combined with tree-based function approximation is shown to outperform other methods especially during peak demand periods.     

论气象导航在航海上的地位

在介绍气导公司的材料中,已经知道了气导公司能为航运业带来很好的经济效益与安全保障。这里,以亲自经历的气导实例为切入点,分析美国气象导航公司(wni)在船舶气象导航上难以避免的局限性。为船长、船东和租船人如何正确选择使用气导公司及其提供的资料提供一点参考意见,以期减少船东、租船人之间使用气导的纠纷。     

带时间窗的动态车辆路径问题的局部搜索算法

为有效求解带时间窗的动态车辆路径问题,建立了该问题的数学模型,通过计划周期分片,将动态问题转换为一系列的静态子问题,采用插入法构造初始解,并将重定位法、节点交换法和2-opt*法3种线路间局部搜索方法,以及2-opt法和Or-opt法2种线路内局部搜索方法的不同组合应用于初始解的改进,分析了客户出现时间、地理位置分布与不同客户时间窗范围对线路选择的影响,比较了标准算例的求解结果。结果表明:在线路间进行局部搜索时,重定位法的效果最好,2-opt*法次之,节点交换法的最差;在线路内进行局部搜索时,2-opt法优于Or-opt法;当客户请求出现时间越早,客户比较集中,客户时间窗较宽的情况下,使用的车辆数量较少,整个线路的行驶距离较短,客户延迟时间也较短。     

空车配货VRP问题的路径匹配算法

针对现有VRP（Vehicle routing problem）问题的精确解法和启发式算法应用于空车配货信息检索时的局限,引入图的概念,提出了一个基于交通路网的路径匹配算法,给出了算法复杂度分析。该算法利用交通路网中各结点之间的距离关系,检索给定起讫点间及起讫点与各自邻近结点群之间存在的配货信息,同时规划出收益费用比最优的行驶路径,并能根据配货行驶路径的特点对检索出的所信息进行分析、评价和优选,以方便空车配货组织。最后用一个仿真实例验证算法的有效性。     

舰艇编队网络互联机制研究

论文通过对舰艇编队网络模型进行分析,提出了一种适用于舰艇编队网络的无线异构网络互连协议WHRP,实验结果表明WHRP协议在路由协议开销较小的情况下能够提供较好的网络性能,同OLSR、AODV相比,更加适合舰艇编队战术无线通信网络环境.