随机需求库存-路径问题(Stochastic Demand Inventory Routing Problem,SDIRP)即考虑随机需求环境下供应链中库存与配送的协调优化问题,是实施供应商管理库存策略过程中的关键所在,也是典型的NP难题之一。文章以具有硬时间窗约束的随机...随机需求库存-路径问题(Stochastic Demand Inventory Routing Problem,SDIRP)即考虑随机需求环境下供应链中库存与配送的协调优化问题,是实施供应商管理库存策略过程中的关键所在,也是典型的NP难题之一。文章以具有硬时间窗约束的随机需求库存-路径问题(Stochastic Demand Inventory Routing Problem with Hard Time Windows,SDIRPHTW)为研究对象,将SDIRPHTW分解为直接配送的随机库存-路径问题和具有硬时间窗约束的路径优化问题两个子问题,并以最小化系统运行成本和用车数量为目标,设计了一个基于(s,S)库存策略和修正C-W节约法的启发式算法。最后,通过相应的数值算例验证了算法的有效性。展开更多
Taking the distribution route optimization of refined oil as background, this paper studies the inventory routing problem of refined oil distribution based on working time equilibrium. In consideration of the constrai...Taking the distribution route optimization of refined oil as background, this paper studies the inventory routing problem of refined oil distribution based on working time equilibrium. In consideration of the constraints of vehicle capacity, time window for unloading oil, service time and demand of each gas station, we take the working time equilibrium of each vehicle as goal and establish an integer programming model for the vehicle routing problem of refined oil distribution, the objective function of the model is to minimize the maximum working time of vehicles. To solve this model, a Lingo program was written and a heuristic algorithm was designed. We further use the random generation method to produce an example with 10 gas stations. The local optimal solution and approximate optimal solution are obtained by using Lingo software and heuristic algorithm respectively. By comparing the approximate optimal solution obtained by heuristic algorithm with the local optimal solution obtained by Lingo software, the feasibility of the model and the effectiveness of the heuristic algorithm are verified. The results of this paper provide a theoretical basis for the scheduling department to formulate the oil distribution plan.展开更多
直接配送策略下随机需求库存-路径问题(Stochastic Demand Inventory Routing Problem with Direct Deliveries,SDIRPDD)由于其需求的不确定性、决策的长期性以及其最优策略形式对求解其他库存-路径问题(IRP)的参考价值,使得对SDIPRDD...直接配送策略下随机需求库存-路径问题(Stochastic Demand Inventory Routing Problem with Direct Deliveries,SDIRPDD)由于其需求的不确定性、决策的长期性以及其最优策略形式对求解其他库存-路径问题(IRP)的参考价值,使得对SDIPRDD问题的研究成为物流、供应链优化领域研究的一个热点。文章首先证明了无约束SDIRPDD的最优平稳策略为(s,S)形式,并通过分析车辆数约束对客户单阶段期望成本函数的影响,给出了存在车辆数和客户库存容量约束时SDIRPDD问题的最优平稳策略形式,进而提出了一种求解有约束SDIRPDD问题最优平稳策略的近似算法。最后,通过数值算例验证了算法的有效性并分析了结果的现实意义。展开更多
针对推式配送模式和小容销比客户,将多次配送决策与车辆调度决策进行集成,提出了小容销比客户库存路径问题(inventory routing problem for customers with small capacity sales ratio, IRPSC),并分析了该问题的复杂性.在此基础上,针...针对推式配送模式和小容销比客户,将多次配送决策与车辆调度决策进行集成,提出了小容销比客户库存路径问题(inventory routing problem for customers with small capacity sales ratio, IRPSC),并分析了该问题的复杂性.在此基础上,针对加油站配送需求,提出了带隔舱、多行程的IRPSC (IRPSC-MM).以运输成本、卸油成本、缺货成本之和最小为目标建立了数学规划模型.设计了融合模拟退火的混合变邻域搜索算法(HVNS),并针对问题特点设计了五个新的邻域结构.采用HVNS求解不同规模算例以及实例.结果表明,与CPLEX和其它算法相比, HVNS能够高效地求解IRPSC-MM;从解的质量和运算时间来看,HVNS能够有效解决实际问题.展开更多
文摘随机需求库存-路径问题(Stochastic Demand Inventory Routing Problem,SDIRP)即考虑随机需求环境下供应链中库存与配送的协调优化问题,是实施供应商管理库存策略过程中的关键所在,也是典型的NP难题之一。文章以具有硬时间窗约束的随机需求库存-路径问题(Stochastic Demand Inventory Routing Problem with Hard Time Windows,SDIRPHTW)为研究对象,将SDIRPHTW分解为直接配送的随机库存-路径问题和具有硬时间窗约束的路径优化问题两个子问题,并以最小化系统运行成本和用车数量为目标,设计了一个基于(s,S)库存策略和修正C-W节约法的启发式算法。最后,通过相应的数值算例验证了算法的有效性。
文摘Taking the distribution route optimization of refined oil as background, this paper studies the inventory routing problem of refined oil distribution based on working time equilibrium. In consideration of the constraints of vehicle capacity, time window for unloading oil, service time and demand of each gas station, we take the working time equilibrium of each vehicle as goal and establish an integer programming model for the vehicle routing problem of refined oil distribution, the objective function of the model is to minimize the maximum working time of vehicles. To solve this model, a Lingo program was written and a heuristic algorithm was designed. We further use the random generation method to produce an example with 10 gas stations. The local optimal solution and approximate optimal solution are obtained by using Lingo software and heuristic algorithm respectively. By comparing the approximate optimal solution obtained by heuristic algorithm with the local optimal solution obtained by Lingo software, the feasibility of the model and the effectiveness of the heuristic algorithm are verified. The results of this paper provide a theoretical basis for the scheduling department to formulate the oil distribution plan.
文摘直接配送策略下随机需求库存-路径问题(Stochastic Demand Inventory Routing Problem with Direct Deliveries,SDIRPDD)由于其需求的不确定性、决策的长期性以及其最优策略形式对求解其他库存-路径问题(IRP)的参考价值,使得对SDIPRDD问题的研究成为物流、供应链优化领域研究的一个热点。文章首先证明了无约束SDIRPDD的最优平稳策略为(s,S)形式,并通过分析车辆数约束对客户单阶段期望成本函数的影响,给出了存在车辆数和客户库存容量约束时SDIRPDD问题的最优平稳策略形式,进而提出了一种求解有约束SDIRPDD问题最优平稳策略的近似算法。最后,通过数值算例验证了算法的有效性并分析了结果的现实意义。
文摘针对推式配送模式和小容销比客户,将多次配送决策与车辆调度决策进行集成,提出了小容销比客户库存路径问题(inventory routing problem for customers with small capacity sales ratio, IRPSC),并分析了该问题的复杂性.在此基础上,针对加油站配送需求,提出了带隔舱、多行程的IRPSC (IRPSC-MM).以运输成本、卸油成本、缺货成本之和最小为目标建立了数学规划模型.设计了融合模拟退火的混合变邻域搜索算法(HVNS),并针对问题特点设计了五个新的邻域结构.采用HVNS求解不同规模算例以及实例.结果表明,与CPLEX和其它算法相比, HVNS能够高效地求解IRPSC-MM;从解的质量和运算时间来看,HVNS能够有效解决实际问题.
