基于eL2TP实现VPDN

介绍L2TP协议在现阶段所存在的安全隐患,对eL2TP协议的原理进行描述,讨论控制消息和PPP-PDU的具体封装,对现有的L2TP源代码进行分析,并描述内部各模块之间的关系.在该结构上加入AD域模块、隧道认证模块、数据加密模块、Linux下伪终端的应用,从而建立完整的e12TP体系结构.并基于该e12TP协议实现VPDN,同时进行抓包分析和脸证.     

改进的量子遗传算法在车间调度中的应用

在对车间作业调度问题及其调度方法进行描述的基础上,提出改进量子遗传算法（IQGA）并用于解决车间调度问题,改进的量子遗传算法用路由选择算法来选择染色体,进行编码,并用最优个体来更新量子旋转门,旋转角是自适应调整的,这样使算法更好的收敛到全局最优解,经过仿真,验证了算法的有效性。     

基于改进粒子群算法的车辆路径问题研究

针对标准粒子群算法在解决多维复杂优化问题中存在的“早熟”现象,以及算法后期出现的搜索精度下降、收敛速度降低等不足,对算法做出改进：引入微生物行为机制中的趋化、繁殖、迁移算子。最后,通过实例验证对比,表明改进粒子群算法在搜索效率和解的质量方面均优于遗传算法和基本粒子群算法。     

A hybrid heuristic strategy for liquefied natural gas inventory routing

As liquefied natural gas (LNG) steadily grows to be a common mode for commercializing natural gas, LNG supply chain optimization is becoming a key technology for gas companies to maintain competitiveness. This paper develops methods for improving the solutions for a previously stated form of an LNG inventory routing problem (LNG-IRP). Motivated by the poor performance of a Dantzig-Wolfe-based decomposition approach for exact solutions, we develop a suite of advanced heuristic techniques and propose a hybrid heuristic strategy aiming to achieve improved solutions in shorter computational time. The heuristics include two phases: the advanced construction phase is based on a rolling time algorithm and a greedy randomized adaptive search procedure (GRASP); and the solution improvement phase is a series of novel MIP-based neighborhood search techniques. The proposed algorithms are evaluated based on a set of realistic large-scale instances seen in recent literature. Extensive computational results indicate that the hybrid heuristic strategy is able to obtain optimal or near optimal feasible solutions substantially faster than commercial optimization software and also the previously proposed heuristic methods.     

The split-demand one-commodity pickup-and-delivery travelling salesman problem

This paper introduces a new vehicle routing problem transferring one commodity between customers with a capacitated vehicle that can visit a customer more than once, although a maximum number of visits must be respected. It generalizes the capacitated vehicle routing problem with split demands and some other variants recently addressed in the literature. We model the problem with a single commodity flow formulation and design a branch-and-cut approach to solve it. We make use of Benders Decomposition to project out the flow variables from the formulation. Inequalities to strengthen the linear programming relaxation are also presented and separated within the approach. Extensive computational results illustrate the performance of the approach on benchmark instances from the literature.     

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.     

物流配送车辆路线求解算法

为进一步降低日益复杂的物流配送成本, 通过对物流配送网络系统分析, 提出更为接近实际的三层次物流配送网络结构。针对第二层次车辆路线问题(VRP)网络模型, 运用四叉树原理进行客户分区, 使用两阶段启发式算法优化车辆行驶路线, 采用C语言编程实现了算法设计。运用模拟数据通过LINGO程序仿真测试, 显示该算法计算结果与LINGO计算结果相同, 而计算时间大幅度降低, 说明了该算法快速、有效。     

CBTC数据通信系统性能分析模型及应用研究

数据通信系统DCS(Data Communication System)是影响CBTC系统的控制精度、效率和安全性的主要因素,其通信性能的仿真、验证对于CBTC系统的研发和改进有重要意义。本文介绍利用OPNET模拟自主研发的安全通信协议和构建DCS性能仿真研究平台的方法,给出安全通信协议有限状态机模型和可配置的通信子系统节点通用模型,研究平台可用于分析安全协议在整个通信网络上的总体性能。给出利用节点模型建立整个DCS通信网络的算例和网络性能的仿真结果,实验结果表明,通信周期不完全同步可以减小报文时延,网络出现故障后,改变生成树根节点位置使最大报文时延增加近34%。     

广州地铁四号线交路运营可行性研究

介绍了广州地铁四号线实行交路运营的目的及交路运营方式,分析了目前广州地铁四号线车辆乘客信息系统(PIS)实现交路存在的报站广播及乘客显示信息问题,研究了相关问题的解决方法,对实现交路运营功能的可行性进行了深入探讨。     

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.