混沌微粒群算法在离散型生产调度中的应用

本文基于离散型生产调度问题的定义、约束条件,建立了相应的数学模型,针对微粒群算法后期容易陷入局部最优解且收敛速度慢的特点,提出了混沌的微粒群算法.详细介绍了混沌微粒群算法在离散型生产调度的优化流程,并将该算法用于实际项目,进行优化求解,与基本的微粒群算法对比得出更好的结果,验证了混沌微粒群算法的优越性.     

城市轨道交通与驻站常规公交衔接调度优化研究

针对目前城市轨道交通与常规公交衔接难问题,本文从运营成本费用与出行者的出行费用最小化出发,对驻站常规公交协调发车间隔进行优化,建立城市轨道交通与驻站常规公交系统之间的衔接调度组合优化数学模型,并设计遗传模拟退火算法对该模型进行求解,通过多次仿真运算,结果分析表明该模型及算法的有效性和实用性。     

重载列车智能化操控系统车地实时通信方案研究与实现

为提高重载列车调度和运行的自动化水平,提高线路运输能力,基于朔黄线神华机车进行重载列车智能化操控系统和地面调度优化系统的车地实时通信方案研究,包括车地通信的接口安全性、车地通信机制和内容以及重载列车智能化操控系统对地面调度信息的处理,通过LTE-R 4G网络实现车地数据的实时安全交互,实现朔黄线车地设备报文实时自动交互功能,进一步提高朔黄线重载列车运行的准时性和节能性。     

基于多代理机制的车间作业调度算法动态混合生成策略

针对根据具体问题设计调度算法很难适应变化的生产作业调度问题,本文提出了基于多代理机制的车间作业调度算法动态混合生成策略,该策略根据具体的生产任务,判断生产类型,继而根据问题动态生成算法,对问题进行计算,形成调度序列,使得生产调度算法能够更好地适应动态变化的车间生产环境.通过仿真实验,验证了本系统的有效性.     

Cranes scheduling in frame bridges based automated container terminals

This paper investigates crane scheduling problems for a new type of automated container terminal system, which is based on multi-storey frame bridges. For the new design concept, this paper studies how to schedule two types of cranes, i.e., quay cranes and bridge cranes that transfer containers between different storeys. The schedules of these two types of cranes impact the operation efficiency of the terminal system. Mathematical models are proposed for the two scheduling problems. Meta-heuristics are developed to solve them. Numerical experiments are conducted to validate the effectiveness of the proposed models and the efficiency of the proposed solution method.     

Prospects for computer aided railway scheduling: perspectives from users and parallels from mass transit

Railway scheduling faces new challenges as competition and, in many parts of the world, privatisation require ever better results, both in terms of minimising the resources used and maximising the performance achieved by those resources. It is therefore surprising that in practice railway scheduling tasks appear to be performed largely without the use of optimizing models. This paper takes two different perspectives, a case study of user needs from the UK railway industry and a comparative analysis with mass transit scheduling systems, to consider why this might be and assesses what the future prospects are for computer aided railway scheduling.

A number of conclusions are drawn: that optimization models need to be integrated with software packages that meet schedulers' data management needs; that researchers need to work with commercial developers to achieve this integration; that there needs to be an emphasis on extending models to cover more real‐life circumstances; and that solutions with international applicability should be sought.     

Single track line capacity model

The objective of the research described in this paper was to develop a model for computation of an ultimate capacity of a single track line and to provide a sensitivity analysis of this capacity to the parameters which influence it. The model is based in a concept of mathematical expectation of capacity and can be applied under saturation conditions i.e. a constant demand for service. It can serve for planning purposes, computation of single track line capacity on the base of which estimations are possible concerning a single track line performance under given conditions, as well as commercial time‐tables planning, decisions about a partial or complete construction of the second parallel track along the line in service, intermediate stations locations planning and the necessary facilities along the line under construction.

In the sensitivity analysis, the model allows a change of parameters upon which the capacity depends. These are: the length of the line segment which is considered to be bottleneck for calculation of capacity, traffic distributions per directions, train mix, train velocities and train spacing rules applied by the dispatching service when regulating the traffic on a line.     

多线路公交行车计划优化研究

本文主要讨论多线路公交行车计划优化问题,通过引进逆差函数理论对其车辆进行多个场站间的协调调度,以达到各线路资源优化配置的目的。在具体研究中,首先基于给定的行车计划,应用逆差函数理论绘制出各场站的逆差函数图,再通过插入空驶车次（URDHC）与调整发车时间（SDT）的方法缩减车队总规模,进而编制出一套协同联动的优化行车计划。     

公共自行车系统站间调度优化研究

国内多个城市开始推行公共自行车,但都存在借车难及还车难的问题,关键在于站点配车数不合理、站间调度不及时.运用运筹学中货郎担问题动态规划的解题思路,分两步求解站间调度路径:先收集自行车;再发放自行车,综合两步得到最优调度路径.通过建立简单数学模型并求解,证明货郎担问题解题思路可以用于解决公共自行车系统自行车调度优化.提供...     

TTCAN调度算法及其在汽车控制系统中的应用

TTCAN协议是一种新的基于时间触发机制的CAN高层协议。针对周期性信号的特点,提出了基于平均数目分析的静态调度算法;针对非周期信号的随机性,为了避免信号的死锁提出了基于信号截止期的优先级提升动态调度算法。最后以汽车自动控制系统为背景进行了调度分析,与IEC／ISA相比既满足了信号的实时传输,又提高了网络资源的利用率。