横向整合战略下异质车辆库存路径优化模型

以实现供货商联盟期望物流成本最小化为目标,针对需求随机波动下的多供货商多产品库存路径问题（IRP）进行了研究。基于横向整合战略,设计了供货商联盟成员间车辆配送成本的合理分摊方式。考虑零售商配送软硬时间窗和库存服务水平要求,构建了多供货商多产品的异质车辆库存路径混合整数随机规划模型,并利用需求累积分布逆函数将其转化为确定型规划模型。然后设计改进遗传算法求解该确定型规划模型。算例分析结果显示,使用异质车辆配送可以比使用同质重型和轻型车辆分别降低供货商联盟总成本8.3%和11.92%,分别提升配送车辆装载率24%和17%。敏感性分析结果表明,无论供货商供货数量占联盟总供货数量比例和零售商商品需求变异系数如何变化,采用异质车辆配送的供货商联盟总成本都能得到有效降低;且需求变异系数越大,采用异质车辆配送的优势越明显。     

物流包装租赁系统配送库存路径模型与算法

发展物流包装租赁共享系统是解决落后的一次性包装使用方式的有效手段。为优化物流包装租赁系统中的空包装配送与库存控制这一频繁决策问题,将租赁客户点的需求和物流包装租赁系统的服务中心的库存能力、库存费用、车辆容量、单位运费等因素引入模型,建立了总成本费用最小的物流包装租赁共享系统的空包装配送库存路径集成优化模型。针对稍小和稍大规模算例,对利用CPLEX优化软件和带精英保留的改进遗传算法进行了求解比较分析,结果表明：改进遗传算法对稍大规模算例求解的结果虽然稍差,但求解时间大大缩短,这说明了启发式算法对大规模的实际问题是有效的。该模型和算法可为物流包装租赁企业的空包装配送和库存控制的集成优化决策提供参考。     

考虑机器故障的串行生产系统控制策略优化

针对多级串行生产系统,考虑存在机器故障和随机需求,对生产及雇佣的控制策略进行研究。以最小平均总成本为目标,建立基于（Q,r）库存策略的优化模型;鉴于求解复杂性,提出一种改进的网格自适应直接搜索算法（MADS-GA）,为避免陷入局部最优和提高收敛速度,算法中加入了停滞阻止策略;对研究实例进行求解,并与已有算法比较。结果表明,所提出的算法收敛速度和寻优能力更优,能有效优化串行生产系统的控制策略,降低平均总成本。     

需求确定的维修器材供应链多级库存优化研究

考虑到装备维修器材库存系统各节点利益一致、信息共享程度高等特点。运用级库存理论,将树形库存系统简化为链式库存系统,建立了以库存系统总成本最优的模型,并采用求解松弛问题的启发式算法进行了求解,实例验证了模型及算法的有效性。     

基于鲁棒优化的供应链联合补货策略

供应链管理中的客户需求不确定性会导致需求信息偏差逐级放大的"牛鞭效应",但目前常用的供应链管理策略为供应商管理库存,没有考虑需求不确定的影响。为此,在单个供应商、多个零售商需求不确定的情况下,结合鲁棒优化法提出一种联合补货策略进行库存管理。构建一个非线性混合整数规划模型以计算两级供应链的总成本,通过总成本的变化来反映供应链系统的性能,采用鲁棒优化法求解供应链系统的最小总成本,并使用外部和内部两层迭代算法获得供应商和零售商的补货周期及补货数目。实验结果表明,与传统的供应链策略ERI和AR相比,该策略可有效降低供应链系统的总成本。     

双渠道二级供应链库存分配与控制问题研究

针对由仓库和多个零售商组成的二级供应链问题,考虑仓库面临零售商和网络销售两种渠道以及不同零售商的优先级不同的情况,建立解析模型。以最小化供应链总成本为目标,设计一种改进型遗传算法,并提出一种两阶段分配策略求解模型。以实际数据为例,对模型在供应链库存分配与控制问题中的应用进行实例验证,结果表明,所提出策略所得解优于改进的先到先服务（FCFS）策略,并且与Cplex所得精确解的GAP小于10%。数值试验表明所提出的策略能够有效地分配库存,所提出的算法能够有效地求得库存策略的各个参数。     

考虑门店持有库存的同城整车配送优化模型

研究连锁零售企业配送中心和连锁门店构成的二级库存系统,考虑门店持有库存对配送中心库存的影响,以门店客户服务水平对系统总成本进行约束优化,建立了连锁零售配送中心同城整车配送库存优化模型,并给出了一个具体的的算例。     

需求随机依赖库存环境下的订货仿真优化模型

