The time-dependent pollution-routing problem

The Time-Dependent Pollution-Routing Problem (TDPRP) consists of routing a fleet of vehicles in order to serve a set of customers and determining the speeds on each leg of the routes. The cost function includes emissions and driver costs, taking into account traffic congestion which, at peak periods, significantly restricts vehicle speeds and increases emissions. We describe an integer linear programming formulation of the TDPRP and provide illustrative examples to motivate the problem and give insights about the tradeoffs it involves. We also provide an analytical characterization of the optimal solutions for a single-arc version of the problem, identifying conditions under which it is optimal to wait idly at certain locations in order to avoid congestion and to reduce the cost of emissions. Building on these analytical results we describe a novel departure time and speed optimization algorithm for the cases when the route is fixed. Finally, using benchmark instances, we present results on the computational performance of the proposed formulation and on the speed optimization procedure.     

移动Ad Hoc网络的安全问题和解决方案

移动Ad Hoc网络的自身特点,使它比有线网络更容易遭受攻击。文章首先分析了威胁移动Ad Hoc网络安全的典型攻击,主要讨论了移动Ad Hoc网络的安全路由技术和入侵检测技术两种安全技术,对一些典型安全方案进行了论述与比较。     

Controlling road congestion via a low-complexity route reservation approach

This work introduces a novel route reservation architecture to manage road traffic within an urban area. The developed routing architecture decomposes the road infrastructure into slots in the spatial and temporal domains and for every vehicle, it makes the appropriate route reservations to avoid traffic congestion while minimizing the traveling time. Under this architecture, any road segment is admissible to be traversed only during time-slots when the accumulated reservations do not exceed its critical density. A road-side unit keeps track of all reservations which are subsequently used to solve the routing problem for each vehicle. Through this routing mechanism, vehicles can either be delayed at their origin or are routed through longer but non-congested routes such that their traveling time is minimized. In this work, the proposed architecture is presented and the resulting route reservation problem is mathematically formulated. Through a complexity analysis of the routing problem, it is shown that for certain cases, the problem reduces to an NP-complete problem. A heuristic solution to the problem is also proposed and is used to conduct realistic simulations across a particular region of the San Francisco area, demonstrating the promising gains of the proposed solution to alleviate traffic congestion.     

基于栅格数据道路选线模型算法的应用研究

主要介绍基于GIS栅格数据计算最优道路路线问题的算法设计原理和实现方法，它主要是根据坡度分级费用、最大坡长、最大纵坡和选线范围等限制条件，运用费用栅格矩阵法计算最优道路路线。最后给出一个示例，以验证道路选线模型计算结果的正确性。     

Combining Single（Mixed） Metric Approach and Genetic Algorithm for QoS Routing Problem

A hybrid algorithm for the delay constrained least cost path problem is proposed through combination of single(mixed)metric approach and genetic algorithm．Compared with the known genetic algorithm for the same problem，the new algorithm adopts integral coding scheme and new genetic operator，which reduces the search space and improves the efficiency of genetic operation．Meanwhile，the single(mixed)approach accelerates the convergence speed．Simulation results indicate that the proposed algorithm can find near-optimal even optimal solutions within moderate numbers of generations．     

基于电子海图的计划航线自动审批研究

分析舰船计划航线自动审批的基本原理和流程,建立自动审批的相关数学模型,给出实现自动审批的方法与过程,并在Windows平台用VC6.0语言编程实现计划航线自动审批的功能.     

局部扭曲立方体多播容错路由算法

通过对经典最短路算法的研究,提出一种基于最短路权矩阵法的改进算法。实验结果表明,与权矩阵法相比,改进算法能提高计算效率、增强寻路直观性;特别是当网络中大量节点为目的节点时,该算法更为简捷、有效。     

船舶绕避热带气旋安全-经济决策模型

为了同时对多个来源的热带气旋预报进行综合处理,对可供船舶选用的绕避方案从安全和经济效益两方面同时给予定量评价和分析,基于神经网络的多源热带气旋路径集成预报和未来风浪场确定技术、风险分析理论和模糊信息优化处理技术以及气象-经济决策理论等方面的最新研究成果,提出了一种可用于大洋中船舶绕避热带气旋方案选优的安全-经济决策模型。在对“天丽海”轮7个不同绕避热带气旋方案进行的模拟优选计算中,该模型能够根据决策者的具体要求,优选出效益最佳或效用最佳的绕航方案,得到的结论与多位具有丰富绕避热带气旋经验的船长分析的最佳绕航方案基本一致。     

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

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

A bi-objective cyclist route choice model

It is widely acknowledged that cyclists choose their route differently to drivers of private vehicles. The route choice decision of commuter drivers is often modelled with one objective, to reduce their generalised travel cost, which is a monetary value representing the combined travel time and vehicle operating cost. Commuter cyclists, on the other hand, usually have multiple incommensurable objectives when choosing their route: the travel time and the suitability of a route. By suitability we mean non-subjective factors that characterise the suitability of a route for cycling, including safety, traffic volumes, traffic speeds, presence of bicycle lanes, whether the terrain is flat or hilly, etc. While these incommensurable objectives are difficult to be combined into a single objective, it is also important to take into account that each individual cyclist may prioritise differently between travel time and suitability when they choose a route.This paper proposes a novel model to determine the route choice set of commuter cyclists by formulating a bi-objective routing problem. The two objectives considered are travel time and suitability of a route for cycling. Rather than determining a single route for a cyclist, we determine a choice set of optimal alternative routes (efficient routes) from which a cyclist may select one according to their personal preference depending on their perception of travel time versus other route choice criteria considered in the suitability index. This method is then implemented in a case study in Auckland, New Zealand.The study provides a starting point for the trip assignment of cyclists, and with further research, the bi-objective routing model developed can be applied to create a complete travel demand forecast model for cycle trips. We also suggest the application of the developed methodology as an algorithm in an interactive route finder to suggest efficient route choices at different levels of suitability to cyclists and potential cyclists.