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.展开更多
针对军事运输中有硬时间窗的车辆路径问题(vehicle routing problem with hard time windows,VRPHTW),结合混合交叉运算、改进变异运算和精英保留策略,以所有车辆的配送总时间最少为目标,设计了改进遗传算法。借鉴贪婪思想,提高了初始...针对军事运输中有硬时间窗的车辆路径问题(vehicle routing problem with hard time windows,VRPHTW),结合混合交叉运算、改进变异运算和精英保留策略,以所有车辆的配送总时间最少为目标,设计了改进遗传算法。借鉴贪婪思想,提高了初始种群的优越性;构造了迭代种群的入口矩阵和出口矩阵,并以此为基础提出改进交叉算子,期间引入前向插入法设计了混合交叉运算,加快了种群的寻优速度;同时提出改进变异算子,增加了种群的多样性。实验结果表明,改进遗传算法较之基本算法有着更快的收敛速度和更优的收敛效果。展开更多
随机需求库存-路径问题(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节约法的启发式算法。最后,通过相应的数值算例验证了算法的有效性。展开更多
文章针对软硬时间窗共存装卸一体化车辆路径问题(vehicle routing problem with simultaneous delivery and pickup under coexistence of soft and hard time windows,VRPSDPCSHTW)建立了包含车辆固定出行成本、运输成本和惩罚成本的...文章针对软硬时间窗共存装卸一体化车辆路径问题(vehicle routing problem with simultaneous delivery and pickup under coexistence of soft and hard time windows,VRPSDPCSHTW)建立了包含车辆固定出行成本、运输成本和惩罚成本的数学模型,提出了一种混合离散粒子群优化算法。针对基本离散粒子群算法容易早熟收敛而陷入局部最优等问题,内嵌一种变邻域下降局域搜索方法,并在一定概率下执行以加强种群搜索能力,最后通过3个算例的仿真分析进行了算法验证。展开更多
针对带硬时间窗的水果运输调度问题(Fruits in Vehicle Routing Problem with Hard Time Windows,FVRPHTW),联系实际应用中水果易腐的特性及运输途中的路况因素,采用蚁群算法、模拟退火算法和禁忌搜索算法来对FVRPHTW求解,并分析3种算...针对带硬时间窗的水果运输调度问题(Fruits in Vehicle Routing Problem with Hard Time Windows,FVRPHTW),联系实际应用中水果易腐的特性及运输途中的路况因素,采用蚁群算法、模拟退火算法和禁忌搜索算法来对FVRPHTW求解,并分析3种算法的优缺点。实例证明,这些算法对求解水果运输调度问题是可行的,模拟退火算法略优于其他两种算法。展开更多
文摘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.
文摘针对军事运输中有硬时间窗的车辆路径问题(vehicle routing problem with hard time windows,VRPHTW),结合混合交叉运算、改进变异运算和精英保留策略,以所有车辆的配送总时间最少为目标,设计了改进遗传算法。借鉴贪婪思想,提高了初始种群的优越性;构造了迭代种群的入口矩阵和出口矩阵,并以此为基础提出改进交叉算子,期间引入前向插入法设计了混合交叉运算,加快了种群的寻优速度;同时提出改进变异算子,增加了种群的多样性。实验结果表明,改进遗传算法较之基本算法有着更快的收敛速度和更优的收敛效果。
文摘随机需求库存-路径问题(Stochastic Demand Inventory Routing Problem,SDIRP)即考虑随机需求环境下供应链中库存与配送的协调优化问题,是实施供应商管理库存策略过程中的关键所在,也是典型的NP难题之一。文章以具有硬时间窗约束的随机需求库存-路径问题(Stochastic Demand Inventory Routing Problem with Hard Time Windows,SDIRPHTW)为研究对象,将SDIRPHTW分解为直接配送的随机库存-路径问题和具有硬时间窗约束的路径优化问题两个子问题,并以最小化系统运行成本和用车数量为目标,设计了一个基于(s,S)库存策略和修正C-W节约法的启发式算法。最后,通过相应的数值算例验证了算法的有效性。
文摘文章针对软硬时间窗共存装卸一体化车辆路径问题(vehicle routing problem with simultaneous delivery and pickup under coexistence of soft and hard time windows,VRPSDPCSHTW)建立了包含车辆固定出行成本、运输成本和惩罚成本的数学模型,提出了一种混合离散粒子群优化算法。针对基本离散粒子群算法容易早熟收敛而陷入局部最优等问题,内嵌一种变邻域下降局域搜索方法,并在一定概率下执行以加强种群搜索能力,最后通过3个算例的仿真分析进行了算法验证。
文摘针对带硬时间窗的水果运输调度问题(Fruits in Vehicle Routing Problem with Hard Time Windows,FVRPHTW),联系实际应用中水果易腐的特性及运输途中的路况因素,采用蚁群算法、模拟退火算法和禁忌搜索算法来对FVRPHTW求解,并分析3种算法的优缺点。实例证明,这些算法对求解水果运输调度问题是可行的,模拟退火算法略优于其他两种算法。
基金国家高技术研究发展计划(863)(the National High-Tech Research and Development Plan of China under Grant No.2006AA06Z233)河北省科学技术研究与发展项目(the Science and Technologies Research Project of Hebei Province+1 种基金 China under Grant No.06213559)河北省教育厅科学研究计划项目(the Scientific Research Project of Department of Hebei Education of China under Grant No.2004454)