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

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

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

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

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.     

带有模糊参数的运输期望值模型

基于可信性理论,将提出一类带有模糊参数的运输期望值模型.然后,讨论模糊运输期望值模型的基本性质.最后,给出一个数值例子来表明所设计模型的实用性.     

An adaptive large neighborhood search heuristic for the Pollution-Routing Problem

The Pollution-Routing Problem (PRP) is a recently introduced extension of the classical Vehicle Routing Problem with Time Windows which consists of routing a number of vehicles to serve a set of customers, and determining their speed on each route segment so as to minimize a function comprising fuel, emission and driver costs. This paper presents an adaptive large neighborhood search for the PRP. Results of extensive computational experimentation confirm the efficiency of the algorithm.     

Scaling, Optimality, and Landscape Evolution

A nonlinear model is studied which describes the evolution of a landscape under the effects of erosion and regeneration by geologic uplift by mean of a simple differential equation. The equation, already in wide use among geomorphologists and in that context obtained phenomenologically, is here derived by reparametrization invariance arguments and exactly solved in dimension d=1. Results of numerical simulations in d=2 show that the model is able to reproduce the critical scaling characterizing landscapes associated with natural river basins. We show that configurations minimizing the rate of energy dissipation (optimal channel networks) are stationary solutions of the equation describing the landscape evolution. Numerical simulations show that a careful annealing of the equation in the presence of additive noise leads to configurations very close to the global minimum of the dissipated energy, characterized by mean field exponents. We further show that if one considers generalized river network configurations in which splitting of the flow (i.e., braiding) and loops are allowed, the minimization of the dissipated energy results in spanning loopless configurations, under the constraints imposed by the continuity equations. This is stated in the form of a general theorem applicable to generic networks, suggesting that other branching structures occurring in nature may possibly arise as optimal structures minimizing a cost function.     

Solving Large Airline Crew Scheduling Problems: Random Pairing Generation and Strong Branching

The airline crew scheduling problem is the problem of assigning crew itineraries to flights. We develop a new approach for solving the problem that is based on enumerating hundreds of millions random pairings. The linear programming relaxation is solved first and then millions of columns with best reduced cost are selected for the integer program. The number of columns is further reduced by a linear programming based heuristic. Finally an integer solution is obtained with a commercial integer programming solver. The branching rule of the solver is enhanced with a combination of strong branching and a specialized branching rule. The algorithm produces solutions that are significantly better than ones found by current practice.     

四乙氧羰基甲氧基杯[4]芳烃的合成与性质

配位作用;液膜传递;四乙氧羰基甲氧基杯[4]芳烃的合成与性质     

钢管定购和运输的策略优化

本文为图 1主管道和图 2树形管道的定购和运输计划给出了一个最优化模型 .通过解这一个最优化模型得到钢管的定购和运输的最优策略 .同时 ,分析了哪个钢厂钢管销价的变化对图 1主管道购运计划和总费用影响最大 ,哪个钢厂钢管产量的上限的变化对购运计划和总费用影响最大