旅客列车到发时间域的优化模型与算法

旅客列车的开行方案必须体现以旅客为本,服务旅客、方便旅客的原则,而旅客出行的方便与否,主要体现在旅客列车出发与到达时刻是否合理.因此,本文首先定义了旅客列车合理始发、合理到达时间范围的概念,并研究该范围内不同时段旅客出行的方便度,绘制方便度曲线.然后建立了以最大程度方便旅客出行为目标的指派模型,实现了求解该模型的蚁群算法.最后以成都站为实例,对各始发列车的发车时间域进行优化.通过验证,本文模型和算法具有可行性.     

Simple adaptive filtering scheme to improve measurement accuracy of gyroscope on angular motion base

The objective of this work is to improve the measurement accuracy of a gyroscope on a angular motion base with a simple adaptive filter scheme. Two main topics are highlighted in this work. The first topic is to show building a dual-process model employed for the conventional Kalman filter. The second topic is to show developing a modified noise adaptive algorithm when measurement noise and process noise are unknown. The experimental results are presented to show that the simple adaptive filtering scheme outperforms the other conventional scheme in this paper in terms of noise reduction.     

运输网络中有流量需求的转运结点最大流分配算法

运输网络中有流量需求的转运结点不遵从流量守恒条件,也不能按源、汇及中间结点归类．为解决这类转运结点的最大流分配问题,将这类转运结点分为汇结点和中间结点．根据Ford—Fulkerson算法寻找增流链的原理,提出了寻找这类转运结点增流链的方法、调整量计算公式和流量调整方法,形成了有流量需求的转运结点最大流分配算法．     

基于公交IC卡数据信息的客流预测方法研究

根据大连市公交IC卡的历史数据绘制公交线路客流曲线,采用有序聚类Fisher算法划分公交峰值区间,在具有典型特征的峰值区间内进行有针对性的公交客流调查,可得到实际客流数据样本。通过将3EIC卡客流数据与随车客流调查数据相结合,建立不同峰值条件下预测客流的回归方程,可实现对不同峰值区间内总体客流量的预测。     

遗传-模拟退火算法在数据库查询优化中的应用

将遗传算法与模拟退火算法相结合,导出了一种基于遗传0模拟退火算法的多连接查询优化算法．该算法将查询计划的一棵语法树看作是一个染色体,对于语法树上的连接操作后序遍历生成一个编码．在所有编码构成的种群进行完选择、交叉、变异操作之后,在其中引入模拟退火机制,从而进一步调整优化了种群,保持了群体的多样性,减少了用户查询的响应时间．     

Constrained submap algorithm for simultaneous localization and mapping

When solving the problem of simultaneous localization and mapping (SLAM), a standard extended Kalman filter (EKF) is subject to linearization errors and causes optimistic estimation. This paper proposes a submap algorithm, which builds a weighted least squares (WLS) constraint between two adjacent submaps according to the different estimations of the common features and the relationship between the vehicle poses in the corresponding submaps. By establishing the constraint equation after loop closing, re-linearization is implemented and each submap’s reference frame tends to its equilibrium position quickly. Experimental results demonstrate that the algorithm could get a globally consistent map and linearization errors are limited in local regions.     

Voxelizating 3D mesh models with gray levels

A novel algorithm to voxelize 3D mesh models with gray levels is presented in this paper. The key innovation of our method is to decide the gray level of a voxel according to the total area of all surfaces contained by it. During the preprocessing stage, a set of voxels in the extended bounding box of each triangle is established. Then we travel each triangle and compute the areas between it and its set of voxels one by one. Finally, each voxel is arranged a discrete gray level from 0 to 255. Experiments show that our algorithm gets a comparatively perfect result compared with the prevenient ones and approaches the original models in a more accurate way.     

新建交通小区配套道路网络设计模型与算法

研究城市发展过程中新建交通小区的配套道路网络设计问题,提出将新建交通小区与现有路网科学合理连接起来的方法。首先用双层规划法建立该问题优化模型,该模型在考虑交通用户出行行为的情况下,可以确定最优的新建路段选址方案及通行能力设计方案;然后基于粒子群优化技术,设计一个启发式求解算法。最后用一个简单的网络例子验证并分析模型与算法的有效性。     

基于蚁群算法的铁路空车调整优化模型设计

针对铁路空车调整问题,采用蚁群算法解决此问题,建立以空车走行公里数最小为目标的优化模型,并给出求解算法。算例分析表明模型的正确性和算法的合理性,将蚁群算法的时间复杂度与其他一些解决空车调整问题的算法的时间复杂度进行比较,充分体现蚁群算法解决大规模路网空车调整问题的优越性。     

基于遗传算法的最短路径问题及其MATLAB实现

前言 在现实生活中,我们经常遇到最短路问题,例如寻找两点之间总长度最短或者费用最低的路径.在运输,物流,设施选址以及人员调度问题中,最短路径是很常见的问题.解决最短路问题的方法有很多,例如迪杰斯特拉算法、福特算法.在这里我们介绍基于遗传算法的最短路径问题的解决方案.