The bi-objective Pollution-Routing Problem

The bi-objective Pollution-Routing Problem is an extension of the Pollution-Routing Problem (PRP) which consists of routing a number of vehicles to serve a set of customers, and determining their speed on each route segment. The two objective functions pertaining to minimization of fuel consumption and driving time are conflicting and are thus considered separately. This paper presents an adaptive large neighborhood search algorithm (ALNS), combined with a speed optimization procedure, to solve the bi-objective PRP. Using the ALNS as the search engine, four a posteriori methods, namely the weighting method, the weighting method with normalization, the epsilon-constraint method and a new hybrid method (HM), are tested using a scalarization of the two objective functions. The HM combines adaptive weighting with the epsilon-constraint method. To evaluate the effectiveness of the algorithm, new sets of instances based on real geographic data are generated, and a library of bi-criteria PRP instances is compiled. Results of extensive computational experiments with the four methods are presented and compared with one another by means of the hypervolume and epsilon indicators. The results show that HM is highly effective in finding good-quality non-dominated solutions on PRP instances with 100 nodes.     

考虑完全拆分的拣选分批与拣选路径集成优化模型

在电商海量订单背景下,在线订单拣选作业难度加大,因此设计了基于订单完全拆分的拣选分批与拣选路径综合优化模型解决此问题.模型共分两阶段.第一阶段,基于种子算法,设计考虑订单完成度、等待时间与拣选路径的拣选分批模型;第二阶段以拣选单流为单队列,设计多拣选员并行服务的拣选系统.行走策略为基于返回型和遍历型的综合策略,拣选路径优化模型采用模拟退火算法求解.算例分析表明,与传统的不拆分拣选分批模型相比,构建的综合优化模型能够显著提高拣选系统效率.拣选员为4人时,模型能够使总服务时间减少58.79%,订单完成率提高10.09%.     

基于模拟退火算法的城市物流多目标配送车辆路径优化研究

基于传统模拟退火算法,通过引入记忆函数、结合GIS手段,运用SPSS聚类分析来确定初始化状态种群、多种群并行机制和新状态的产生.依据种群规模采用不同产生算法来改进算法,并将改进算法应用于城市物流中确定的多目标车辆路径优化问题,验证了算法的可行性与实用价值.此外,改进算法分别与传统模拟退火算法和GIS图解法相比较,优化效率和准确率都得到了很大的提高.     

基于价格选择的集配一体化车辆路径问题研究

在家电的集配一体化过程中,回收价格不仅影响企业的回收成本,而且同样影响车辆路径,然而在家电集配过程中回收价格因素一直未能引起足够的重视.为此,以回收价格为出发点,通过定价系统根据产品可再生利用价值与制造商所给的回收价格的差别研究车辆路径优化问题,建立该问题的数学规划模型,同时结合家电集配一体化的实际性和复杂性的要求设计了改进遗传算法.最后,结合算例进行仿真计算,验证了模型与算法的有效性.     

求解车辆路径问题的离散蝙蝠算法

根据车辆路径问题的数学模型,分析了它的具体特征,从而对BA的操作算子又进行了重新定义,设计了求解VRP问题的离散蝙蝠算法,并通过实例测试将离散蝙蝠算法与其他算法进行比较,验证了该算法求解VRP问题的有效性与可行性.     

单光子量子路由的耗散影响

单光子量子路由对于在芯片中实现量子信息交换具有重大意义。研究单光子量子路由中的耗散影响能够更加真实的模拟实际实验的结果。研究发现耗散能级的存在使得同等条件下的量子路由概率减小,并且需要相对较强的耦合才能取得最大量子路由概率。同时,也建立了共振条件下量子路由概率同耦合强度以及耗散强度间的关系。     

基于非均匀分簇的无线传感器网络路由协议

在无线传感器网络中,分簇技术是一种有效延长网络生命周期的方法。但是这种多跳的网络模型,如果节点均匀分布并且簇的大小相等,则靠近基站的簇头由于要中继更多的数据,则会导致能量空洞现象。因此提出一种非均匀分簇方法来缓解能量空洞问题。首先,通过节点的剩余能量、到基站的距离以及邻居节点数量来选择簇头。簇一旦形成之后,通过单跳和多跳的混合机制将数据发送到基站。实验结果表明,此协议能有效的延长网络的生命周期,均衡网络能耗,有效延缓能量空洞的形成速度。     

Design of a Two layer Scalable Wavelength Routing Optical Interconnection Network

１　Ｉｎｔｒｏｄｕｃｔｉｏｎ　　Ｈｉｇｈｐｅｒｆｏｒｍａｎｃｅｐａｒａｌｌｅｌｃｏｍｐｕｔｉｎｇｐｌａｔｆｏｒｍｍａｄｅｕｐｏｆｗｏｒｋｓｔａｔｉｏｎｓｏｒｐｅｒｓｏｎａｌｃｏｍｐｕｔｅｒｓｉｎｔｅｒｃｏｎｎｅｃｔｅｄｂｙｎｅｔｗｏｒｋｈａｓｂｅｃｏｍｅｔｈｅｍａｉｎｄｅｖｅｌｏｐｍｅｎｔｓｔｒｅａｍｏｆｐａｒａｌｌｅｌｃｏｍｐｕｔｉｎｇｔｅｃｈｎｏｌｏｇｉｅｓ［１,２］．Ｗｉｔｈｔｈｅｅｎｈａｎｃｅｍｅｎｔｏｆｎｏｄｅｃｏｍｐｕｔｅｒｐｒｏｃｅｓｓｉｎｇｃａｐａｂｉｌｉｔｉｅｓ,ｉｔｂｅｃｏｍ…     

Routing multiterminal nets on a hexagonal grid

Channel routing is a vital task in the layout design of VLSI circuits. Multiterminal channel routing is different from two-terminal one. While the later is quite understood, the former still poses the difficulty. In this paper, we investigate the multiterminal channel routing problem in a hexagonal model, whose grid is composed of horizontal tracks, right tracks (with slope +60°), and left tracks (with slope −60°). We present an efficient algorithm for routing multiterminal nets on a channel of width d + 3, where d is the problem density. Furthermore, we can wire the layout produced by the router using four layers and there are no overlaps among different layers. This improves the previous known results [15, 19].     

多时间窗车辆路径问题的智能水滴算法

研究了多时间窗车辆路径问题,考虑了车容量、多个硬时间窗限制等约束条件,以动用车辆的固定成本和车辆运行成本之和最小为目标,建立了整数线性规划模型。根据智能水滴算法的基本原理,设计了求解多时间窗车辆路径问题的快速算法,利用具体实例进行了模拟计算,并与遗传算法的计算结果进行了对比分析,结果显示,利用智能水滴算法求解多时间窗车辆路径问题,能够以很高的概率得到全局最优解,是求解多时间窗车辆路径问题的有效算法。