一致性车辆路径问题下基于模板路径的模拟退火法

根据一致性车辆路径问题的“服务一致性”特征,本文提出了基于模板路径的 模拟退火法（TSA）以更好地求解此问题.该算法求解分为2 个阶段：第1 阶段求解模板路 径,第2 阶段以所得模板路径为参考获得各天车辆具体配送路径方案,2 个阶段均采用模 拟退火法进行优化.借助小、中规模基准数据集,文章对TSA算法进行数值实验,并将实 验结果与ConRTR算法和TTS算法的结果作比较,利用TSA法求解一致性车辆路径问题 得到的配送路径方案和“服务一致性”指标均得到优化.实验结果表明,运用TSA算法规 划车辆配送路径方案,不仅能够降低运营成本,还能提高配送服务质量.     

带软时间窗的集货与送货多车辆路径问题节约算法

研究了物流配送中多车运输的集货与送货车辆路径规划问题,以增加时间惩罚费用的方式插入软时间窗约束,将租车费用、货车运输费用和时间惩罚费用三者之和最小作为优化目标,建立数学模型。采用启发式节约算法求解该模型,考虑时间惩罚费用和运输费用,比较每一配送节点上直接送货和间接送货的节约费用关系,求出最优配送路径。试验结果表明:当配送次数达到50次时,货车平均装载率仍能达到80%以上,该节约算法能减少货车空程行驶和租车次数,优化了全局费用。     

驳船-圆柱碰撞的修正半波正弦荷载模型

为建立考虑冲击效应的船撞实用荷载模型,建立6艘不同吨位驳船的有限元精细化模型,采用驳船撞击刚性圆柱模型,通过数值仿真得到252条不同速度和不同径宽比下的撞击力时程原始样本。通过对样本的观察与分析,提出采用修正半波正弦函数作为撞击力过程的近似荷载模型,并通过数理统计的方法确定具体模型参数,由此根据驳船吨位、撞击速度、撞击径宽比等因素直接确定撞击荷载曲线。基于简化模型推导过程,指出修正半波正弦荷载模型的3个误差来源,并以2座不同结构形式的桥梁为例进行动力反应计算分析。以驳船接触碰撞的动力响应为基准,分析简化荷载模型计算结果的准确性,并进一步讨论3个误差来源对荷载模型误差的贡献大小与误差机理。研究结果表明：模型参数取值的精度良好;2个算例的动力响应对比分析得出,提出的修正半波正弦荷载模型对于柔性及刚性的桥梁结构均有良好的整体计算精度,具有广泛的实际工程应用价值。     

从欧洲新颁不锈钢管标准看不锈钢管制造技术发展(一)

介绍了2004-2005年欧洲首次颁布的4项不锈钢新标准的总体特点,着重分析了其中有关钢种的化学成分、制造过程和交货条件、质量检验项目和频度选择的灵活性和技术先进性。     

Route design for last-in,first-out deliveries with backhauling

The retail route design problem extends the capacitated vehicle routing problem with time windows by introducing several operational constraints, including order loading and delivery restrictions (last-in, first-out), order-dependent vehicle capacity, material handling limits at the warehouse, backhauling, and driving time bounds. In this paper, the problem is modeled on a directed network for an application associated with a major grocery chain. Because the corresponding mixed-integer program proved too difficult to solve with commercial software for real instances, we developed a greedy randomized adaptive search procedure (GRASP) augmented with tabu search to provide solutions. Testing was done using data sets provided Kroger, the largest grocery chain in the US, and benchmarked against a previously developed column generation algorithm. The results showed that cost reductions of $4887 per day or 5.58% per day on average, compared to Kroger’s corresponding solutions.     

The Share-a-Ride problem with stochastic travel times and stochastic delivery locations

We consider two stochastic variants of the Share-a-Ride problem: one with stochastic travel times and one with stochastic delivery locations. Both variants are formulated as a two-stage stochastic programming model with recourse. The objective is to maximize the expected profit of serving a set of passengers and parcels using a set of homogeneous vehicles. Our solution methodology integrates an adaptive large neighborhood search heuristic and three sampling strategies for the scenario generation (fixed sample size sampling, sample average approximation, and sequential sampling procedure). A computational study is carried out to compare the proposed approaches. The results show that the convergence rate depends on the source of stochasticity in the problem: stochastic delivery locations converge faster than stochastic travel times according to the numerical test. The sample average approximation and the sequential sampling procedure show a similar performance. The performance of the fixed sample size sampling is better compared to the other two approaches. The results suggest that the stochastic information is valuable in real-life and can dramatically improve the performance of a taxi sharing system, compared to deterministic solutions.     

乌江中上游双尾与隧道尾结合的机动驳船型

本文通过对隧道尾涡尾及隧道尾与双尾结合尾型等三种船型的船模快速性试验结果分析，得出隧道与双尾结合船型是浅水充机动驳适宜的船型，其单位功率负载率和海军系数较现有优秀隧道尾船型分别提高２８．６１％和３４．３１％。     

A cooperative waiting strategy based on elliptical areas for the Dynamic Pickup and Delivery Problem with Time Windows

The purpose of this paper to present a cooperative scheduling algorithm for solving the Dynamic Pickup and Delivery Problem with Time Windows (DPDPTW). The idea behind cooperative waiting strategies is to calculate simultaneously the waiting times for all nodes in the solution. Classical non‐cooperative scheduling algorithms perform the scheduling for each route independently of the scheduling of the other routes. We present the Cooperative Scheduling Problem (CSP) based on the elliptical areas generated by vehicles waiting at their nodes. The CSP is solved by means of a genetic algorithm and is evaluated by using a set of benchmarks based on real‐life data found in the literature. Initially, two waiting strategies are presented: Wait‐Early‐Time scheduling and Balanced‐Departure scheduling. Extensive empirical simulations have been carried out by analyzing the degree of dynamism and the average waiting time, a new concept defined to take into account the gap between the time windows of pickup and delivery nodes. Copyright © 2016 John Wiley & Sons, Ltd.     

铁路车站取送车系统优化理论与方法研究

取送车系统是车站作业系统的子系统,其效率的高低直接关系到出发列车正点率、车辆周转时间等运输生产指标。基于系统优化理论与方法、组合数学、集合论以及生产实践经验,分析取送车系统的要素、结构、环境和特征,研究取送车问题的建模方法、模型解的构造方法、寻优算法和提高问题寻优效率的启发式方法,并通过算例对研究成果的适用性进行验证。主要研究内容和结论如下。     

浅谈成都北车辆段货车检修信息化建设与展望

针对原成都东车辆段检修车间生产与信息化建设情况,分析了检修车间信息化建设中存在的普遍问题,并提出改进方法与对策。文中对成都北车辆段集约化生产组织相配套的信息化管理流程进行了充分的梳理与分析,最后再现了新信息化体系下的货车预检预修、生产过程监控管理、检修全过程质检管理、物料管理及配送等一系列生产运营过程。