基于云网格集成调度的防拥堵车辆路径规划算法

在道路交通路网中,车辆拥堵问题是流量与路网结构之间相互作用的一个复杂动态过程,通过车辆路径规划,实现对路网网格集成调度,从而提高路网通行吞吐量。传统方法采用并行微观交通动态负载平衡预测算法实现车辆拥堵调度和车辆路径规划,不能准确判断路面上的车辆密度,路径规划效益不好。提出一种基于云网格集成调度的防拥堵车辆路径规划算法,即构建基于Small-World模型的云网格路网模型,采用RFID标签信息进行路况信息采集,实现交通网络拥堵评估信息特征的提取,采用固有模态函数加权平均求得各车道的车辆拥塞状态函数,对所有车道内车辆密度取统计平均可获得簇内的车辆密度。设计交通路网拥堵检测算法来对当前个体道路信息进行一维邻域搜索,从而实现车辆路径规划控制目标函数最佳寻优。通过动态博弈的方式求得车辆防拥堵路径的近似最优轨迹,实现路径规划算法的改进。仿真结果表明,该算法能准确规划车辆路径,实现最优路径控制,从而提高严重拥堵路段的车流速度和路网吞吐性能,性能优越。     

基于交通流的车辆路径选择优化方法

针对交通流变化对车辆路径选择的影响, 寻找在交通流变化情况下对出行路线进行规划的方法。采用粒子群算法与动态规划相结合的方法对路径进行优化, 可得各车辆在交通流影响下的优秀路线。基于真实环境中的路网结构和交通数据进行模拟, 结果表明, 该方法可增加路径优化的真实性和动态性, 而且道路交通流及车辆出行时间都对车辆路径选择产生重要影响。     

基于分层道路网络的新型路径规划算法

为了降低路径规划算法的搜索空间,同时使得规划的结果更加合理,提出一种分层路径规划算法．该算法利用道路网络中道路的不同等级特性对路网进行分层处理,构造分层搜索策略,达到加快路径规划速度的目的．结合路径规划算法在实时车辆导航系统中的实际应用,给出了该算法的一个应用实例．实验结果表明,该算法能将路网中任意两点间的最短路径解算时间控制在1s之内．     

变路网情况下车辆路径问题建模及应用

受车辆调度中的一类现实需求启发,提出了路网结构可变情况下的车辆路径问题。探讨了路网变动对车辆路径的影响,在描述可变路网的基础上,基于路网、路径双层优化思想,建立了问题优化模型。考虑到路网变化给问题求解带来的复杂性,给出了改进遗传算法与随机递归算法相结合的求解策略。作为模型的直接应用和说明,最后的算例验证了模型和算法的合理性、有效性。     

混合蚁群算法在城市交通路径规划中的应用

为诱导车辆在城市交通路网中规划较优出行路线以提高出行质量,研究并建立了城市道路权值模型。此外,分析比较粒子群算法和蚁群算法各自优缺点,将两个算法分别做了改进,提出一种混合粒子群蚁群算法,并利用道路权值模型对三种算法在路径寻优效果上做了比较和分析。实验结果表明该改进的混合算法在路径规划准确度和算法计算效率上均优于粒子群和蚁群算法,取到了较好的效果。     

动态路网选址–路径优化算法及实现

针对路段通行时间随旅行时段变化的实际城市路网环境下的选址–路径问题, 建立其混合非线性整数规划 模型; 并在双层规划模型的基础上, 利用遗传算法进行设施选址, 改进蚁群算法进行车辆路径优化, 提出一种遗传算 法与改进蚁群算法协同的求解方法(GA–IACO). 在路径优化中, 基于NNC算法生成初始可行解集; 采用Max-Min蚁 群系统策略动态更新信息素范围, 降低陷入局部最优的可能性; 并通过模拟退火过程, 对邻域解集按照Metropolis准 则进行接收, 以增强算法的全局搜索能力. 在测试集上的结果表明了算法在时变有向网络上的可行性, 为验证算法 的有效性, 通过构建杭州市路网的富属性网络模型, 在得到路网结点间OD成本矩阵的基础上进行求解, 实验结果表 明, 配送成本平均降低6.92%, 选址–路径规划总成本平均降低7.09%, 所得结论为实际优化决策提供了理论支持.     

