装备维修器材生产路径双目标问题优化决策方法研究

在装备维修器材供应保障中,针对精确保障背景下部队用户对器材保障精度的要求,构建了最小化总成本和最大化订单精准执行率的双目标优化决策模型。在ε-约束法框架内,开发可生成近似Pareto前沿的两阶迭代启发式算法,并采用模糊逻辑决策法选择符合决策者偏好的折中最优解。随机实例测试结果表明所提出的模型和算法可以很好地应用在双目标优化问题的研究中,并在求解不同规模实例时表现出优异的性能。     

有时间窗装卸问题的多策略分组编码遗传算法

根据有时间窗装卸问题(PDPTW)的数学模型,设计了多策略分组编码遗传算法,将禁忌思想用于产生可行解的启发式插入算法之中,对计算实例进行了求解,结果表明,此算法可以有效求得有时间窗装卸问题的近似最优解.     

铁路客运网络列车开行方案优化模型的列生成算法

列车开行方案的设计是铁路旅客运输组织规划中的一个重要环节。本文首先给出了一个综合考虑铁路旅客运输的经济效益和公共服务性的优化模型,以铁路旅客运输的公共效益最大化为目标,对整个铁路客运网络上不同始发-终到和不同停站方式的列车开行方案进行优化。然后提出了一个求解此模型的启发式列生成算法,该算法与标准列生成算法相比,可以减少迭代次数并缩短收敛时间。最后给出一组利用随机生成的网络和需求进行求解的算例,验证本算法可以在较短时间内求解较大规模的铁路网络列车开行方案优化问题,并能有效缩小问题规模。     

碳排放限制下的冷藏集装箱多式联运路径优化

为了降低碳排放限制下的冷藏集装箱多式联运成本,实现节能减排的目的,高效的路径选择至关重要.该文基于碳排放限制的视角,针对多式联运网络中铁路和水路运输具有发班时间限制,以及冷藏集装箱需要考虑制冷费用、货损货差的特点,建立了在碳排放限制下以总成本最低为目标的优化模型.构建总成本时不仅考虑了运输费用和转运费用,还考虑了受发班时间影响而动态变化的冷藏费用和货损费用.设计了遗传算法求解,并进行了算例分析.结果表明:通过该模型和算法,可根据决策者的要求快速地选出成本最少的运输方案,为决策者提供决策支持.     

低碳政策下考虑道路拥堵的多式联运路径选择问题

为明确低碳政策及道路拥堵对多式联运路径选择的影响,构建了不同碳排放政策下考虑道路拥堵的多式联运路径选择模型。模型在考虑拥堵对运输时间影响的基础上进一步量化其对系统碳排放的作用效果。针对此类整数规划模型,设计了基于保优策略和移民策略的遗传算法进行求解。最后,通过算例探讨强制排放、碳税、碳交易及碳补偿四种碳排放政策对多式联运减排、缓解拥堵及成本的影响。结果表明考虑道路拥堵对运输碳排放的影响可得到更加合理的路径决策,且以强制碳排放政策为主的多种政策组合能更好的降低碳排放、缓解道路拥堵并促进多式联运推广。本模型可为政府制定合理的多式联运低碳政策以及企业制定合理的路径决策提供理论依据。     

基于CVaR的危险品公铁联运路径选择研究

公铁联运在危险品的多式联运中扮演着重要角色,为了降低危险品公铁联运风险,提高危险品公铁联运的安全性,危险品公铁联运的路径选择至关重要。本文运用条件风险价值(CVaR)理论,在对危险品公铁联运网络进行变形的基础上构建了考虑决策者风险规避程度的危险品公铁联运路径选择模型,设计了求解该模型的算法,并进行了算例分析。研究结果表明:通过该模型及其算法,可根据决策者对所需运输的危险品的运输风险规避程度,在危险品公铁联运网络中快速地选出使危险品公铁联运风险最小的运输路径和运输方式;决策者的风险规避程度会对危险品公铁联运过程中的运输路径和运输方式的选择产生重要影响。     

选址-库存-路径问题模型及其集成优化算法

设施选址、库存控制和车辆路径安排是物流系统优化中的三个关键问题,三者之间存在相互依赖的关系,应该根据这种关系来相应地进行综合优化与管理物流活动。以典型的单一生产基地、单一产品、采用不断审查的(Q, r)库存策略的供应链二级分销网络为研究对象,建立了一个随机型选址-库存-路径问题优化模型;在将非线性混合整数规划转化为线性整数集合覆盖模型的基础上,采用列生成算法来获得一个近似最优解,再用分支定价法对初始解进行改进,以实现对整个问题“完全集成”的优化。最后,用随机生成的方式,产生了10至160个客户的计算实例,分析了运输费用和库存费用对总成本的影响,算法运算时间表明本文给出的算法能较快地求解这一复杂问题。     