需求的随机性和依赖库存性是库存问题的特点之一,在需求以泊松分布的形式随机依赖库存的条件下讨论了（Q,T）型库存控制问题。为了评估库存控制策略的平均盈利水平,建立了该库存问题的离散事件系统仿真模型,设计了一种基于仿真的种群重叠、遗传操作非重叠的进化算法,用以优化库存控制策略,类似设计了基于仿真的模拟退火和粒子群优化算法进行比较。通过实例分析了不同参数的变化对模型最优解的影响,灵敏度分析表明需求依赖库存效应越明显时,利润水平越高,最优订货策略越倾向于高库存、短周期和现货销售。仿真实例说明了基于仿真的优化算法的可行性、有效性。     

带时间窗的随机库存—运输整合优化研究*

针对单配送中心—多客户配送系统,建立带时间窗约束的单周期随机需求库存—运输整合优化(ITIO)问题模型。运用禁忌搜索算法,求解无时间窗约束的算例,结果表明库存—运输整合优化策略在总成本和车辆数上都优于全选最佳和全选次优策略,证明ITIO问题的研究具有理论意义和实际价值。同时,与遗传算法求解结果的比较表明,禁忌搜索算法求解此类问题具有优势。求解引入时间窗约束的算例,结果显示既满足时限要求,又比其他两种策略节省了库存—运输总成本,使得本模型及其求解算法更贴近实际应用要求。     

基于LSTM算法的云资源库存需求预测

针对云资源库存需求存在着预测实际效果差等问题，通过分析云资源库存需求历史数据的时间序列特征构建长短期记忆（Long Short Term Memory,LSTM）模型，使用A公司数据集设计LSTM与Prophet的对比实验。结果表明，与Prophet算法相比，LSTM网络模型能够较好地预测云资源库存需求的变化趋势，且预测误差较低。     

The Flexible Periodic Vehicle Routing Problem

This paper introduces the Flexible Periodic Vehicle Routing Problem (FPVRP) where a carrier has to establish a distribution plan to serve his customers over a planning horizon. Each customer has a total demand that must be served within the horizon and a limit on the maximum quantity that can be delivered at each visit. A fleet of homogeneous capacitated vehicles is available to perform the services and the objective is to minimize the total routing cost. The FPVRP can be seen as a generalization of the Periodic Vehicle Routing Problem (PVRP) which instead has fixed service frequencies and schedules and where the quantity delivered at each visit is fixed. Moreover, the FPVRP shares some common characteristics with the Inventory Routing Problem (IRP) where inventory levels are considered at each time period and, typically, an inventory cost is involved in the objective function. We present a worst-case analysis which shows the advantages of the FPVRP with respect to both PVRP and IRP. Moreover, we propose a mathematical formulation for the problem, together with some valid inequalities. Computational results show that adding flexibility improves meaningfully the routing costs in comparison with both PVRP and IRP.     

A label based ant colony algorithm for heterogeneous vehicle routing with mixed backhaul

Vehicle heterogeneity and backhaul mixed-load problems are often studied separately in existing literature. This paper aims to solve a type of vehicle routing problem by simultaneously considering fleet heterogeneity, backhaul mixed-loads, and time windows. The goal is to determine the vehicle types, the fleet size, and the travel routes such that the total service cost is minimized. We propose a multi-attribute Label-based Ant Colony System (LACS) algorithm to tackle this complex optimization problem. The multi-attribute labeling technique enables us to characterize the customer demand, the vehicle states, and the route options. The features of the ant colony system include swarm intelligence and searching robustness. A variety of benchmark instances are used to demonstrate the computational advantage and the global optimality of the LACS algorithm. We also implemented the proposed algorithm in a real-world environment by solving an 84-node postal shuttle service problem for China Post Office in Guangzhou. The results show that a heterogeneous fleet is preferred to a homogenous fleet as it generates more cost savings under variable customer demands.     

Robust Multi-period Fleet Allocation Models for Bike-Sharing Systems

This paper presents mathematical programming models that generate optimal daily allocation of bicycles to the stations of a bike-sharing system. First, a time-space network is constructed to describe time-dependent bike flows in the system. Next, a bike fleet allocation model that considers average historical demand and fixed fleet size is established based on the time-space network. In addition to fleet allocation in multiple periods, this model generates least cost empty bicycle redistribution plans to meet demand in subsequent time periods. The model aims to correct demand asymmetry in bike-sharing systems, where flow from one station to another is seldom equal to the flow in the opposing direction. An extension of the model that relaxes the fleet size constraint to determine optimal fleet size in supporting planning stage decisions is also presented in the paper. Moreover, we describe uncertain bike demands using some prescribed uncertainty sets and develop robust bike fleet allocation models that minimize total system cost in the worst-case or maximum demand scenarios derived from the uncertainty sets. Numerical experiments were conducted based on the New Taipei City’s public bike system to demonstrate the applicability and performance of the proposed models. In addition, this research considers two performance measures, robust price and hedge value, in order to investigate the tradeoff between robustness and optimality, as well as the benefit of applying robust solutions relative to nominal optimal solutions in uncertain demand situations.     

考虑客户聚类与产品回收的两级闭环物流网络选址-路径优化