饱和路网中动态交通分配和控制一体化建模研究

对饱和路网中动态交通分配和交叉口信号控制的一体化建模进行了研究 .描述了一个双层规划问题 .上层以动态用户均衡为目标建立分配模型 ,下层以系统最优为目标进行信号设置 .考虑了饱和路段上的车辆排队行为和驾驶员路径选择行为 ,并在模型中加以描述 .最后将遗传算法与传统的非线性最优规划方法相结合求解了一体化模型     

基于遗传算法的随机路网次优拥挤收费模型

针对随机路网中出行者规避风险的择路行为,提出一种同时考虑行程时间可靠性和不可靠性的次优拥挤收费双层规划模型。上层模型以最大化路网社会福利为目标,下层模型为弹性需求期望-超额交通平衡模型。鉴于双层规划模型的复杂性,设计遗传算法求解该模型。仿真结果表明,使用遗传算法求解该模型是可行的,运行50代后,算法可收敛至目标值。     

基于出行时间预算的有限理性出行者路网均衡模型

为研究有限理性出行者逐日出行中出发时刻及路径调整的出行行为,引入前景理论,分析出行者依据最大准点到达概率来选择出行时间预算,将此出行时间预算作为到达参考点,进而在给定参考点下选择前景值最大的路径出行,并利用前次流量分配结果调整下次出行时间预算,经过多次出行达到路网流量平衡及准点到达概率最大的稳定状态。基于出行时间预算和前景理论建立了双层模型进行路网逐日均衡配流,用遗传算法求解最佳出行时间预算,用相继平均法计算路径平衡流量。最后基于算例验证模型和算法,并设定不同的出行选择机制分析出行时间预算、路径前景值及准点到达概率三者间的博弈关系。     

基于免疫遗传优化的实时交通路径诱导方法

传统交通路径规划方法忽略了对路径评估、选择的反复择优,导致路径的规划质量不高,路网通行效率无法有效提升.于是提出基于免疫遗传优化的实时交通路径诱导方法.根据出行者期望行驶速度,设定出行预期速率临界值,利用路网节点间的动态连通性优化路网架构,构建实时交通局部路网模型;计算局部路网中最短路径,在免疫遗传优化算法中加入单点交...     

A co-simulation,optimization, control approach for traffic light control with truck priority

Under certain conditions giving priority to trucks at signalized intersections will benefit all vehicles because of elimination of extra delays associated with stop and go trucks due to their size and slow deceleration and acceleration rates. In this paper, we develop, analyse and evaluate a traffic light control system for signalized intersections that takes into account the differences in dynamics and characteristics between trucks and passenger vehicles. The proposed traffic light control system combines simulation-based optimization techniques timing the baseline traffic signals and model-based active strategy giving priority to trucks when it is to the benefit of all vehicles involved. In order to overcome the computational constraints of the simulation-based approach, a multiple agent-based solution utilizing multiple simulators has been proposed for large scale road network applications. The evaluation results show consistent improvements in reducing the truck traffic delays (5% to 10%) and the number of truck stops without delaying passenger vehicles whose travel time and number of stops have also been reduced. The reductions of vehicle delays and number of stops lead to reduction in emission levels and fuel consumption for both trucks and passenger vehicles.     

不确定环境下的危险品运输车辆路径优化

针对非满载危险品运输车辆路径优化问题,通过模糊变量刻画运输过程中的人口密度、行驶速度与运输时间以及客户需求量等方面的不确定因素,考虑载货量变化对风险评估的影响,建立基于动态载货量的风险评估模型,以运输总风险、车辆总行程、车辆使用数最小为优化目标,同时兼顾时间窗、事故概率、载货量等约束构建了不确定环境下的危险品运输车辆路径多目标优化模型。将NSGA-Ⅱ算法与LNS算法相结合,设计混合NSGA-Ⅱ算法求解模型。结果表明,混合NSGA-Ⅱ算法可以获得空间分布均匀且收敛性较好的Pareto解集,不同运输参与者可根据自身偏好在解集中选择相应的配送方案;该算法得到的最优总风险、总行程及车辆使用数目分别比NSGA-Ⅱ算法优化了11.5%、1.0%和14.3%,算法搜索性能和求解精度明显提高。     

