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

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

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

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

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.     

编组站进路调度优化算法

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

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.     

机器人生产线在船舶智能制造中的应用研究

智能制造是“中国制造2025”的主攻方向。本文先浅谈了智能船厂,并结合国内首个智能船厂试点对智能船厂的初级发展建设等进行初步探索,主要对船舶智能制造机器人生产线应用进行梳理分析,如工艺流程及布置、生产模式改进、提质增效和人员减配等。     

����ʽ����Ż��㷨Ч�ʵĸĽ��о�

以车辆调度问题为实例引出一种新的组合优化算法，并与原有的方法进行比较，说明新方法可以有效地抑制组合爆炸，极大地提高算法寻优效率.然后，本文用数学方法来证明该新方法再寻优上的正确性，最后根据两种不同算法编写各自对应的程序，用实际运行的结果来验证新算法带来的效率的提高.     

�ɱ���ʻʱ��Ķ�̬����·�������

针对城市建设发展中道路交通阻塞问题，研究了两种类型的车辆路径与调度问题，给出了相应的求解框架，并构建了一个具有可变行驶时间的动态车辆路径与调度模型，涉及了车辆的固定费用、运营成本和早到或者延期的惩罚费用等多种费用。该问题是一个NP-hard问题，采用遗传算法确定最优解，并给出了车辆路径与调度方案的表示方式。最后设计了一个交通网络，通过动态交通仿真更新行驶时间，研究了多个不同时间段道路阻塞情况下算法的性能。结果显示比不考虑实时行驶时间信息的模型，该模型能够得到更低的总成本。     

基于NSGA-Ⅱ的接运公交线路与时刻表协调优化方法

在公交规划研究中,常将公交网络规划问题分解为公交路线设计和行车时刻表设计,并尝试运用非传统优化方法解决,但对于多种公交模式换乘背景下的公交线路与时刻表协调优化问题的研究较为缺乏.文中以直接服务于轨道交通的接运公交为研究对象,在实现接运公交与轨道交通的有效衔接条件下,构建接运公交的路线选择与时刻表协调优化模型,并设计基于非支配排序遗传算法（NSGA-Ⅱ）的多目标优化算法对模型进行求解,实现接运公交路线与时刻表的协同编制,并通过实例分析检验模型.