考虑移步需求的无桩型共享单车动态调度研究

共享单车系统自发的不均衡性导致单车数量分布与用户需求分布之间产生偏移，降低了系统服务能力，需要调度实现再平衡. 现有动态调度算法缺乏考虑起点车辆供给不足，用户在出行过程中“再次”取车的移步需求，难以准确识别用户真实的出行需求分布，降低了调度效果. 本文提出以用户出行选择行为为下层，以调度车辆路径规划为上层的双层规划模型框架，设计结合仿真系统的启发式求解算法. 算例场景基于上海市虹口、杨浦区共享单车历史出行数据搭建，并进行网格化处理. 算例结果表明，模型能有效识别移步需求，提高共享单车的供需匹配能力. 针对各类调度资源配置情况，共享单车的供需匹配率提升18.07%~ 19.89%，提高了共享单车系统的管理效率.     

基于多源数据的公交车能耗碳排放测算模型

公交车能耗碳排放强度与车辆、线路和驾驶员有显著相关关系，为精准刻画其能耗碳排放强度特征，整合OBD监测数据、加油(气)数据、运营排班数据等多源数据资源. OBD监测数据和加油(气)数据呈显著的线性关系，证明修正后的OBD监测数据可满足分析要求. 搭建“速度-能耗碳排放强度曲线”测算模型，幂函数关系的拟合优度R2 =0.972 6 为最高. 实证研究发现，平均速度在10~60 km/h 变化时，液化天然气(LNG)车比柴油车能耗碳排放强度高 3.3%~33.7%，双层车比铰接车高2.4%~13.3%；LNG铰接车在不同线路、相同速度下的强度相差9.6%；不同驾驶员在相同线路的能耗碳排放强度可相差24.2%. 模型为各城市基于多源数据开展公交能耗碳排放目标设定提供数据支撑.     

大跨度钢箱梁斜拉桥中跨合龙关键技术

以4座主跨超过400 m的钢箱梁斜拉桥中跨合龙控制为背景,对大跨度钢箱梁斜拉桥中跨合龙的2种方法进行对比分析,对合龙各主要工序的关键技术进行研究。提出了合龙段配切长度的计算公式和合龙口宽度连续观测的测点布置方式。建议:在调整好合龙口姿态后可不加压重,也可不采用临时劲性骨架锁定;采用无线采集设备采集合龙口结构的温度场,用激光测距仪测量合龙口宽度以提高观测效率和安全性;在悬臂施工阶段关注梁长累计误差并通过调整后续梁段的制造长度消除之。     

共享自动驾驶汽车经营策略优化分析

研究共享自动驾驶汽车(SAV)与普通汽车共存背景下，SAV公司如何根据运营目标优化经营策略并影响通勤者出行方式选择. 假设高速公路上存在一定数量的独驾通勤者，无车通勤者在SAV和地铁之间进行权衡. 分析固定需求和弹性需求下，SAV公司追求系统总成本最小或系统净收益最大和利润最大时的最优经营策略，即SAV票价和容量，进而得到均衡时模式划分情况，SAV最优发车数，系统总成本或系统净收益，以及公司利润等指标. 算例对均衡结果进一步验证发现，SAV公司垄断经营会收取较高的票价，提供容量较小的车型. 在系统最优情形下，SAV公司无法获得正利润，需要政府补贴运营.     

提高八钢专用铁路货运量的对策

优化调整货物运输结构、提高铁路发运占比是落实"蓝天保卫战"的一项具体举措。为了满足宝钢集团新疆八一钢铁有限公司生产规模的不断扩大、外运需求旺盛的实际,在对其铁路运输现状和需求,以及存在的线路质量较差、装卸效率较低、运输组织衔接弱等问题进行剖析的基础上,提出提高铁路货运量对策,即:推进路企直通战略合作、升级改造设备设施、构建调度全程统一指挥模式、优化货流源头组织,以加快调整运输结构,增加铁路货运量,推动铁路高质量发展。     

Integrating capacity analysis with high-speed railway timetabling: A minimum cycle time calculation model with flexible overtaking constraints and intelligent enumeration

