Freight transportation in railway networks with automated terminals: A mathematical model and MIP heuristic approaches

In this paper we propose a planning procedure for serving freight transportation requests in a railway network with fast transfer equipment at terminals. We consider a transportation system where different customers make their requests (orders) for moving boxes, i.e., either containers or swap bodies, between different origins and destinations, with specific requirements on delivery times. The decisions to be taken concern the route (and the corresponding sequence of trains) that each box follows in the network and the assignment of boxes to train wagons, taking into account that boxes can change more than one train and that train timetables are fixed.The planning procedure includes a pre-analysis step to determine all the possible sequences of trains for serving each order, followed by the solution of a 0-1 linear programming problem to find the optimal assignment of each box to a train sequence and to a specific wagon for each train in the sequence. This latter is a generalized assignment problem which is NP-hard. Hence, in order to find good solutions in acceptable computation times, two MIP heuristic approaches are proposed and tested through an experimental analysis considering realistic problem instances.     

Maritime inventory routing with multiple products: A case study from the cement industry

This paper considers a maritime inventory routing problem faced by a major cement producer. A heterogeneous fleet of bulk ships transport multiple non-mixable cement products from producing factories to regional silo stations along the coast of Norway. Inventory constraints are present both at the factories and the silos, and there are upper and lower limits for all inventories. The ship fleet capacity is limited, and in peak periods the demand for cement products at the silos exceeds the fleet capacity. In addition, constraints regarding the capacity of the ships’ cargo holds, the depth of the ports and the fact that different cement products cannot be mixed must be taken into consideration. A construction heuristic embedded in a genetic algorithmic framework is developed. The approach adopted is used to solve real instances of the problem within reasonable solution time and with good quality solutions.     

能量输运对柱状等离子体开关磁场穿透过程的影响

对于高密度、导通时间为μs级的柱状等离子体开关,利用磁流体动力学理论(MHD),对其导通阶段的磁场穿透过程进行了模拟,得到了磁场分布随时间的变化;研究了开关导通过程中能量输运导致的温度不均匀分布对磁场穿透过程的影响。模拟结果表明：对于高密度等离子体开关,磁场以远大于磁扩散速率的速度穿透到等离子体中;在磁压对等离子体产生的压缩效应和欧姆加热效应共同作用下,激波区域的等离子体温度显著升高,这进一步加速了磁场穿透;当考虑能量输运方程时,开关导通时间为0.87 μs,比等温模型的结果0.92 μs短,与实验结果0.87 μs相一致。     

颗粒毛细效应影响因素的离散元分析

颗粒毛细效应是指将一根细管插入填充有颗粒物质的容器中并对管施加竖直振动时颗粒在管内上升并最终达到一个稳定的高度的现象,该现象为颗粒物料的逆重力输运提供了一种潜在的技术途径.为探究颗粒毛细效应的影响因素,采用离散元方法,模拟再现了颗粒毛细效应过程,展示了不同管径下颗粒竖直方向速度演变特性,考察了不同容器宽度和振动条件下颗粒最终毛细上升高度随管径的演变规律.结果表明,在容器宽度与粒径比为40、管振幅与粒径比为14.33、管振动频率为12 Hz情况下,管径与粒径比D/d=3.33时,管内颗粒堵塞严重,使得颗粒上升缓慢,并造成颗粒柱中断; D/d=8.33时,起初毛细上升高度增加迅速,随后毛细上升高度的增大逐渐减缓,管内颗粒在管径方向几乎不存在速度梯度; D/d=15时,随着颗粒毛细上升高度的增大,管内颗粒柱分离为速度截然不同的两层,上层颗粒在管径方向几乎不存在速度梯度,而下层颗粒存在明显的速度梯度.研究还发现,在毛细效应能够发生的管径范围内,存在一个对应于颗粒最终毛细上升高度最大值的临界管径,当管径小于临界管径时,颗粒最终毛细上升高度随管径的增大而增大,当管径大于临界管径时,颗粒最终毛细上升...     

浆体管道输送水击压力波波速的探讨

在考虑自由气体存在的影响下,推导出浆体水击压力波波速的计算公式.分析表明很少量的气体存在会使波速明显降低. 气体体积浓度较大时波速随浆体浓度的增大而减小,重质物料的减小趋势较为明显;气体体积浓度较小时轻质物料波速随浓度的增加而增加.相同条件下非均质流波速比伪均质流波速大,两者差异主要受浆体中固体物料的密度和浆体体积浓度影响. 考虑气体影响作用的浆击波速计算值与实测结果更吻合.     

2MeV有箔注入器的束流调试

为20MeV 直线感应加速器建造的2MeV注入器的束流技术指标经过一年多实验调试已达到能量2MeV、束流3kA、亮度≥108A/(m·rad)2。建立了二维数字模型对注入器的电子发射和束流传输过程进行模拟,模拟结果指导了实验调试,分析了有箔二极管中发生的聚焦作用。     

不同燃烧状态飞火颗粒自由燃烧规律研究

飞火是开放空间中大尺度火灾非连续性蔓延的主要形式.本文通过不同热流下的木质飞火颗粒自由燃烧实验,揭示不同燃烧状态飞火颗粒的结构变形、质量损失及温度分布的变化规律.研究表明,颗粒结构变形受材料化学反应机制和热机械力作用共同影响;颗粒燃烧反应易造成热解气体的内部积聚,以致内压激增、诱发喷射或喷溅细小颗粒的现象;阴燃过程颗粒...     

运输网络中最小饱和流的求解

运输网络中常常由于流量的不可控易发生堵塞现象.网络发生堵塞时的饱和流值达不到最大流值.最小饱和流是运输网络,尤其是紧急疏散网络设计中很重要的一个参数.通过建立网络的割集矩阵来确定网络的堵塞截面,基于此提出了求解最小饱和流的线性规划模型及算法.举例分析表明,利用该算法计算网络最小饱和流更加简便、更加实用.     

用自适应伪并行遗传算法求解双准则三维运输问题

采用并行计算的思想,在单台计算机上应用自适应的伪并行遗传算法,求解了双准则三维运输问题,最后通过实验验证该方法可产生适合需求的解,同时体现了该算法有较快的收敛速度.     

The Downs-Thomson Paradox: Existence, Uniqueness and Stability of User Equilibria

Consider a network where two routes are available for users wishing to travel from a source to a destination. On one route (which could be viewed as private transport) service slows as traffic increases. On the other (which could be viewed as public transport) the service frequency increases with demand. The Downs-Thomson paradox occurs when improvements in service produce an overall decline in performance as user equilibria adjust. Using the model proposed by Calvert [10], with a ⋅|M|1 queue corresponding to the private transport route, and a bulk-service infinite server queue modelling the public transport route, we give a complete analysis of this system in the setting of probabilistic routing. We obtain the user equilibria (which are not always unique), and determine their stability.AMS subject classification: 60K30, 90B15, 90B20, 91A10, 91A13This revised version was published online in June 2005 with corrected coverdate