随机条件下大规模突发事件救援中的伤员转运问题

研究大规模突发事件发生后将大批量伤员从灾区运往外地的随机优化问题.首先建立伤员转运的随机多点运输模型,该模型以缩短整个转运时间为目标;由于突发事件导致的运输情况变得不确定,表现为任意两地间的运行时间是随机的,所以该模型是随机模型.然后,在算例中分别采用lingo程序和贪婪算法求解,通过比较可以发现,在大量伤员需要到外地治疗而运输工具相对有限时,用提出的模型和采用的lingo程序比用贪婪算法求解更有效地缩短转运时间,在应急管理中具有很好的应用价值.     

离散变量结构优化设计的组合算法*

本文首先给出了离散变量优化设计局部最优解的定义,然后提出了一种综合的组合算法.该算法采用分级优化的方法,第一级优化首先采用计算效率很高且经过随机抽样性能实验表明性能较高的启发式算法─—相对差商法,求解离散变量结构优化设计问题近似最优解 X ;第二级采用组合算法,在 X 的离散邻集内建立离散变量结构优化设计问题的(-1,0.1)规划模型,再进一步将其化为(0,1)规划模型,应用定界组合算法或相对差商法求解该(0,1)规划模型,求得局部最优解.解决了采用启发式算法无法判断近似最优解是否为局部最优解这一长期未得到解决的问题,提高了计算精度,同时,由于相对差商法的高效率与高精度,以上综合的组合算法的计算效率也还是较高的.     

带固定轴线成本的轴辐式网络设计问题

带固定轴线成本的轴辐式网络设计问题广泛应用于第三方物流、邮政和航空运输等领域. 现有研究主要考虑了枢纽站的节点成本, 本研究则强调合并运输的固定轴线成本. 固定轴线成本的必要性在于：轴辐式网络中的轴线运输需要借助更大型的运输工具, 因此必须支付固定成本. 建立了该问题的混合整数规划模型, 探讨了最优解特征, 并构造了求解问题的拉格朗日松驰算法, 实验显示算法具有非常好的求解效率与求解质量. 同时, 还讨论了一个重要的扩展问题：增加O-D流的绕道约束, 绕道约束常常应用于快递运输和应急物流等领域. 在局部修改原算法的基础上提供了扩展问题的求解方案.     

区间数型多目标联运路线优化问题的模型与算法

联运路线优化问题直接关系到货物运输的费用、时间和运输质量.首先分析了联运路线优化问题的数学模型及虚拟运输网络图;其次,将区间数排序的思想及属性值为区间数的多属性决策方法引入适应度函数的设计中,提出了一种求解区间数型联合运输路线优化问题的混合型遗传算法,给出了染色体编码、遗传算子设计、适应度函数定义及群体多样性控制的方法;最后用示例对算法的有效性进行了验证.     

A column generation approach for determining optimal fleet mix,schedules, and transshipment facility locations for a vessel transportation problem

This paper presents a column generation approach for a storage replenishment transportation-scheduling problem. The problem is concerned with determining an optimal combination of multiple-vessel schedules to transport a product from multiple sources to different destinations based on demand and storage information at the destinations, along with cost-effective optimal strategic locations for temporary transshipment storage facilities. Such problems are faced by oil/trucking companies that own a fleet of vessels (oil tankers or trucks) and have the option of chartering additional vessels to transport a product (crude oil or gasoline) to customers (storage facilities or gas stations) based on agreed upon contracts. An integer-programing model that determines a minimum-cost operation of vessels based on implicitly representing feasible shipping schedules is developed in this paper. Due to the moderate number of constraints but an overwhelming number of columns in the model, a column generation approach is devised to solve the continuous relaxation of the model, which is then coordinated with a sequential fixing heuristic in order to solve the discrete problem. Computational results are presented for a range of test problems to demonstrate the efficacy of the proposed approach.     

Real-time control of freight forwarder transportation networks by integrating multimodal transport chains

Western European freight forwarders are continually being forced to increase the efficiency of their transportation processes because of the liberalization and deregulation of the European transport market. This paper proposes a new real-time-oriented control approach in order to expand load consolidation, reduce empty vehicle trips, and handle dynamic disturbances. This approach integrates multimodal transportation and multiple transshipments for the first time. Thus, it enables the flexible generation and adaptation of transportation processes. In order to be able to handle occurring disturbances, an optimization procedure that adapts the transportation processes is continually applied. Vehicle breakdowns or deceleration of vehicles, traffic congestion, and street blockages are integrated as possible disturbance scenarios. At the same time, dynamically incoming transportation requests are also dealt with. Moreover, cooperative agreements between freight forwarders, which are gaining increasing importance, are integrated by mapping hubs and external services. The efficiency of the new real-time approach is validated by several computational experiments. In particular, the use of the entire execution time for plan adaptation as well as the integration of multiple transshipments has shown promising results.     