Compared with most optimization methods for capacity evaluation, integrating capacity analysis with timetabling can reveal the types of train line plans and operating rules that have a positive influence on improving capacity utilization as well as yielding more accurate analyses. For most capacity analyses and cyclic timetabling methods, the cycle time is a constant (e.g., one or two hours). In this paper, we propose a minimum cycle time calculation (MCTC) model based on the periodic event scheduling problem (PESP) for a given train line plan, which is promising for macroscopic train timetabling and capacity analysis. In accordance with train operating rules, a non-collision constraint and a series of flexible overtaking constraints (FOCs) are constructed based on variations of the original binary variables in the PESP. Because of the complexity of the PESP, an iterative approximation (IA) method for integration with the CPLEX solver is proposed. Finally, two hypothetical cases are considered to analyze railway capacity, and several influencing factors are studied, including train regularity, train speed, line plan specifications (train stops), overtaking and train heterogeneity. The MCTC model and IA method are used to test a real-world case involving the timetable of the Beijing–Shanghai high-speed railway in China.     

Robust weekly aircraft maintenance routing problem and the extension to the tail assignment problem

In this paper, we study two closely related airline planning problems: the robust weekly aircraft maintenance routing problem (RWAMRP) and the tail assignment problem (TAP). In real life operations, the RWAMRP solution is used in tactical planning whereas the TAP solution is implemented in operational planning. The main objective of these two problems is to minimize the total expected propagated delay (EPD) of the aircraft routes. To formulate the RWAMRP, we propose a novel weekly line-of-flights (LOF) network model that can handle complex and nonlinear cost functions of EPD. Because the number of LOFs grows exponentially with the number of flights to be scheduled, we propose a two-stage column generation approach to efficiently solve large-scale real-life RWAMRPs. Because the EPD of an LOF is highly nonlinear and can be very time-consuming to accurately compute, we propose three lower bounds on the EPD to solve the pricing subproblem of the column generation. Our approach is tested on eight real-life test instances. The computational results show that the proposed approach provides very tight LP relaxation (within 0.6% of optimal solutions) and solves the test case with more than 6000 flights per week in less than three hours. We also investigate the solutions obtained by our approach over 500 simulated realizations. The simulation results demonstrate that, in all eight test instances, our solutions result in less EPDs than those obtained from traditional methods. We then extend our model and solution approach to solve realistically simulated TAP instances.     

Generalized Maximum Benefit Multiple Chinese Postman Problem

This research is focused on a generalization on the Max Benefit Chinese Postman Problem and the multiple vehicle variant of the Chinese Postman Problem. We call this generalization, the Generalized Maximum Benefit k-Chinese Postman Problem (GB k-CPP). We present a novel Mixed Integer Programming (MIP) formulation for the GB k-CPP. Four different cases of the model are discussed. The first case, performs arc-routing with profits and assumes that the origin and destination for each vehicle is the same for each cycle and is given by the user. The next case relaxes the assumption that the origin and destination for each vehicle should be the same and allows the users to select possible origins/destinations for vehicles. Case three gets the origin for each vehicle as input and produces a solution based on finding the best destination for each vehicle. The last case, that is very general, allows the optimization model to select possibly different locations for vehicle origin and destination, during each cycle. The different cases are applied to a security patrolling case conducted on the network of University of Maryland at College Park campus and the results are compared.     

How the environmental impact affects the design of logistics networks based on cost minimization

The degree of centralization of the logistics network is one of the important strategic decisions to take. This issue has often been studied but mainly from a cost minimization focus. This research studies the influence of incorporating the environmental impact in logistics network design models, comparing the results with those obtained considering cost minimization only. A fuzzy biobjective optimization model is used to carry out a number of experiments. By weighting the relative importance of the two objectives, the differences with respect to the base cost minimization solution can be ascertained. Our results show that in general more material is moved through warehouses when the environmental impact is considered and more decentralized facilities are opened.     

大城市中小学周边地区交通拥堵问题分析与解决策略

交通拥堵已经成为我国大城市的一种社会问题,它与每一个人都息息相关,如何更好地处理这种问题,使其减少对人们出行的影响,成为值得每一个人思考的问题。针对大中型城市中的交通拥堵其中的一种现象进行深入的剖析,系统介绍交通拥堵的成因,有针对性地提出如何改善中小学周边地区交通拥堵现象的一些观点和做法。