基于混合蚁群算法的异质车队低碳VRP研究

针对货运车辆在配送调度过程中产生大量碳排放的问题，建立模型将多种影响碳排放量的因素协同优化。模型中考虑了不同载重量的异质车队，两个节点之间有多条道路的柔性路径，以及车辆重量随卸货而减少的动态负载等因素，以碳排放量、行驶时间和行驶路程为优化目标，并加入了节点需求时间窗、根据速度变化划分路段、交接和卸货时间的约束。提出了一种混合蚁群算法，利用蚁群算法信息素强度更新方式保持群体记忆性，利用粒子群算法的快速收敛特性增加计算效率。通过随机数值算例的仿真优化与对比分析，验证了算法和模型的有效性。     

Mathematical formulation and heuristic algorithms for optimisation of auto-part milk-run logistics network considering forward and reverse flow of pallets

The operational planning of distribution network for automotive industry is complex with many conditions to consider, including heterogeneous fleet, enforcing the feasibility of 3D-packing of pallets into vehicles to address the vehicle's capacity in terms of weight and volume, compatibility of orders in a vehicle, returning empty pallets from assembly-plants backwards to suppliers, and delivery time windows. A mathematical model (MILP) is proposed that takes account of these conditions to minimise total transportation costs. The network structure can be a combination of direct shipment and milk-run for both forward and reverse flow of pallets. The model is solved optimally for small-size problems. For solving larger problems, a heuristic algorithm (in two versions) is proposed that uses a similarity measure to generate a reasonable list of orders. Best/first-fit strategies are employed to generate a feasible solution with the aid of a relaxed version of the proposed MILP. Improvement heuristics are also designed. Unlike most of existing constructive heuristics, our aim for developing the heuristic approach is to force routing decision, with all of its considerations, being made optimal. We also use the proposed best-fit strategy in the body of grouping evolution strategy (GES) algorithm to attain an effective meta-heuristic approach. The effectiveness of heuristics is tested on generated instances which demonstrates they are optimal for small-size problems. They are also tested on the data of daily auto-parts shipments gathered from the largest Iranian automobile company. Results demonstrate there exists a significant potential for cost saving through milk-run strategy compared with the direct shipping strategy.     

Airline planning and scheduling: Models and solution methodologies

The airline industry is a representative industry with high cost and low profitability. Therefore, airlines should carefully plan their schedules to ensure that overall profit is maximized. We review the literature on airline planning and scheduling and focus on mathematical formulations and solution methodologies. Our research framework is anchored on three major problems in the airline scheduling, namely, fleet assignment, aircraft routing, and crew scheduling. General formulation, widely used solution approaches, and important extensions are presented for each problem and integrated problems. We conclude the review by identifying promising areas for further research.     

一维—二维耦合的水库下游地区洪水演进数学模型及应用

针对水库下游地区河道洪水与漫堤洪水模拟需求,建立了一维—二维耦合的洪水演进数学模型。一维模型采用Pressimann格式离散求解,二维模型采用能够适应复杂几何形状和多种流态的Osher格式求解,一维—二维连接处采用堰流公式实现水流交互。应用该模型模拟白溪流域2015年"苏迪罗"台风实际洪水,可得到洪水在计算区域的演进过程和淹没情况。对比模拟结果与实际情况可知,该模型计算合理、准确,计算结果可为防汛部门防洪预案制定、防汛调度决策提供技术支撑。     

HSDN‐GRA: A hybrid software‐defined networking‐based geographic routing protocol with multi‐agent approach

We propose in this paper a Hybrid Software‐Defined Networking‐based Geographical Routing Protocol (HSDN‐GRA) with a clustering approach. It takes into account three different criteria to select the best relay to send data: (1) the contact duration between vehicles, (2) the available load of each vehicle, (3) and the log of encountered communication errors embedded in each cluster head. The multi‐criteria strategy allows the selection of the most reliable vehicles by avoiding communication problems and ensuring connection availability. Once the hybrid control plane has found out the next eligible neighbor, the data plane will be in charge of dividing and sending data. To validate our approach, HSDN‐GRA has been modeled and implemented in JADE, a multi‐agent platform, to be compared to other multi‐agent based protocols. Simulation results show that HSDN‐GRA achieves good performance with respect to the average routing overhead, the packet drop rate, and the throughput.     

Integrated multi-factory production and distribution scheduling applying vehicle routing approach

