Joint leisure travel optimization with user-generated data via perceived utility maximization

The lack of personalized solutions for managing the demand of joint leisure trips in cities in real time hinders the optimization of transportation system operations. Joint leisure activities can account for up to 60% of trips in cities and unlike fixed trips (i.e., trips to work where the arrival time and the trip destination are predefined), leisure activities offer more optimization flexibility since the activity destination and the arrival times of individuals can vary.To address this problem, a perceived utility model derived from non-traditional data such as smartphones/social media for representing users’ willingness to travel a certain distance for participating in leisure activities at different times of day is presented. Then, a stochastic annealing search method for addressing the exponential complexity optimization problem is introduced. The stochastic annealing method suggests the preferred location of a joint leisure activity and the arrival times of individuals based on the users’ preferences derived from the perceived utility model. Test-case implementations of the approach used 14-month social media data from London and showcased an increase of up to 3 times at individuals’ satisfaction while the computational complexity is reduced to almost linear time serving the real-time implementation requirements.     

Heuristic search for the coupled runway sequencing and taxiway routing problem

This paper presents the first local search heuristic for the coupled runway sequencing (arrival & departure) and taxiway routing problems, based on the receding horizon (RH) scheme that takes into account the dynamic nature of the problem. As test case, we use Manchester Airport, the third busiest airport in the UK. From the ground movement perspective, the airport layout requires that departing aircraft taxi across the arrivals runway. This makes it impossible to separate arrival from departure sequencing in practice. Operationally, interactions between aircraft on the taxiways could prevent aircraft from taking off from, or landing on, runways during the slots assigned to them by an algorithm optimizing runway use alone. We thus consider the interactions between arrival and departure aircraft on the airport surface. Compared to sequentially optimized solutions, the results obtained with our approach indicate a significant decrease in the taxiway routing delay, with generally no loss in performance in terms of the sequencing delay for a regular day of operations. Another benefit of such a simultaneous optimization approach is the possibility of holding aircraft at the stands for longer, without the engines running. This significantly reduces the fuel burn, as well as bottlenecks and traffic congestion during peak hours that are often the cause of flight delays due to the limited amount of airport surface space available. Given that the maximum computing time per horizon is around 95 s, real-time operation might be practical with increased computing power.     

危险废物定位-运输路线安排问题模型和算法研究

随着我国经济的快速发展,人民生活水平的提高,产生的废弃物日益增加,如何处理这些废弃物已经成为政府面临的一个重要问题．因此,许多学者开始研究危险废物的管理问题．针对现实情况,研究了危险废物管理系统中处理和处置中心的定位以及运输路线安排问题,结合实际构建了多目标整数规划模型．数学模型综合考虑了三个目标：（1）总体成本最小化（包括设施建设成本和运输成本）;（2）总体风险最小化（包括运输风险和处理风险）;（3）风险公平最大化．提出了解决问题的两阶段混合启发式算法：禁忌搜索——蚁群算法．给出了一个简单算例进行分析．     

混合超启发式法求解大规模VRP的优化研究

车辆路径是一类NP(non-deteministic polynomial)完全问题,研究解决车辆路径问题的高质量启发式算法有着重要理论价值和现实意义.提出一种将最近邻搜索法和禁忌搜索法优势相结合的混合超启发式算法,用来解决带容量约束的车辆路径问题.先利用最近邻搜索法构建初步路线,再利用禁忌搜索法对内部线路和互跨线路进...     

最大优势搜索法

在半景搜索法的基础上提出了一种特别适用于专家系统技术的搜索方法－－最大优势搜索法,该搜索方法避免了半景搜索法在观景阶段一次性获取所有“OR”类原始数据结点存在情况的盲目步骤,通过跟踪期望解的优势,以较高的求解效率获得问题的最佳解。     

基于高速收费数据的路径速度还原与流量推断

基于收费数据的高速公路研究逐渐增多.本文利用收费数据对高速公路车流量进行推断.使用广度优先搜索算法对车辆进行路径还原,然后对车辆的运行状态进行了细化,对车辆平均速度的计算方法进行了优化.依据车辆行驶状态计算时间与速度,推算出车辆在不同时间段内的位置信息,进而推断出不同时段各路段的流量.与优化前的结果进行对比,发现了误差...     

基于布谷鸟搜索算法的既有线整正

获取合适的线路整正优化设计参数可以使线路整正总体拨量更小,降低线路整正维护工作量。文章提出了一种基于布谷鸟搜索算法的既有线整正方法。首先,采用最小二乘法建立前夹直线和后夹直线方程,并以此识别和计算出各个特征点;再结合布谷鸟搜索算法,以前后夹直线斜率、截距、前后缓和曲线长度和圆曲线半径等参数为自变量,以各个测点线路拨量的绝对值之和最小为优化目标建立模型,对其求解得到线路整正优化设计参数。为验证该算法的有效性,以沪昆线某段线路的平面测量坐标为试验对象,在无约束、整体约束和单点约束条件下,优化得到的整体拨量均小于传统方法的计算值,整体拨量下降明显。试验结果表明：采用该方法得到的整正优化设计参数可以使线路整正拨量较采用以往研究方法所得到的拨量更小,具有数据处理适用性强,计算结果更为准确的优点。     

基于可靠性最短路的实时定制公交线路优化研究

为实时优化定制公交线路,提出一种基于可靠性最短路的线路优化方法,在复杂的交通环境中,可以高效的将乘客送达目的地. 对可靠性最短路进行问题描述,建立可靠性时空网络;给出求解可靠性最短路的算法步骤,构建乘客和定制公交运营商总成本最小的目标函数,采用禁忌搜索算法对问题进行求解;最后,以某市定制公交路网进行实例分析. 结果表明：与最短路线路方案比较,所提方法更接近于实际运营;在高峰时段,交通拥堵的情况下,所提方法可以提高车辆的可靠性,提升定制公交线路的服务水平.     

基于轨道交通网络特点的K最短路算法研究

城市轨道交通网络发展带来出行路径选择的复杂性,为了科学掌握线路客流,组织运输,合理引导乘客路径选择,需要开展轨道多路径算法研究;同时,随着生活节奏加快,要求算法高效,注重路径获取的实时性。针对轨道网络特征,将站点之间K最短路搜索转化为线路换乘组合搜索,降低搜索空间复杂度,并利用杭州轨道交通网络进行案例验证。算法明显提升轨道网络K最短路搜索效率,能够更快速响应轨道交通实际运行变化,有助于提升今后轨道交通出行服务应用。     

基于CBTC的灯泡线线路拓扑结构分析与设计

分析灯泡线对既有CBTC系统线路拓扑结构下链接关系的影响,提供一种基于轨道交通灯泡线线路的系统设计方法,并给出描述线路拓扑的数据结构定义。系统设计方法核心思想是:在CBTC系统中,将灯泡线中的拐点作为一个链接对象。通过对拐点两侧的区段链接关系进行描述和确定,对于存在灯泡线的线路,根据列车运行方向,实现对含拐点线路的路径搜索,并对包络跨在拐点上的列车进行包络位置计算,对列车运行方向与信号机、车档等方向的一致性判断给出具体方法。通过使用这种方法,使得既有CBTC系统少量修改拓扑结构,就能支持灯泡线线路。