Dynamic pricing for managed lanes with multiple entrances and exits

Priced managed lanes are increasingly being used to better utilize the existing capacity of the roadway to relieve congestion and offer reliable travel time to road users. In this paper, we investigate the optimization problem for pricing managed lanes with multiple entrances and exits which seeks to maximize the revenue and minimize the total system travel time (TSTT) over a finite horizon. We propose a lane choice model where travelers make online decisions at each diverge point considering all routes on a managed lane network. We formulate the problem as a deterministic Markov decision process and solve it using the value function approximation (VFA) method for different initializations. We compare the performance of the toll policies predicted by the VFA method against the myopic revenue policy which maximizes the revenue only at the current timestep and two heuristic policies based on the measured densities on the managed and general purpose lanes (GPLs). We test the results on four different test networks. The primary findings from our research suggest the usefulness of the VFA method for determining dynamic tolls. The best-found objective value from the method at its termination is better than other heuristics for all test networks with average improvements in the objective ranging between 10% and 90% for revenue maximization and 0–27% for TSTT minimization. Certain VFA initializations obtain best-found toll profiles within first 5–50 iterations which warrants computational time savings. Our findings also indicate that the revenue-maximizing optimal policies follow the “jam-and-harvest” behavior where the GPLs are pushed towards congestion in the earlier time steps to generate higher revenue in the later time steps, a characteristic not observed for the policies minimizing TSTT.     

Flight and passenger delay assignment optimization strategies

This paper compares different optimization strategies for the minimization of flight and passenger delays at two levels: pre-tactical, with on-ground delay at origin, and tactical, with airborne delay close to the destination airport. The optimization model is based on the ground holding problem and uses various cost functions. The scenario considered takes place in a busy European airport and includes realistic values of traffic. A passenger assignment with connections at the hub is modeled. Statistical models are used for passenger and connecting passenger allocation, minimum time required for turnaround and tactical noise; whereas uncertainty is also introduced in the model for tactical noise. Performance of the various optimization processes is presented and compared to ration by schedule results.     

Dynamic pricing and reservation for intelligent urban parking management

Despite rapid advances of information technologies for intelligent parking systems, it remains a challenge to optimally manage limited parking resources in busy urban neighborhoods. In this paper, we use dynamic location-dependent parking pricing and reservation to improve system-wide performance of an intelligent parking system. With this system, the parking agency is able to decide the spatial and temporal distribution of parking prices to achieve a variety of objectives, while drivers with different origins and destinations compete for limited parking spaces via online reservation. We develop a multi-period non-cooperative bi-level model to capture the complex interactions among the parking agency and multiple drivers, as well as a non-myopic approximate dynamic programming (ADP) approach to solve the model. It is shown with numerical examples that the ADP-based pricing policy consistently outperforms alternative policies in achieving greater performance of the parking system, and shows reliability in handling the spatial and temporal variations in parking demand.     

求解交通配流问题的一种新算法

路径选择是交通配流的主要问题,本文采用遗传算法设计了一个新模型以求解交通配流问题。实例计算表明,这一算法能迅速求出问题的全局最优解。     

测量控制网优化设计中建模与求解的一般方法

本文在目前国际公认的求解带约束非线性规划最为有效的方法之一－逐步二次规划（ＳＱＰ）法的基础上，结合目标规划原理，导出一套适用于求解一般的多目标优化模型的逐步线性目标规划（ＳＬＧＰ）法，基于ＳＱＰ法和ＳＬＧＰ法的先进性，又提出解决一般测量控制网优化设计问题的总体思路和方法，并给出了新的建模方法。     

不同驱动系统下纯电动汽车关键性能对比研究

为比较纯电动汽车不同驱动系统的关键性能,基于同一整车参数和某公司提供的可变绕组永磁同步电机试验数据,对纯电动汽车电机驱动系统开展了相关研究。基于精英保留遗传算法和动态规划理论,对单挡、两挡电控机械式自动变速器驱动系统的速比进行了设计优化。采用了精英保留遗传算法和动态规划理论对系统速比进行设计优化,并对可变绕组永磁同步电机绕组切换过程进行了动力性和经济性设计。仿真结果表明,在动力性上,两挡自动变速器驱动系统的加速性能最优;在经济性上,可变绕组永磁同步电机驱动系统的百公里能耗最小,单挡自动变速器驱动系统的动力性和经济性表现最不理想。     

技术站配流与调机运用综合问题的拉格朗日松弛算法

技术站调度问题中配流与调机运用是关系密切的两个基础问题。基于单机器调度和资源分配理论,构建单解单编技术站配流与调机运用综合问题的混合整数线性规划模型,同时确定出发列车的编组内容和调机的解编任务,使得出发列车满足列车编组要求,且车辆在站加权总停留时间最小。设计拉格朗日松弛算法松弛掉连接约束,将原问题分解为解体子问题、配流子问题和编组子问题,对偶问题采用传统次梯度优化算法求解。最后,采用既有文献算例对该算法的有效性进行测试,结果表明:与分支定界算法相比,该算法能够实现计算质量和时间的较好折中。     

车辆-轨道-桥梁竖直耦合振动程序设计及仿真

为研究轨道交通车辆经过高架桥时的动态特性,以弹性支承块式无砟轨道为例,基于车辆-轨道耦合动力学理论,建立了车辆-轨道-桥梁耦合系统的竖向振动矩阵方程,利用MATLAB软件编写了计算程序。数值算例验证了计算程序的可靠性。通过改变系统参数,探索了轨道不平顺、车辆速度和轨道结构竖向刚度对系统竖向振动响应的影响。结果表明:轨道振动频率分布在0~500 Hz范围内,以20 Hz以内的低频振动为主;桥梁振动频率分布在0~200Hz范围内,以一阶竖向弯曲振动为主;轨道不平顺所产生的轮轨高频冲击力可达轴重的3倍,是车辆-轨道-桥梁耦合系统重要激励源之一;轮轨力和轨道加速度响应对车速的变化敏感,车辆-轨道-桥梁耦合系统位移响应对车速的变化不敏感;扣件和支承块胶垫竖向刚度应根据设计要求在40~80 k N/mm之间进行合理匹配取值。     

公共对象请求代理体系结构(CORBA)技术在城布轨道交通自动售检票系统中的应用

随着城市轨道交通线网的形成,对自动售检票(AFC)系统提出了新的需求.在分析AFC系统现状和CORBA(公共对象请求代理体系结构)技术特点的基础上,对CORBA技术在AFC系统中的相关应用进行了阐述.从而为实现AFC系统可靠、稳定的数据传输,及分布式计算环境中不同硬件设备和软件系统的互联提供了解决方案.     

不确定环境下应急物资配送问题研究

针对受灾点的需求量、车辆从配送中心到受灾点的运行时间及单位成本为三角模糊数的应急物资配送问题,建立系统总费用最小和总的时间惩罚成本最小的双目标规划模型,利用模糊数的相关理论将模糊规划模型转化为确定型双目标混合整数规划模型,并由此设计了该模型的求解算法,通过算例说明了算法的可行性和有效性。分析表明,最优的车辆路径的决策方案与权重值ω关系密切,故决策者在决策时应根据实际情况选择合适的权重值ω。