This paper introduces a new integrated multi-factory production and distribution scheduling problem in supply chain management. This supply chain consists of a number of factories joined together in a network configuration. The factories produce intermediate or finished products and supply them to other factories or to end customers that are distributed in various geographical zones. The problem consists of finding a production schedule together with a vehicle routing solution simultaneously to minimise the sum of tardiness cost and transportation cost. A mixed-integer programming model is developed to tackle the small-sized problems using CPLEX, optimally. Due to the NP-hardness, to deal with medium- and large-sized instances, this paper develops a novel Improved Imperialist Competitive Algorithm (IICA) employing a local search based on simulated annealing algorithm. Performance of the proposed IICA is compared with the optimal solution and also with four variants of population-based metaheuristics: Imperialist Competitive Algorithm, Genetic Algorithm, Particle Swarm Optimisation (PSO), and Improved PSO. Based on the computational results, it is statistically shown that quality of the IICA’s solutions is the same as optimal ones solving small problems. It also outperforms other algorithms in finding near-optimal solutions dealing with medium and large instances in a reasonably short running time.     

网络匿名扫描系统设计及优化

针对网络扫描工具在进行扫描时面临的溯源问题，提出了一种匿名网络扫描系统。首先将匿名系统与网络扫描工具结合以实现匿名扫描；然后在现有匿名系统的基础上实现了该系统的本地私有化；接着通过流量分析发现，Nmap的多进程扫描因为代理链的原因会变成单进程扫描而导致其扫描扫描性能较低；最后提出了一种基于多Namp进程并发的性能优化方案，将总体扫描任务分割为多个扫描任务，并分配给多个单独的Nmap进程并行运行。实验结果表明，该性能优化方案的扫描时延接近正常扫描情况下的时延，达到了提高匿名扫描系统性能的目的。因此，该优化后的网络匿名扫描系统在阻碍溯源的同时提升了扫描效率。     

Hybridizing adaptive large neighborhood search with kernel search: a new solution approach for the nurse routing problem with incompatible services and minimum demand

The average age of the population has grown steadily in recent decades along with the number of people suffering from chronic diseases and asking for treatments. Hospital care is expensive and often unsafe, especially for older individuals. This is particularly true during pandemics as the recent SARS-CoV-2. Hospitalization at home has become a valuable alternative to face efficiently a huge increase in treatment requests while guaranteeing a high quality of service and lower risk to fragile patients. This new model of care requires the redefinition of health services organization and the optimization of scarce resources (e.g., available nurses). In this paper, we study a Nurse Routing Problem that tries to find a good balance between hospital costs reduction and the well-being of patients, also considering realistic operational restrictions like maximum working times for the nurses and possible incompatibilities between services jointly provided to the same patient. We first propose a Mixed Integer Linear Programming formulation for the problem and use some valid inequalities to strengthen it. A simple branch-and-cut algorithm is proposed and validated to derive ground benchmarks. In addition, to efficiently solve the problem, we develop an Adaptive Large Neighborhood Search hybridized with a Kernel Search and validate its performance over a large set of different realistic working scenarios. Computational tests show how our matheuristic approach manages to find good solutions in a reasonable amount of time even in the most difficult settings. Finally, some interesting managerial insights are discussed through an economic analysis of the operating context.     

A Dynamic Memory Allocation Optimization Mechanism Based on Spark

Spark is a distributed data processing framework based on memory. Memory allocation is a focus question of Spark research. A good memory allocation scheme can effectively improve the efficiency of task execution and memory resource utilization of the Spark. Aiming at the memory allocation problem in the Spark2.x version, this paper optimizes the memory allocation strategy by analyzing the Spark memory model, the existing cache replacement algorithms and the memory allocation methods, which is on the basis of minimizing the storage area and allocating the execution area according to the demand. It mainly including two parts: cache replacement optimization and memory allocation optimization. Firstly, in the storage area, the cache replacement algorithm is optimized according to the characteristics of RDD Partition, which is combined with PCA dimension. In this section, the four features of RDD Partition are selected. When the RDD cache is replaced, only two most important features are selected by PCA dimension reduction method each time, thereby ensuring the generalization of the cache replacement strategy. Secondly, the memory allocation strategy of the execution area is optimized according to the memory requirement of Task and the memory space of storage area. In this paper, a series of experiments in Spark on Yarn mode are carried out to verify the effectiveness of the optimization algorithm and improve the cluster performance.     

WSNs中规避攻击者的源位置隐私保护路由协议

为了保证无线传感器网络（Wireless Sensor Networks，WSNs）中的源节点位置隐私安全，同时实现安全性能和网络能耗的均衡，提出了WSNs中规避攻击者的源节点位置隐私路由协议，该协议假设节点具有检测攻击者的能力，通过发出危险警告消息使路由路径上的节点采取路由改变策略，使攻击者无法回溯到源节点，延长了源节点保持位置隐私的安全时间。理论分析和仿真实验表明，该协议在消耗较少的通信开销的情况下保证了源节点位置的高度隐私。