Optimal roll control of an articulated vehicle: theory and model validation

This paper investigates optimal roll control of an experimental articulated vehicle. The test vehicle and the mathematical model used to design the control strategies are presented. The vehicle model is validated against experimental data from the test vehicle in passive configuration. The initial controller design, performed by Sampson (Sampson, D.J.M. and Cebon, D., 2003a, Achievable roll stability of heavy road vehicles. Proc. Instn. Mech. Engrs, Part D, J. Automobile Engineering, 217(4), 269–287), is reviewed and adapted for the experimental vehicle. The effect of not controlling all the axles on the vehicle is investigated and a variable vehicle speed controller is designed by interpolating between constant speed controllers. Substantial reduction in normalized load transfer is achieved for a range of manoeuvres, both in steady-state and transient conditions.     

重大突发公共卫生事件下城市应急医疗物资优化调度研究

针对新型冠状病毒肺炎（新冠肺炎）疫情防控中应急医疗物资调度不尽合理、集配中心中转效率不够高等问题，重新设计了重大突发公共卫生事件下城市应急医疗物资调度与配送体系，并给出了应急医疗物资的分类方法。从医疗物资使用需求和库存估计可使用时间2个维度构建需求点紧急度指标，考虑突发公共卫生事件特征，以加权的需求满足率最大化为主要目标、车辆行驶距离最小化为次要目标，构建应急医疗物资动态分配模型，并通过算例验证了模型的有效性和可行性。结果表明：所构建的模型能够兼顾医疗物资分配的公平和效率，符合突发公共卫生事件中应急医疗物资供给和需求的动态变化特性，确保在物资短时间供给不足的情况下各需求点也能公平获取一定比例的物资；且模型仅要求各需求点上报各种品类医疗物资的使用人数和库存量，同时模型还给出数据缺失时的自动计算办法，可操作性更强；运用紧急度指标对需求满足率最大化目标进行校正，解决了各需求点因需求量差异对公平分配造成的影响，使得应急医疗物资分配更加合理。研究成果结合了新冠肺炎疫情防控中应急医疗物资调度的具体过程，使得分配模型更符合实际需要，可为城市应急医疗物资优化调度提供决策依据。     

Containership scheduling with transit-time-sensitive container shipment demand

This paper examines the optimal containership schedule with transit-time-sensitive demand that is assumed to be a decreasing continuous function of transit time. A mixed-integer nonlinear non-convex optimization model is first formulated to maximize the total profit of a ship route. In view of the problem structure, a branch-and-bound based holistic solution method is developed. It is rigorously demonstrated that this solution method can obtain an ε-optimal solution in a finite number of iterations for general forms of transit-time-sensitive demand. Computational results based on a trans-Pacific liner ship route demonstrate the applicability and efficiency of the solution method.     

基于随机需求的多频次道路货运调度模型及算法

以道路货物运输为研究对象,采用多频次调度方法对随机需求的道路货运调度问题进行研究,给出了基于随机需求的多频次调度模型及求解模型的微粒群算法,同时通过算例验证了该模型的可行性。     

A New Wireless Packet Scheduling Algorithm Based on EDF and Its Application in Multi-bottleneck Networks

Most of current wireless packet scheduling algorithms aim at resource allocation as fairly as possible or maximizing throughput. This paper proposed a new packet scheduling algorithm that aims at satisfying delay requirement and is the improvement of earliest due first (EDF) algorithm in wired networks. The main idea is to classify the packets based on their delay bound, scheduling the most "urgent" class of user and the users that have the best channel condition with higher priority. This algorithm can easily integrate with common buffer management algorithms, when buffer management algorithm cannot accept new arrival packets, try to modify scheduling policy. Packet scheduling algorithms in multiple bottleneck wireless networks were also discussed. A new variable multi-hop factor was defined to estimate the congestion situation (including channel condition) of future hops. Multi-hop factor can be integrated into packet scheduling algorithms as assistant and supplement to improve its performance in multi-bottleneck wireless networks.     

考虑最短距离作业的港口拖轮作业调度优化

为了合理调度拖轮作业,有效提高拖轮的利用率,减少船舶等待时间,针对拖轮作业特点,用多处理器任务调度理论分析了拖轮作业调度问题.在考虑拖轮最短距离作业的前提下,以最小化最大完工时间为优化目标建立了拖轮作业调度模型.采用演化策略算法对拖轮作业调度问题进行优化,提出了一种基于轮盘赌概率分配的编、解码方法,并设计了三点交叉互换的重组算子和个体基因交叉互换的变异算子.算例结果表明:用演化策略算法的优化结果优于仿真结果和粒子群算法的计算结果.采用实数编码时,通过优化算法得到的最大完工时间最小值为356 min,比仿真结果减少了117 min;而采用整数编码时,最大完工时间最小值为369 min,比仿真结果减少了104 min.验证了最短距离作业原则的有效性.     

模拟退火算法在供应链生产调度中的应用

研究一个简单供应链中的生产调度问题,目的是找到一个合理生产排序使得单位时间的成本最小,建立该问题的单目标非线性规划模型。运用模拟退火算法,结合邻域搜索进行求解,最后举例验证算法的有效性。     

CTC条件下铁路客运站股道运用决策支持系统

结合车站自律机、联锁系统、客运站股道运用技术作业及其要求,设计了基于分散自律控制原则的系统模型、功能与体系结构。运用现代排序理论,构建了股道运用实时调整可控排序模型和耦合模型,提出了基于合成分派规则的三步算法与股道运用通用启发式算法,求解股道运用系列决策问题,解决铁路行车及调车作业之间的干扰问题,并开发了CTC条件下铁路客运站股道运用决策支持系统。分析结果表明:合成分派规则的平均优化解明显优于基本分派规则的平均优化解,合成分派规则EDD+FIFO获得的解最优;实时调整时宜直接采用合成分派规则,尤其是规则EDD+FIFO,求解耦合问题时应综合考虑各种分派规则。可见,系统的功能、性能和技术指标均能满足股道运用智能编制和实时调整的现实需求。     

基于禁忌搜索算法求解车间作业调度问题

考虑了一个有限经济批量和交货时间计划的车间作业调度问题.在这条供应链上包含两个大的部门(生产加工部门和组装部门);多种工件首先需要经过加工部门多个车间的加工,然后送到组装部门组装成为成品;目标是如何组织安排各种工件在各个车间的各个机器上的加工顺序和加工开始时间使得此供应链上单位时间内的运输费,组装费和存储费用最小.此问题是一个NP难问题,为了找到满意解,本文利用禁忌搜索算法来解决此问题,并用MATLAB软件编写求解此问题的算法程序.从算法的数值试验过程来看,禁忌搜索的效率和效果均令人满意.     

基于随机需求的城市公交车辆调度问题的研究

在公交车辆调度问题上,考虑到公交调度中客流需求的不确定因素,引入随机需求调度模型及其相关概念,然后对优化模型进行实例求解,结果证明该模型是可行的。