基于时空网络的自动化集装箱码头自动化导引车路径规划

针对自动化集装箱码头水平搬运作业中自动化导引车路径冲突问题,提出一种基于时空网络的路径优化方法。对于单个运输需求,首先,将路网离散化为网格网络,设计依据时间可更新的时空网络;其次,以任务完工时间最短为目标,基于时空网络下可用路段集合来建立车辆路径优化模型;最后,在时空网络上运用最短路径算法求解得最短路径。对于多个运输需求,为避免路径冲突,根据当前运输需求的路径规划结果更新下一个运输需求的时空网络,并通过迭代最终获得满足规避碰撞和缓解拥堵条件的路径规划。计算实验中,与基本最短路径求解策略（求解算法P）相比,所提方法的碰撞次数降低为0并且最小相对距离始终大于安全距离;与停车等待求解策略（求解算法SP）相比,所提方法最多减少任务总延误时间24　s,且明显降低延误任务占比以及路网平均拥堵度,最大降低程度分别为2.25%和0.68%。实验结果表明,所提方法能够有效求解大规模冲突规避的路径规划问题,并显著提高自动化导引车的作业效率。     

基于主—从两级遗传算法的港口散货物流铲车调度

港口散货物流中,在考虑铲车能力约束条件下合理的铲车调度将提高整体的运作效率,并增强顾客满意度。通过分析货位上待服务的货车与有能力约束的铲车之间的关系,提出了利用主—从级遗传算法解决该类有能力约束的铲车调度问题。首先,建立了以缩短顾客停留时间为目标的数学模型。其次,设计了主、从递阶型式的两级遗传算法。算法中,主级求解铲车到货位的分配问题,从级求解主级所分配铲车能力约束下的货车服务次序及服务时间。另外,为避免非可行解产生,在主从级遗传算法的解码中均设计了启发式规则和惩罚函数。最后,通过一个应用实例的对比实验分析验证了此算法的有效性,并将最优解通过甘特图的形式展现出来。     

The combination of continuous network design and route guidance

In this study, a traffic management measure is presented by combining the route guidance of Advanced Traveler Information System (ATIS) and the continuous network design (CNDP) to alleviate increasing traffic congestion. The route guidance recommends the travelers to choose the shortest path based on marginal travel cost and user constraints. The problem is formulated into a bi-level programming problem. The most distinct property of this problem formulation is that the feasible path set of its lower-level problem is determined by the decision variable of upper-level problem, while in conventional transportation network design problems the feasible path set for lower-level traffic assignment problem is fixed to be all the viable paths between each specific origin-destination pair. The simulated annealing algorithm is improved to solve this bi-level problem. A path-based traffic algorithm is developed to calculate the lower-level traffic assignment problem under the route guidance. Compared to the results of conventional CNDP, the measure presented in this study can better improve the transportation network performance.     

Decentralized Traffic Control for Non-Holonomic Flexible Automated Guided Vehicles in Industrial Environments

This paper deals with the problem of coordinating flexible automated guided vehicles (AGVs) in real manufacturing systems. The problem consists of ensuring safe and successful task execution while several AGVs operate as a distributed transportation system in real industrial environments. The proposed solution combines different decentralized techniques to increase the flexibility and scalability of the multirobot system. The coordination is addressed by dividing the problem into path planning, obstacle avoidance and traffic control problems. The path planning method takes into account the location of mates for replanning the routes. The obstacle avoidance technique considers the kinematic constraints of the platform for reactive motion control. The traffic control approach makes use of a decentralized control policy that takes into account the capabilities of vehicles. By combining all these techniques and configuring the system properly, we present the successful development of a distributed transportation system composed of a team of flexible AGVs. The proposed solution has been validated using both a set of custom-modified AGVs operating in a real factory and a simulation of several AGVs operating in a virtual scenario.     

