运用策略路由解决网络多出口问题

为了减轻互联网经营中的流量成本压力,可以租用网通、电信的第三方通道。为了克服网通、电信之间的互联瓶颈,采用策略路由,判断数据包的源地址、目的地址,从而实现流量智能转发。     

һ������ʵʱ��Ϣ��ͳ����Ϣ�Ŀɿ�·�������㷨

研究在具有过去的统计信息及实时信息条件下的交通网络上的路径生成问题 我们假定路段通行时间具有一定的概率分布，这一分布从过去的统计数据得到，而当旅行者到达某一节点时，以该节点为起点的路段的通行时间作为实时信息被告知。在以上条件下，我们给出一种自适应算法来实时地生成一条路经，使得在某一预定时刻以前到达目的地的概率最大这个概率是衡量路径的时间可靠性的尺度，因而我们称相应算法为reliable routing algorithm。与之对应，我们注意到在以往的研究中，衡量路径优劣的有平均通行时间长短等等尺度。     

带回送和时间窗的车辆路径问题的模型及算法

在分析具有回送运输和时间窗的车辆路径问题特点的基础上，建立了该问题的优化数学模型，并通过设置与发货点距离为零的虚拟集货点使问题简化．在此基础上，构造了求解问题的改进遗传算法．在算法中，结合问题的特点设计了确保个体编码有效性的OX交叉算子，并采用基于Metropolis判别准则的复制算子，确保个体多样性和避免算法过早收敛．算例表明算法有效可行．     

The fleet size and mix pollution-routing problem

This paper introduces the fleet size and mix pollution-routing problem which extends the pollution-routing problem by considering a heterogeneous vehicle fleet. The main objective is to minimize the sum of vehicle fixed costs and routing cost, where the latter can be defined with respect to the cost of fuel and CO₂ emissions, and driver cost. Solving this problem poses several methodological challenges. To this end, we have developed a powerful metaheuristic which was successfully applied to a large pool of realistic benchmark instances. Several analyses were conducted to shed light on the trade-offs between various performance indicators, including capacity utilization, fuel and emissions and costs pertaining to vehicle acquisition, fuel consumption and drivers. The analyses also quantify the benefits of using a heterogeneous fleet over a homogeneous one.     

A differential evolution approach for the vehicle routing problem with backhauls and time windows

This paper presents a differential evolution algorithm (DEA) to solve a vehicle routing problem with backhauls and time windows (VRPBTW) and applied for a catering firm. VRPBTW is an extension of the vehicle routing problem, which includes capacity and time window constraints. In this problem, customers are divided into two subsets: linehaul and backhaul. Each vehicle starts from a depot and goods are delivered from the depot to the linehaul customers. Goods are subsequently brought back to the depot from the backhaul customers. The objective is to minimize the total distance that satisfies all of the constraints. The problem is formulated using mixed integer programming and solved using DEA. Proposed algorithm is tested with several benchmark problems to demonstrate effectiveness and efficiency of the algorithm and results show that our proposed algorithm can find superior solutions for most of the problems in comparison with the best known solutions. Hence, DEA was carried out for catering firm to minimize total transportation costs. Copyright © 2013 John Wiley & Sons, Ltd.     

基于地铁-货车联运的物流配送路径优化

为应对配送车辆引起道路拥堵和环境污染问题，提出地铁与货车联合运输. 在不改变地铁运行方案的前提下，利用地铁非高峰时段开展货物配送；考虑地铁剩余运能、货车容量、最大行驶距离、客户服务时间窗等限制条件，以配送距离最短为优化目标，构建基于地铁-货车联运的物流配送路径优化模型. 通过地铁配送路径设计不规则二维矩阵编码结构，使用改进自适应遗传算法求解. 以某市地铁货物运输为例，验证模型和算法的实用性、有效性. 结果表明，地铁-货车联合配送距离短，在客户时间窗范围内送达比例高，有效提高客户满意度.     

隧道检测裂缝的图像处理研究

裂缝是隧道衬砌最常见的病害之一,基于近几年快速发展的工程检测系统与图像处理算法的研究,提出基于CCD相机的衬砌裂缝检测系统来采集裂缝图像。通过比较均值滤波、中值滤波、维纳滤波、自适应中值滤波和加权邻域滤波比较,选择自适应中值滤波进行图像增强。结合直方图阈值分割法、Otsu最大类间方差阈值和局部阈值分割法,对增强后图像进行二值化处理比较,Otsu法较好地保留了裂缝的边缘信息,证明了该算法的有效性,为后续裂缝信息的提取奠定了基础。     

The value of real-time traffic information in urban freight distribution

Routes optimization in urban freight distribution is usually an off-line process based on the knowledge of historical conditions on the network. Real-time data provided by Intelligent Transportation Systems (ITSs) enable online re-optimization on the basis of actual traffic conditions.

?This paper evaluates the added value generated by re-optimizing the off-line solution with real-time information. The study is carried out for a practical application to the freight distribution of perishable goods in the city of Rome (Italy). The off-line problem is formulated as a vehicle routing problem with soft time windows while in the online problem it is also allowed to skip some customers or to re-sequence the deliveries. Both versions are solved with different algorithms and with different data sets. Results can be used to evaluate the potential return on investment on the acquisition of different kinds of traffic data. At the same time, results can be of interest for information providers, to fix the price of off-line and online information and/or to estimate the associated potential market share.     

STUDY ON NEIGHBORHOOD DISCOVERY PROTOCOL IN COMMUNICATION NETWORKS

IntroductionIt is well known thatthe PNNIsystem is a de-veloping system in the private ATM networkfield[1～ 5] .According to Ref.[6],PNNI includestwo categories of protocols,one defines for dis-tributing topology information between switchesand clusters of switches- routing protocol,and theother defines the signalling- signalling protocol,which is message flows used to establish point topoint and point to multi- point connections acrossthe ATM network.Forrealizing the PNNIroutingwith m…     

Platoons of connected vehicles can double throughput in urban roads

Intersections are the bottlenecks of the urban road system because an intersection’s capacity is only a fraction of the maximum flows that the roads connecting to the intersection can carry. This capacity can be increased if vehicles cross the intersections in platoons rather than one by one as they do today. Platoon formation is enabled by connected vehicle technology. This paper assesses the potential mobility benefits of platooning. It argues that saturation flow rates, and hence intersection capacity, can be doubled or tripled by platooning. The argument is supported by the analysis of three queuing models and by the simulation of a road network with 16 intersections and 73 links. The queuing analysis and the simulations reveal that a signalized network with fixed time control will support an increase in demand by a factor of (say) two or three if all saturation flows are increased by the same factor, with no change in the control. Furthermore, despite the increased demand vehicles will experience the same delay and travel time. The same scaling improvement is achieved when the fixed time control is replaced by the max pressure adaptive control. Part of the capacity increase can alternatively be used to reduce queue lengths and the associated queuing delay by decreasing the cycle time. Impediments to the control of connected vehicles to achieve platooning at intersections appear to be small.