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

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

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

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

一种移动Ad Hoc网络路由协议的设计与实现

Ad Hoc网络是一种无需依赖于事先布设的基础通信设施,没有中心控制节点,抗毁性强,复杂的分布式、多跳无线网络。考虑到Ad Hoc网自身的特点,传统的路由协议（如RIP和OSPF）已不再适用。论文提出了一种反映链路质量的混合路由协议即可优化链路状态协议,其寻径时间较短,路由协议开销较小,能对链路状态的变化做出快速反应。     

Application specific instance generator and a memetic algorithm for capacitated arc routing problems

Capacitated arc routing problem (CARP) is a well known combinatorial problem that requires identifying minimum total distance traveled by a fleet of vehicles in order to serve a set of roads without violating the vehicles’ capacity constraints. A number of optimization algorithms have been proposed over the years to solve basic CARPs and their performance have been analyzed using selected benchmark suites available in literature. From an application point of view, there is a need to assess the performance of algorithms on specific class of instances that resemble realistic applications, e.g., inspection of electric power lines, garbage collection, winter gritting etc. In this paper we introduce a benchmark generator that controls the size and complexity of the underlying road network resembling a target application. It allows generation of road networks with multiple lanes, one-way/two-way roads and varying degree of connectedness. Furthermore, an algorithm capable of solving real life CARP instances efficiently within a fixed computational budget of evaluations is introduced. The proposed algorithm, referred to as MA-CARP, is a memetic algorithm embedded with a similarity based parent selection scheme inspired by multiple sequence alignment, hybrid crossovers and a modified neighborhood search to improve its rate of convergence. The mechanism of test instance generation is presented for three typical scenarios, namely, inspection of electric power lines, garbage collection and winter gritting. The code for the generator is available from http://seit.unsw.adfa.edu.au/research/sites/mdo/Research-Data/InstanceGenerator.rar. The performance of the algorithm is compared with a state-of-the-art algorithm for three generated benchmarks. The results obtained using the proposed algorithm are better for all the above instances clearly highlighting its potential for solving CARP problems.     

基于熵值法和TOPSIS方法的地铁列车交路评估研究

由于地铁列车交路对地铁运营效率有着显著影响,针对地铁列车交路评估,提出一种基于熵值法和逼近理想解排序（TOPSIS）法的地铁列车交路方案评估方法.为更好地反映专家评估中的模糊性,评估指标信息值用语言值给出,采用通用二元语义对语言值进行处理以避免语言信息在运算中过程中失真和扭曲,并提出基于二元语义的成本型指标与效益性指标的转换公式,基于熵值法确定评估指标为二元语义信息的指标权重求解方法.最后,提出基于语言值的TOPSIS的评估方法对地铁列车交路方案排进行排序,并给出地铁列车交路评估实例、结果验证方法的有效性和可行性.     

基于TransCAD的物流设施选址与配送路线优化研究

根据物流设施选址与配送路线的特点并结合TransCAD物流模块,构建适合TransCAD软件进行网络分析的LRP数据结构,探讨基于TransCAD的车辆路线调整技术,旨在说明新的信息技术能更高效、直观地对物流系统进行规划。     

多品种燃油海运库存路径问题鲁棒优化模型与算法

针对需求不确定下的多品种燃油海运库存路径问题(Maritime Inventory Routing Problem, MIRP),提出非专用舱室和非固定停靠供应港的船舶配送策略,通过设置供货商保守系数给定条件下的累积航次多品种燃油不确定需求预算阈值,构建以供货商燃油库存与配送总成本最小化为目标的MIRP非线性鲁棒优化模型,并设计了改进混合自适应遗传算法求解模型。算例结果表明,非专用舱室和船舶非固定停靠配送能有效降低供货商燃油库存与配送总成本;供货商在各需求港关于各品种燃油的保守系数均存在某个不同的恰当值,当保守系数超过恰当值时,客户服务水平变化趋于平缓。研究结论可为供货商多品种燃油MIRP提供决策参考。     

Daily newspaper distribution planning with integer programming: an application in Turkey

Abstract

This paper concerns the newspaper distribution problem. It addresses the transportation of newspapers from printing plant to newsagents with distribution vehicles under various particular constraints. The objective is to minimize the distance traveled by the vehicles and/or the number of vehicles. In this study, the routes for vehicles of a leading newspaper distributor company in the Turkish press sector are examined. The problem is defined as determining optimal delivery routes for a fleet of homogeneous vehicles, starting and ending at the printing plant that is required to serve a number of geographically dispersed newsagents with known demands under capacity and time constraints, while minimizing the total distribution cost. An integar linear programming model is proposed as a solution using Cplex. Computational results demonstrate that the proposed model is fast and able to find optimal solutions for problem scenarios with up to 55 newsagents within reasonable computing times. It was found that the proposed model reduced the delivery cost by 21% on average when compared to the current manual method. The results show that this model is adequate for medium-sized distribution problems.     

车辆路径问题的混沌粒子群算法研究

针对车辆路径问题中单仓库非满载这一基本类型的具体特性,设计了一种混沌粒子群算法;利用混沌系统的随机性、规律性和遍历性初始化粒子,大范围覆盖车辆路径问题的解空间,加强算法最优路径的搜索能力;通过在求解过程中的次优路径处施加混沌扰动,使算法放弃当前求解的路径,避免结果为次优解。并通过试验验证了该算法在车辆路径问题中具有很强的寻优能力。