改进的自适应遗传算法及其在作业车间调度中的应用

针对自适应遗传算法在复杂问题应用中前期收敛速度缓慢和容易陷入局部最优的不足，引入了一种新的调节交叉概率和变异概率的方法，并提出了一种新的交叉方式，该算法很好地增强了自适应遗传算法的全局搜索能力，提高了收敛速度．通过比较几个优化实例，验证了本文算法的有效性．     

有向图理论在工序排序决策中的应用

为了建立有效的工序排序决策模型，运用有向图理论，用有向图的节点描述加工特征，用有向边描述加工特征之间的基准关系，从而有向图上经过所有节点且没有环路的有向路径即为可行的工艺路线．为了便于计算机处理，将有向图用矩阵表示，通过有向图矩阵的乘法运算搜索最长的有向路径．如果最长的有向路径没有包括所有节点，可以根据基准关系，将最长有向路径外的节点插入，得到最终的工序排序结果．     

OFDMA多跳中继蜂窝网络的干扰协调策略

多跳中继蜂窝网络由于具有吞吐率高和覆盖性强的优点受到广泛关注。但是,中继站的引入改变了传统蜂窝网络的频率规划策略,因此如何在策略设计中对中继链路进行高效的频率资源分配成为极具挑战的问题;其次,小区频率复用越紧密,同频干扰越严重,对系统的整体性能产生影响。本文基于IEEE 802.16j/m标准,以下行链路的无线资源管理为基本手段,设计合理的资源复用策略及其对应的多跳中继下行子帧结构,在保证网络的资源利用率的同时,降低干扰给相邻小区边缘用户带来的影响;再将高效的比例公平调度算法扩展到多跳中继蜂窝网络,旨在兼顾系统整体性能和用户公平性。仿真和分析结果表明,干扰协调与资源调度策略相结合能显著提升系统吞吐率并改善用户公平性。     

Improved Genetic Algorithm for Job-Shop Scheduling

Introduction Job shopschedulingproblem(JSP)isoneofthe well knownhardestcombinatorialoptimizationprob lems,andmanysolutionsbasedongeneticalgorithms(GAs)havebeenproposedbymanyresearchersso far[13].SincethedemonstrationofapplicationofGA toschedulingproblemsb…     

一种具有模糊费用系数的VSP的修正C-W节约算法

将传统的确定性车辆调度问题扩展为具有模糊特征的模糊车辆调度问题．在对具有模糊费用系数的车辆调度问题进行简单描述的基础上，构建了模糊车辆调度的数学模型；通过Gaufmann-Gupta模糊数排序方法与传统车辆调度问题的C—W节约算法的有效结合，提出了解决该问题的一种改进C—W节约算法．最后，给出了一个算例．     

客运专线动车组运用计划的计算机编制

根据动车组运用规则，建立了动车组运用计划整数规划模型．为降低求解的复杂性，将动车组运用计划编制问题转化为交路段生成和基于交路段的交路生成两个问题分步求解．用多起点搜索和交路段互换的方法，使求解结果在有效性和均衡性上得以优化．实际编制实验表明了模型和算法的有效性．     

An optimization model for integrated planning of railway traffic and network maintenance

Railway transportation systems are important for society and have many challenging and important planning problems. Train services as well as maintenance of a railway network need to be scheduled efficiently, but have mostly been treated as two separate planning problems. Since these activities are mutually exclusive they must be coordinated and should ideally be planned together. In this paper we present a mixed integer programming model for solving an integrated railway traffic and network maintenance problem. The aim is to find a long term tactical plan that optimally schedules train free windows sufficient for a given volume of regular maintenance together with the wanted train traffic. A spatial and temporal aggregation is used for controlling the available network capacity. The properties of the proposed model are analyzed and computational experiments on various synthetic problem instances are reported. Model extensions and possible modifications are discussed as well as future research directions.     

求解区域公交车辆调度问题的蚁群算法研究

本文待区域公交车辆调度问题为"部分班次被一辆车完成"的集合划分问题,考虑车场容量、允许车辆加油及每辆车任务可靠度不低于某值等现实因素,建立以车辆数、车辆等待和空驶时间最小为目标的混合整数规划模型.根据问题特征,设计求解该问题的蚁群算法,在构建人工蚂蚁随机游走的图基础上定义解构建规则、信息素和启发式信息等.最后,通过一个...     

Vehicle rollover avoidance by application of gain-scheduled LQR controllers using state observers

Many researches have been conducted in the area of control applied to vehicle dynamics, aiming at reducing the possibility of the occurrence of the type of accident known as rollover. In this research, based on a common nonlinear model and its linearisation, a method for properly selecting matrices for solving the Riccati equation considering different speeds was proposed. The method showed in which ways speed really influences the choice of controller gains. By developing the dynamic equations for the yaw- and roll-coupled motions and modelling of controllers and state observers, it is possible to compare the efficacy of this control strategy using both linear and nonlinear simulations using Matlab. Significant results were obtained regarding the reduction of the rollover coefficient for a double-lane change manoeuvre at different speeds, thus indicating advantages of using this controller in practical cases.     

编组站进路调度优化算法

分析编组站作业进路选排问题的本质,以各任务的延误时间加权值总和最小为最优目标,以任务的前后工序选择路径为动态约束,建立编组站作业进路调度数学模型,采用遗传算法求解。编码采用定长染色体,长度为任务的工序数,每个工序采用2段制,编码中的顺序唯一地确定了每工序对指定进路占用的起讫时间和指标递推,设计基于优先规则的编码算法步骤。为保证解的可行性,将编码合法化,对工序进行拓扑排序。递推计算工序开始时间和结束时间,进而计算编码的目标值,并将其转化为适应值。采用轮盘赌与最优性相结合的方法进行选择,设计基于位置成组移位的杂交算子和随机交换的变异算子。以某编组站为例进行模拟计算,结果证明该算法满足编组站进路调度工作的要求。