针对目前不合理的废旧产品回收以及物流活动产生的碳排放污染，提出了一种考虑客户聚类与产品回收的两级闭环物流网络选址-路径优化模型。首先，结合实际物流网络的动态性假设客户需求量和回收率的不确定性特征，以最小运营成本和最小环境影响为目标建立选址-路径优化模型；其次，对多目标进化算法进行改进，提出了考虑客户聚类结果的两级物流设施选址-路径问题求解算法；最后，对该优化算法进行算法性能分析，并以重庆市某企业为例进行了模型和算法验证。结果表明，所建立的模型和算法能有效降低决策难度并提高物流系统的运作效率，所求出的优化方案能减少物流运作成本和降低物流运输过程对环境的影响。     

The exact solution of several classes of inventory-routing problems

In order to be competitive companies need to take advantage of synergistic interactions between different decision areas. Two of these are related to the distribution and inventory management processes. Inventory-Routing Problems (IRPs) arise when inventory and routing decisions must be made simultaneously, which yields a difficult combinatorial optimization problem. In this paper, we propose a branch-and-cut algorithm for the exact solution of several classes of IRPs. Specifically, we solve the multi-vehicle IRP with a homogeneous and a heterogeneous fleet, the IRP with transshipment options, and the IRP with added consistency features. We perform an extensive computational analysis on benchmark instances.     

An integrated optimization method for tactical-level planning in liner shipping with heterogeneous ship fleet and environmental considerations

The maritime transportation flows and container demand have been increasing over time, although the COVID-19 pandemic may slow down this trend for some time. One of the common strategies adopted by shipping lines to efficiently serve the existing customers is the deployment of large ships. The current practice in the liner shipping industry is to deploy a combination of ships of different types with different carrying capacities (i.e., heterogeneous fleet), especially at the routes with a significant demand. However, heterogeneous fleets of ships have been investigated by a very few studies addressing the tactical liner shipping decisions (i.e., determination of service frequency, ship fleet deployment, optimization of ship sailing speed, and design of ship schedules). Moreover, limited research efforts have been carried out to simultaneously capture all the major tactical liner shipping decisions using a single solution methodology. Therefore, this study proposes an integrated optimization model that addresses all the major tactical liner shipping decisions and allows the deployment of a heterogeneous ship fleet at each route, considering emissions generated throughout liner shipping operations. The model’s objective maximizes the total turnaround profit generated from liner shipping operations. A decomposition-based heuristic algorithm is presented in this study to solve the model proposed and efficiently tackle large-size problem instances. Numerical experiments, carried out for a number of real-world liner shipping routes, demonstrate the effectiveness of the proposed methodology. A set of managerial insights, obtained from the proposed methodology, are also provided.     

模糊需求下绿色同时取送货问题与算法研究

研究绿色同时取送货车辆调度问题,提出改进的遗传禁忌搜索算法（Genetic Algorithm with Tabu Search,GA-TS）求解该问题。模型中,以服务成本、油耗成本和碳排放成本构成的总成本最小为目标,采用了综合模型计算油耗和碳排放成本,引入三角模糊数来描述客户需求的不确定性,并考虑同时取送货需求。在改进的GA-TS算法中,将惩罚因子引入适应度函数,采用结合精英策略的选择算子,提出结合禁忌搜索算法的变异算子。在案例分析中,采用田口分析法获取合理的参数设置,通过案例结果分析和算法对比分析验证模型和算法的有效性和先进性。     

两级系统多周期随机库存路径优化

库存和运输是物流活动的最主要环节,如何同时对二者进行优化,是供应商管理库存必须解决的核心问题。针对一个配送中心为多个零售商实施统一配送的两级系统,以最小化系统计划期平均总费用为目标,分析包括零售商存储费、缺货费,以及配送中心进货费、存储费和配送费的系统全部费用组成,整合库存与配送建立了库存路径问题数学模型。根据零售商需求的随机性和库存路径问题本身的两阶段性,估计零售商库存上下限,选择配送中心订货策略及配送优先原则,借鉴旅行商问题求解思路,设计了求解问题的启发式算法。用Matlab7.0编程实现仿真算例求解表明,整合优化比分别优化节省平均总费用6.2%。     

车辆数限制的多车型校车路径问题模型及算法研究

为适应校车路径规划中校车有多种车型且每种车型数量受限的需求,建立车辆数限制的多车型校车路径问题(HFSBRP)的数学模型,并提出一种迭代局部搜索算法进行求解。该算法借助邻域随机选择的变邻域下降搜索(VND)算法完成局部提升。局部提升过程中,首先调整车型,然后再混合使用缩减路径数和提高车辆利用率的邻域解接受策略以提高算法的寻优能力,为保证解的多样性,允许接受一定偏差范围内的邻域解。此外,为避免算法过早陷入局部最优,设计了多点交换和移动的扰动规则。基于国际基准测试案例进行模型验证和算法测试,实验结果表明了模型的正确性和算法的有效性。