旅客列车发车时间域优化研究

在大量问卷调查的基础上,根据旅客对不同到发时间域选择的偏好,确定了各发车时间域旅客出行的方便系数。利用目标规划原理,以旅客出行方便程度最大为目标,构造了三级控制策略。在考虑客运站到发线能力,以及旅客列车必须在合理的时间域发车等约束条件下,建立旅客列车发车时间域的目标规划模型。利用该目标规划模型,可根据旅客列车实际运行的需要,通过变化控制策略和赋予各目标的优先因子,实现对列车发车时间域的优化。根据模型约束目标正负偏差变量,计算了各级控制策略实现程度系数。最后,以太原站始发旅客列车为实例,利用变换方案对该目标规划模型的运用进行了分析,并将目标规划优化结果和传统确定发车时间域的结果以及指派模型优化结果进行比较分析。     

带有改编能力限制的编组计划优化模型及算法

本文用一个非线性０－１规模模型，来描述带有改编能力限制的技术直达列车编组计划问题。能力约束增加了该问题的计算难度。这是一个ＮＰＣ问题。因此，获得一个全局最优解是困难的。本文用模拟退火算法解该问题。该算法可以以很高的概率获得全局最优解。文末列出了两个数值例子，并分别同了考虑和不考虑改编能车约束两种情况下的计算结果。     

Optimality Conditions for Generalized Static Programming with Convexity

The definitions of generalized pseudoconvex,generalized quasiconvex and its strictly generalized convexity were presented for the static programming at locally star-shaped set using the concept of right-upper derivative and the concept of sublinear. The sufficient and necessary conditions of the static programming were derived in terms of a generalized Lemmain this paper. The results obtained are useful for the further study on the duality of static programming and cover many already known conditions.     

用动态规划方法优化设计船舶车辆甲板结构

基于规范的车辆甲板结构优化设计在数学上是一个较大的非线性规划问题，而且为了满足实际需要，其中一些变量只能离散变化。本文将该问题处理为三阶段决策问题，因而能运用动态规划方法有效地求解。通过一个实例详细说明求解过程，从中看出应用动态规划方法解决基于规范的船舶结构优化设计问题的特色。     

Managing transportation during highway reconstruction: A recommended process

Major highway reconstruction can cause significant disruptions to existing travel patterns and economic activity. Reducing these impacts on travelers, shippers, businesses and residents requires that innovative and effective transportation management actions be developed and implemented. This paper reports the major findings and recommendations of a research study on managing transportation during highway, reconstruction. The primary objectives of the study were

混合编程在隧道地层变形时空统一预测中的应用

通过Java与MATLAB的混合编程,可以充分发挥它们各自的优势,使计算效率与开发效率得到统一。通过具体混合编程实例以及在盾构隧道地层变形时空统一预测中的运用,结果表明此混合编程技术功能强大,实现简单。     

城市轨道交通网络末班车衔接优化模型

城市轨道交通网络运营结束阶段,末班车在路网换乘站内能否实现合理地衔接,最能体现出以人为本的客运服务以及科学高效的运营秩序。根据城市轨道交通网络特点,提出了城市轨道交通网络末班车衔接编制的原则。从站间列车运行时间约束、线间列车换乘衔接、末班列车线间衔接目标等角度,研究了轨道交通网络末班车衔接优化量化方法,建立了网络末班列车衔接优化模型。以北京轨道交通城区1号线、2号线和5号线局部路网为实例,编制了网络末班列车的优化时刻表。算例结果表明,模型及其优化算法可行,对路网运输计划编制工作有较强的实用性。     

土石方调配问题双层规划模型及算法研究

研究目的:针对铁路土石方工程中较少考虑对生态环境影响的现状,研究如何构建合理的土石方调配问题模型,实现铁路土石方工程与生态环境的有效协调,减少对生态环境的影响的同时,从而实现土石方工程系统最优的目标。研究结论:根据土石方工程具体特点,系统地描述土石方调配问题,在此基础上兼顾政府监管部门与施工企业双方不同的利益目标,建立土石方调配问题双层规划模型。在双层规划模型中,上层模型为土石方工程系统最优模型,下层模型为土石方调配费用最低模型。计算结果表明:土石方调配问题双层规划模型在减少对保护生态环境影响同时,降低工程建设成本。     

Storage space allocation in container terminals

Container terminals are essential intermodal interfaces in the global transportation network. Efficient container handling at terminals is important in reducing transportation costs and keeping shipping schedules. In this paper, we study the storage space allocation problem in the storage yards of terminals. This problem is related to all the resources in terminal operations, including quay cranes, yard cranes, storage space, and internal trucks. We solve the problem using a rolling-horizon approach. For each planning horizon, the problem is decomposed into two levels and each level is formulated as a mathematical programming model. At the first level, the total number of containers to be placed in each storage block in each time period of the planning horizon is set to balance two types of workloads among blocks. The second level determines the number of containers associated with each vessel that constitutes the total number of containers in each block in each period, in order to minimize the total distance to transport the containers between their storage blocks and the vessel berthing locations. Numerical runs show that with short computation time the method significantly reduces the workload imbalance in the yard, avoiding possible bottlenecks in terminal operations.     

二层线性规划问题

罚函数方法是数学规划中一种常见且有效的求解方法。用罚函数原理,把二层线性规划（BLP）下层问题的对偶间隙作为惩罚项,将BLP转化为带罚函数子项的有限个线性规划问题。由于BLP的全局最优解可在约束域S的极点上找到,利用线性规划对偶理论,给出了一种求解该二层线性规划的罚函数算法。