Synchronization of inventory and transportation under flexible vehicle constraint: A heuristics approach using sliding windows and hierarchical tree structure

This paper investigates the integrated inventory and transportation planning under flexible vehicle constraint. To offer better services at lower prices, more and more companies turn to outsource transportation functions to other professional service providers, namely 3rd party logistics companies. Under these vehicle rental arrangements, the number of vehicles is a decision variable instead of a fixed number, and the transportation cost includes not only the delivery cost but also the cost of vehicle rental that is proportional to the number of vehicles rented in a given planning horizon. In this paper, the problem is formulated as a mixed integer programming problem. A heuristic algorithm is developed, in which sliding windows are applied to approximate the problem by repeatedly solving a series of overlapping short-term subproblems, and a hierarchical tree structure is used to evaluate the closeness of different groups of retailers. Numerical experiments show that a better tradeoff between the inventory cost and transportation cost can be achieved through the proposed heuristic algorithm.     

基于正交试验的乘用车运输网络优化方法

在交通部治理公路超限运输的背景下,本文研究了乘用车物流企业多式联运模式下的网络优化问题,以运输网络总成本最小为目标,考虑物流时效、枢纽节点容量及规模经济效应等因素,构建了基于轴辐式理论的运输网络优化模型,提出了混合智能优化算法。针对多参数多水平的寻优问题,对模型的三个关键输入参数,即枢纽节点数量、枢纽节点容量和规模效应折扣系数,引入正交试验方法,降低求解多参数多水平寻优问题的工作量,为确定各参数合理取值提供了新的途径。研究结果表明:枢纽节点容量、折扣系数与枢纽数量三个输入参数对优化结果的影响具有主次顺序,影响程度依次减弱,而且只有枢纽节点容量与折扣系数对乘用车运输网络总效益的影响起显著作用。采用混合轴辐式的网络结构与多式联运的运输组织模式进行优化后的运输网络,相对于原有“点对点”公路运输网络总成本减少10%,从运营管理与成本控制两方面均可有效应对公路治超带来的风险。     

Column generation based heuristic for tactical planning in multi-period vehicle routing

The periodic vehicle routing problem (PVRP) consists in establishing a planning of visits to clients over a given time horizon so as to satisfy some service level while optimizing the routes used in each time period. The tactical planning model considered here restricts its attention to scheduling visits and assigning them to vehicles while leaving sequencing decisions for an underlying operational model. The objective is twofold: to optimize regional compactness of the routes in a desire to specialize routes to restricted geographical area and to balance the workload evenly between vehicles. Approximate solutions are constructed using a truncated column generation procedure followed by a rounding heuristic. This mathematical programming based procedure can deal with problems with 50–80 customers over five working days which is the range of size of most PVRP instances treated in the literature with meta-heuristics. The paper highlights the importance of alternative optimization criteria not accounted for in standard operational models and provides insights on the implementation of a column generation based rounding heuristic.     

An index heuristic for transshipment decisions in multi-location inventory systems based on a pairwise decomposition

In multi-location inventory systems, transshipments are often used to improve customer service and reduce cost. Determining optimal transshipment policies for such systems involves a complex optimisation problem that is only tractable for systems with few locations. Consequently simple heuristic transshipment policies are often applied in practice. This paper develops an approximate solution method which applies decomposition to reduce a Markov decision process model of a multi-location inventory system into a number of models involving only two locations. The value functions from the subproblems are used to estimate the fair charge for the inventory provided in a transshipment. This estimate of the fair charge is used as the decision criterion in a heuristic transshipment policy for the multi-location system. A numerical study shows that the proposed heuristic can deliver considerable cost savings compared to the simple heuristics often used in practice.     

A prototype column generation strategy for the multiple container loading problem

The multiple container loading cost minimization problem (MCLCMP) is a practical and useful problem in the transportation industry, where products of various dimensions are to be loaded into containers of various sizes so as to minimize the total shipping cost. The MCLCMP can be naturally formulated as a set cover problem and solved using column generation techniques, which is a popular method for handling huge numbers of variables. However, the direct application of column generation is not effective because feasible solutions to the pricing subproblem is required, which for the MCLCMP is NP-hard. We show that efficiency can be greatly improved by generating prototypes that approximate feasible solutions to the pricing problem rather than actual columns. For many hard combinatorial problems, the subproblem in column generation based algorithms is NP-hard; if suitable prototypes can be quickly generated that approximate feasible solutions, then our strategy can also be applied to speed up these algorithms.