A Relaxation Approach for Estimating Origin–Destination Trip Tables

The problem of estimating origin-destination travel demands from partial observations of traffic conditions has often been formulated as a network design problem (NDP) with a bi-level structure. The upper level problem in such a formulation minimizes a distance metric between measured and estimated traffic conditions, and the lower level enforces user-equilibrium traffic conditions in the network. Since bi-level problems are usually challenging to solve numerically, especially for large-scale networks, we proposed, in an earlier effort (Nie et al., Transp Res, 39B:497–518, 2005), a decoupling scheme that transforms the O–D estimation problem into a single-level optimization problem. In this paper, a novel formulation is proposed to relax the user equilibrium conditions while taking users’ route choice behavior into account. This relaxation approach allows the development of efficient solution procedures that can handle large-scale problems, and makes the integration of other inputs, such as path travel times and historical O–Ds rather straightforward. An algorithm based on column generation is devised to solve the relaxed formulation and its convergence is proved. Using a benchmark example, we compare the estimation results obtained from bi-level, decoupled and relaxed formulations, and conduct various sensitivity analysis. A large example is also provided to illustrate the efficiency of the relaxation method.     

Optimization–Simulation Model for Planning Supply Transport to Large Infrastructure Public Works Located in Congested Urban Areas

This article proposes an optimization–simulation model for planning the transport of supplies to large public infrastructure works located in congested urban areas. The purpose is to minimize their impact on the environment and on private transportation users on the local road network. To achieve this goal, the authors propose and solve an optimization problem for minimizing the total system cost made up of operating costs for various alternatives for taking supplies to the worksite and the costs supported by private vehicle users as a result of increased congestion due to the movement of heavy goods vehicles transporting material to the worksite. The proposed optimization problem is a bi-level Math Program model. The upper level defines the total cost of the system, which is minimized taking into account environmental constraints on atmospheric and noise pollution. The lower level defines the optimization problem representing the private transportation user behavior, assuming they choose the route that minimizes their total individual journey costs. Given the special characteristics of the problem, a heuristic algorithm is proposed for finding optimum solutions. Both the model developed and the specific solution algorithm are applied to the real case of building a new port at Laredo (Northern Spain). A series of interesting conclusions are obtained from the corresponding sensitivity analysis.     

Sustainability SI: Optimal Prices of Electricity at Public Charging Stations for Plug-in Electric Vehicles

With an increasing deployment of plug-in electric vehicles, evaluating and mitigating the impacts of additional electrical loads created by these vehicles on power distribution grids become more important. This paper explores the use of prices of electricity at public charging stations as an instrument, in couple of road pricing, to better manage both power distribution and urban transportation networks. More specifically, a multi-class combined distribution and assignment model is formulated to capture the spatial distribution of plug-in electric vehicles across the transportation network and estimate the electrical loads they impose on the power distribution network. Power flow equations are subsequently solved to estimate real power losses. Prices of electricity at public charging stations and road tolls are then optimized to minimize both real power losses in the distribution grid and total travel time in the urban transportation network. The pricing model is formulated as a mathematical program with complementarity constraints and solved by a manifold suboptimization algorithm and a pattern search method. Numerical examples are presented to demonstrate the proposed model and solution algorithms.     

Time-dependent performance approximation of truck handling operations at an air cargo terminal

This paper provides an analytical solution for the time-dependent performance evaluation of truck handling operations at an air cargo terminal. The demand for loading and unloading operations is highly time-dependent and stochastic for two classes of trucks. Two heterogeneous handling facilities with multiple servers are available to handle trucks assuming exponentially distributed processing times. Trucks are routed to a handling facility depending on the current state of the system upon arrival. To approximate the time-dependent behavior of such heterogeneous queueing systems, we develop a stationary backlog-carryover (SBC) approach. A numerical study compares this approach with simulations and demonstrates its applicability to real-world input data.