A simple greedy algorithm for a class of shuttle transportation problems

Greedy algorithms for combinatorial optimization problems are typically direct and efficient, but hard to prove optimality. The paper presents a special class of transportation problems where a supplier sends goods to a set of customers, returning to the source after each delivery. We show that these problems with different objective functions share a common structural property, and therefore a simple but powerful generic greedy algorithm yields optimal solutions for all of them.     

沿海港口集装箱空箱调运策略优化模型

我国沿海港口进出口箱分布非常不均衡,由此产生了集装箱空箱调运现象,合理的空箱调运策略能够有效地降低航运成本。本文研究了沿海港口间的空箱调运问题。在传统确定目的港策略的基础上,提出了一种新的空箱调运策略,不确定目的港策略。针对两种不同调运策略分别建立了以总调运费用最小为目标的规划模型。并以中国沿海港口空箱调运为例,运用遗传算法,在不同的空箱供需情况下,对两种调运策略费用进行了优化求解。结果表明,供需平衡模式下,固定目的港策略略有优势;在供需不平衡模式中,不确定目的港策略优势更加明显。此研究能够为港口间空箱调运提供辅助决策。     

常规公交线网运力配置双层规划模型

双层规划研究的是两个各具有目标函数的决策者之间按有序的和非合作方式进行的相互作用,上层决策者优先作出决策,下层决策者在上层决策信息下按自己的利益作出反应,由于一方的行为影响另一方的策略选择和目标的实现,并且任何一方又不能完全控制另一方的选择行为,因此上层决策者要根据下层的反应做出符合自身利益的最终决策。而公交车辆配置正符合双层规划模型的思想,所以本论文采用双层规划模型来描述车辆配置与客流量之间的相互作用,从而优化公交线网的车辆配置。     

Numerical Simulation of Mixing Characteristics and Energy Consumption in Vane Extruders with Different Structure Parameters

Numerical simulation was performed with the Computational Fluid Dynamics (CFD) analysis software POLYFLOW (ANSYS, Inc., USA) to investigate the melt transportation energy consumption and mixing characteristics of vane extruders. By modifying related parameters in the numerical simulation models, the effects of vane arrangement and eccentricity between rotor and stator were studied. The results showed that for different vane arrangements, the vane unit with four vanes distributed uniformly had the lowest energy consumption per unit melt transported in one cycle and the best mixing characteristics. With the increase of eccentricity, the average rotational power transmitted by the vanes to the melt increased, and the rate of increase increased. The same tendency occurred for the maximum shear rate and stretching rate experienced by the particles in the vane extruder. This suggested that the mixing performance of the vane unit increased significantly with the increase of eccentricity.     

基于线路“异质性”假设的轴辐式公共交通网络优化研究

特大城市公共交通局部静态拥堵问题日益成为制约公共交通网络运行效率提高的关键。针对这一问题改变线路“同质性”假设,在线路“异质性”假设的基础上,提出了将轴辐式网络设计运用到公共交通领域中来,综合考虑居民采用公共交通方式出行的单位运输可变成本、不变成本、枢纽换乘成本等要素,将枢纽间大型客车干线运输所带来的规模经济效应进行量化,构建了基于单分配、多枢纽、混合式网络结构特征的轴辐式公共交通网络优化模型,旨在多重约束下通过枢纽布局降低网络运输成本,提高公共交通网络站点的可达性。最后根据模拟退火算法对模型进行求解,并通过算例分析与讨论的方式验证了模型的有效性。     

Electronic transport of bilayer graphene with asymmetry line defects

In this paper,we study the quantum properties of a bilayer graphene with(asymmetry) line defects.The localized states are found around the line defects.Thus,the line defects on one certain layer of the bilayer graphene can lead to an electric transport channel.By adding a bias potential along the direction of the line defects,we calculate the electric conductivity of bilayer graphene with line defects using the Landauer-Biittiker theory,and show that the channel affects the electric conductivity remarkably by comparing the results with those in a perfect bilayer graphene.This one-dimensional line electric channel has the potential to be applied in nanotechnology engineering.     

带有运输且加工具有灵活性的无等待流水作业排序问题

研究一类带有运输且加工具有灵活性的两阶段无等待流水作业排序问题, 其中每阶段只有一台机器, 每个工件有两道工序需要依次在两台机器上加工, 工件在两台机器上的加工及两道工序之间不允许等待. 给出两种近似算法, 并分别分析其最坏情况界. 第一种算法是排列排序, 证明了最坏情况界不超过5/2; 第二种算法将工件按照两道工序加工时间之和的递增顺序排序, 证明其最坏情况界不超过2. 最后, 通过数值模拟比较算法的性能. 对问题中各参数取不同值的情况, 分别生成若干个实例, 用算法得到的解与最优解的下界作比值, 通过分析这些比值的最大值、最小值和平均值来比较上述两个算法的性能.     

面向超导钉扎磁浮的液氮液位检测方法研究现状

高温超导钉扎磁浮制式以悬浮导向一体化、自稳定、无需控制等优势得到了越来越多的关注.与其他磁浮制式不同,高温超导钉扎磁浮制式采用块状高温超导材料作为车载悬浮体,需要低温液体液氮作为悬浮单元的制冷剂,冷却方式为浴冷,因此实时监测液氮液面,保证液面平稳是未来超导钉扎磁浮车运行维护的首要需求.本文从车载高温超导YBaCuO块材所需的液氮环境及其配套的液氮容器功能和结构出发,结合我们近期的基于卡尔曼滤波(Kalman filtering,KF)滤波算法的铂电阻传感器液氮液位计研究工作,对6种低温液位检测方法的基础原理、特征及检测精度的对比分析,总结示出包括铂电阻阵列方式在内的3种适用于超导钉扎磁浮列车在线检测系统的液氮液位检测方法,用于推进我国2021年1月13日正式启用的高温超导钉扎高速磁浮工程化样车应用发展.     

Analysis of identification methods of key nodes in transportation network

The identification of key nodes plays an important role in improving the robustness of the transportation network. For different types of transportation networks, the effect of the same identification method may be different. It is of practical significance to study the key nodes identification methods corresponding to various types of transportation networks. Based on the knowledge of complex networks, the metro networks and the bus networks are selected as the objects, and the key nodes are identified by the node degree identification method, the neighbor node degree identification method, the weighted k-shell degree neighborhood identification method (KSD), the degree k-shell identification method (DKS), and the degree k-shell neighborhood identification method (DKSN). Take the network efficiency and the largest connected subgraph as the effective indicators. The results show that the KSD identification method that comprehensively considers the elements has the best recognition effect and has certain practical significance.     

Smoothing method in multi-criteria transportation network equilibrium problem

ABSTRACT

This paper is aimed to study a single-product multi-criteria transportation network with capacity constraints. We use a vector version of the Heaviside Step function to construct an optimization problem, the solutions of which form the set of equilibria of our model. We propose two methods to solve this problem. The first one is based on a modified Frank-Wolfe gradient algorithm, and the second one is based on smoothing the objective function, the optimal solutions of which can be obtained by optimization tools. Numerical examples are also given to illustrate our approaches.