Resource Partitioning and Routing Optimization in Relay Enhanced Cellular Network

A joint routing and resource partitioning scheme were proposed to improve cell capacity and user throughput of cellular network enhanced with two-hop fixed relay nodes (FRNs). Radio resources are partitioned under a reuse partitioning based framework, which guarantees effective and efficient inter-cell interference management. At the same time, each mobile terminal was assigned a channel-dependent route by the routing controller, which tries to maximize the cell capacity under the constraint imposed by reuse partitioning. Intensive computer simulations demonstrate the performance superiority of the FRN enhanced cellular network employing this scheme in comparison with conventional network, as well as the validity of the channel-dependent routing mechanism.     

求解带软时间窗的开放式车辆路径问题的遗传算法

通过应用交叉、变异概率的自适应机制和交叉算子A等技术,构造了一个求解带软时间窗的开放式车辆路径问题的遗传算法。用标准测试算例对算法进行测试,并将运算结果与文献中相关算法的运算结果相比较。结果表明,该算法具有较好的性能。     

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.     

基于车载OBD数据的小汽车出行特征分析——以北京市为例

小汽车出行特征是城市道路网运行的重要影响因素之一。采集小汽车出行数据并深入分析其出行行为特征,是引导小汽车出行方式转变、降低机动车使用强度的重要条件,能够为交通精细化管理和政策制定提供支持。基于车载OBD可采集到的小汽车出行数据和轨迹数据,提出小汽车出行特征分析方法,得到出车率、出行次数、出行距离等量化指标,分析不同阶段、不同区域、不同政策下的出行指标变化特征。利用大数据分析方法对出行规律深层挖掘,进一步获得用户画像、路网非直线系数等交通特征。分析结果表明,车载OBD数据能够较好地反映小汽车出行行为特征,并对交通需求管理政策的实施效果做出定量评价。     

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

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

带时间窗的多行程交换箱甩挂路径优化

针对市区-近郊的同城物流配送系统,为尽可能降低物流运输成本的同时提高客户满意度,研究带时间窗的具有多行程的交换箱甩挂运输问题. 在配送系统中,配送车辆从配送中心出发将货物运往各个客户点,由于道路条件的限制,客户点分为只允许小型卡车配送的限制点客户和卡车或带交换箱拖车的整车都可为其配送的灵活点客户. 在客户时间窗和多行程的约束条件下,建立以成本最小为优化目标的基于交换箱甩挂的路径优化模型,提出装箱算法与遗传算法混合的启发式求解算法. 算例验证了所提出算法的有效性,为带交换箱的甩挂车进行物流配送提供一定的决策指导和参考意见.     

时变交通下生鲜配送电动车辆路径优化方法

依据时变交通路网特点设计基于路段划分策略的行驶时间计算方法,综合考虑客户对生鲜产品最低新鲜度约束,车载限制和电动车电量约束,设计三约束决策因子方法.以配送总成本最小为目标,构建时变交通下电动车城市生鲜配送路径优化模型,根据模型特点设计自适应改进的蚁群算法.实验结果表明,本文方法能够根据客户生鲜新鲜度要求,客户属性和路网特性,合理安排发车时间,科学规划配送路径,有效避免交通拥堵;通过算法对比,本文模型和算法能够明显降低配送成本,提高企业经济效益.     

城市路网动态转向建模与优先选择研究

确立网络表述方式是在城市路网中建立路径规划系统的基础工作之一.在不牺牲计算效率的前提下,网络表述方式既要能灵活反映出车辆在交叉口中所能进行的转向动作,又必须保证这些转向动作不会造成交叉口的安全隐患与通行效率的下降.针对这一需求,提出了一套面向决策点的网络表述方法,并在其数据结构的基础上,通过扩展现有的Dijkstra最短路搜索算法,在不改变以最短路为优化目标的前提下,以次优选择方式实现了干道优先和非左转优先的转向选择.以现实交通网络为模型,通过一系列实验验证算法在静态路径规划中的有效性.结果表明,算法以提高0.5%额外总出行成本的前提下,同时降低了11%的支道选择和21%的左转选择.     

快递配送车辆路径优化研究

考虑到快递配送和物流配送的异同,在物流配送路径优化问题的基础上构建了符合快递配送路径优化问题的数学模型.设计了一种采用自然数编码,综合考虑快件数量、车辆载重、车辆容量等约束的解码方式的遗传算法.通过一个拥有20个配送点的快递配送案例,验证本文所构建模型和算法能够得到合理配送路径和各个配送点的服务时刻.最后通过灵敏度分析和四轮厢式货车算例验证表明:当前情况下,研究快递配送路径优化时,快件数量、快递员最长配送时间和各配送点的作业时间必须考虑;当前快递配送车辆的载重和容量满足当前需求,无需更换载重和容量更大的配送车辆.     

带软时间窗的集货与送货多车辆路径问题节约算法

研究了物流配送中多车运输的集货与送货车辆路径规划问题, 以增加时间惩罚费用的方式插入软时间窗约束, 将租车费用、货车运输费用和时间惩罚费用三者之和最小作为优化目标, 建立数学模型。采用启发式节约算法求解该模型, 考虑时间惩罚费用和运输费用, 比较每一配送节点上直接送货和间接送货的节约费用关系, 求出最优配送路径。试验结果表明: 当配送次数达到50次时, 货车平均装载率仍能达到80%以上, 该节约算法能减少货车空程行驶和租车次数, 优化了全局费用。