江水北调优化调度模型的研究

从江水北调水资源系统的实际情况出发,建立了确定型的优化调度数学模型,提出一种灵活性较强又能较好地解决实际问题的求解方法,即逐次优化算法(POA)的目标规划,同时编制了计算软件,并给出有益的结论。     

The time-dependent pollution-routing problem

The Time-Dependent Pollution-Routing Problem (TDPRP) consists of routing a fleet of vehicles in order to serve a set of customers and determining the speeds on each leg of the routes. The cost function includes emissions and driver costs, taking into account traffic congestion which, at peak periods, significantly restricts vehicle speeds and increases emissions. We describe an integer linear programming formulation of the TDPRP and provide illustrative examples to motivate the problem and give insights about the tradeoffs it involves. We also provide an analytical characterization of the optimal solutions for a single-arc version of the problem, identifying conditions under which it is optimal to wait idly at certain locations in order to avoid congestion and to reduce the cost of emissions. Building on these analytical results we describe a novel departure time and speed optimization algorithm for the cases when the route is fixed. Finally, using benchmark instances, we present results on the computational performance of the proposed formulation and on the speed optimization procedure.     

Nonlinear programming methods based on closed-form expressions for optimal train control

This paper proposes a novel approach to solve the complex optimal train control problems that so far cannot be perfectly tackled by the existing methods, including the optimal control of a fleet of interacting trains, and the optimal train control involving scheduling. By dividing the track into subsections with constant speed limit and constant gradient, and assuming the train’s running resistance to be a quadratic function of speed, two different methods are proposed to solve the problems of interest. The first method assumes an operation sequence of maximum traction – speedholding – coasting – maximum braking on each subsection of the track. To maintain the mathematical tractability, the maximum tractive and maximum braking functions are restricted to be decreasing and piecewise-quadratic, based on which the terminal speed, travel distance and energy consumption of each operation can be calculated in a closed-form, given the initial speed and time duration of that operation. With these closed-form expressions, the optimal train control problem is formulated and solved as a nonlinear programming problem. To allow more flexible forms of maximum tractive and maximum braking forces, the second method applies a constant force on each subsection. Performance of these two methods is compared through a case study of the classic single-train control on a single journey. The proposed methods are further utilised to formulate more complex optimal train control problems, including scheduling a subway line while taking train control into account, and simultaneously optimising the control of a leader-follower train pair under fixed- and moving-block signalling systems.     

Optimizing multi-agent based urban traffic signal control system

Agent-based approach is a popular tool for modelling and developing large-scale distributed systems such as urban traffic control system with dynamic traffic flows. This study proposes a multi-agent-based approach to optimize urban traffic network signal control, which utilizes a mathematical programming method to optimize the signal timing plans at intersections. To improve the overall network efficiency, we develop an online agent-based signal coordination scheme, underpinned by the communication among different intersection control agents. In addition, the initial coordination scheme that pre-adjusts the offsets between the intersections is developed based on the historical demand information. Comparison and sensitivity analysis are conducted to evaluate the performance of the proposed method on a customized traffic simulation platform using MATLAB and VISSIM. Simulation results indicate that the proposed method can effectively avoid network oversaturation and thus reduces average travel delay and improves average vehicle speed, as compared to rule-based multi-agent signal control methods.     

加强目标责任成本的管理理念

该文介绍了目标责任成本管理的控制过程、具体办法,以及成本管理的内容、作用。     

战略装车点选址模型研究

分析了建立区域战略装车点的政策性原则和关联因素,并根据铁路运输生产实际模拟了在供需均衡条件下选站建点系统架构,构建战略装车点多点选址多类变量混合0-1非线性规划模型(MSLSLP)。模型以社会总成本最小化为出发点,协同考虑决策者和客户双方利益,将选站建点的改扩建费用、可变费用和代表客户利益的运输成本共同纳入目标体系。将建立战略装车点后的运输特点要求与相关选址模型的共性约束相结合构造约束条件,使其更具针对性。最后,以相当规模数值算例验证了模型的有效性和可行性。     

The impacts of strait and canal blockages on the transportation costs of the Chinese fleet in the shipping network

ABSTRACT

Straits and canals have always served as key nodes in shipping networks. The blockage of a strait or canal will lead to ship deviations and increased transportation costs. To measure this impact on the Chinese fleet, our study develops a mathematical model that is based on a programming formulation. Each strait or canal is assumed to be blocked in turn, and the increased transportation costs for the Chinese fleet in different scenarios are calculated and compared using the proposed programming formulation in order to measure the impact of the blocked strait or canal on the Chinese fleet. Larger increases in transportation costs have greater impacts on the fleet. The results show that a blockage of the Strait of Hormuz would have the greatest impact of all straits and canals; it would cause the Chinese fleet to lose a portion of its import and export market, and such a blockage cannot be addressed through ship deviations. Based upon increased transportation costs, the four straits or canals that would have the greatest impact if blocked are the Mandeb Strait, the Suez Canal, the Sunda Strait and the English Channel.     

高速无人艇动目标避碰规划方法研究

提出基于蚁群算法(ACA)实现高速无人艇对运动目标避碰规划的方法,该方法把避碰、路径最短和航迹跟踪等约束条件映射为目标函数,使得路径搜索过程快速高效.计算机仿真表明:该方法使高速无人艇能够较好的实现对运动目标的避碰;由此说明此项研究具有一定的可行性和有效性.     

基于多编组的列车满载率均衡化方法研究

针对多编组均衡发车导致的大小编组列车利用率不均的问题，本文构建了轨道交通多编组列车开行方案双层规划模型.上层模型以大小编组发车频率为决策变量，乘客出行费用和企业运营成本最小为目标；下层模型以列车编组和发车间隔为决策变量，大小编组列车间的满载率均衡程度最大为目标，并设计嵌套遗传算法求解.算例分析表明：当列车编组和发车频率一定时，大小编组列车均衡发车时平均满载率相差 50%，非均衡发车时两者仅相差 0.8%，这说明非均衡发车模式可以有效提高列车满载率均衡性；大小编组列车均衡发车时，列车编组辆数不宜相差过大，非均衡发车时可以通过调整发车间隔的方法提高列车满载率的时空均衡性.     

基于ITS的公共交通换乘等待时间最短调度问题研究

为使公共交通的换乘时间实现最佳衔接,先进的公共交通系统的高效率和优势得以体现,在对各国研究现状分析的基础上,研究了ITS实时提供公共交通信息的条件下,公共交通换乘等待时间最短调度问题。为了对公共交通换乘总等待时间最短目标下的公共汽车发车时刻表确定方法进行分析,应用运筹学理论,分别针对一个换乘点和多个换乘点的情况建立了线性规划模型,并用一个换乘点的算例验证了模型的可行性和有效性。结果表明：该方法能最大限度地减少乘客换乘总等待时间,尤其是对于发车间隔较大的公共交通方式间换乘的时间节约效果更为明显。