首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到18条相似文献,搜索用时 78 毫秒
1.
提出一种解决随机需求车辆路径问题(VRPSD)新方法。首先,采用预防性补救措施,建立了VRPSD模型,其次,为提高标准交叉熵(SCE)法性能,对用于更新Markov转移矩阵的路径,设计了根据分位值改变大小的自适应调整方法。仿真结果验证了该算法解决VRPSD的有效性。  相似文献   

2.
祝毅鸣  刘莹 《计算机测量与控制》2014,22(11):3732-37343743
传统的车辆路径规划方法无法有效地应对实时在线客户需求量随机变化的情形且收敛速度过慢,为了克服其缺点,设计了一种基于蒙特卡罗和重要性采样的交叉熵车辆路径规划方法;首先对随机动态车辆路径规划问题进行了数学建模,然后,描述了蒙特卡罗和交叉熵算法实现稀有事件概率估计的原理,并引入Tsallis熵实现对传统交叉熵的改进,采用蒙特卡罗多次采样获得的费用期望作为路径真实费用的估计值,通过交叉熵算法对重要性概率密度函数和分位数进行不断更新,以增加重要样本获取的概率,从而实现最优路径的获取;最后定义了具体的基于Tsallis熵的随机动态车辆路径规划方法;在MATLAB仿真工具下进行试验,结果表明文中方法能有效地解决随机动态车辆路径问题,与其它方法相比,具有收敛速度快和收敛精度高的优点,是一种有效的随机动态车辆路径规划方法。  相似文献   

3.
车辆路径问题已被研究证实为NP 难题,属于经典的复杂组合优化问题。首先建立了带货物权重的随机需求的车辆路径问题的模型;其次针对问题的性质,设计了一种基于交叉熵方法的算法对问题进行求解;最后计算结果验证了所提算法对于解决此类问题的有效性。  相似文献   

4.
目前国内外对随机需求多车辆路径问题的研究还很少,本文针对标准hopfield神经网络容易陷入局部极值点等问题,以总路程最短和总使用车辆数最少为目标,提出了一种基于退火策略的混沌神经网络的求解随机需求多车辆路径问题的算法,该算法既可以使混沌运动有足够长的进程以提高粗搜索性能,又可以随混沌动态的减弱使收敛速度加快。实验结果表明,该算法优化车辆路径更佳,是解决随机需求多车辆路径问题的有效方法。  相似文献   

5.
基于三帧差法和交叉熵阈值法的车辆检测   总被引:3,自引:1,他引:2       下载免费PDF全文
考虑运动车辆图像的时间相关性和空间相关性,采用三帧差分法与二维交叉熵阈值法相结合的方法对运动车辆进行检测。利用三帧差分法对视频图像进行运动车辆的检测,得到灰度图像的差分图像,使用二维交叉熵阈值法对差分图像进行二值化。实验结果证明,该方案能够检测出完整的运动车辆,具有良好的可靠性和鲁棒性,满足智能交通系统的要求。  相似文献   

6.
在对随机需求信息条件下的车辆路径问题进行策略分析基础上,提出解决此类问题的改进蚁群算法.分析对比不同策略下用蚁群算法优化的结果.其中给出机会约束下决策者的风险喜好对最终目标的影响.通过模拟实际随机需求的方法评价先验路径的优劣.与其它计算方法在同等条件下的比较证明所设计算法的优越性.同时得出对于不同统计特性的随机需求策略的选择方式.  相似文献   

7.
求解PCB钻孔机刀具路径规划的交叉熵方法   总被引:1,自引:0,他引:1  
工作刀具路径的优化程度是PCB钻孔机的重要性能指标,对其进行很好的优化有助于提高PCB设备的加工质量和加工速度.首先对刀具路径进行建模,然后对交叉熵算法进行描述并应用交叉熵方法对刀具路径进行求解.实验结果表明,选择交叉熵方法对环境进行建模简单、有效,在求解刀具路径规划方面具有一定的优势.  相似文献   

8.
对需求量满足二项分布的随机需求车辆路径问题进行了研究,在服务失败时采取允许部分服务的策略,并将嵌套分割算法与扫描算法相结合,给出了一种新的求解随机需求车辆路径问题的两阶段算法,数值试验验证了该算法的有效性。同时,该算法也拓展了车辆路径问题的算法空间。  相似文献   

9.
针对交叉熵阈值法的时间复杂性过大的不足,提出了基于目标函数最优化原理的交叉熵分割准则的快速迭代算法.大量的实验结果表明,提出的快速迭代算法是有效的.  相似文献   

10.
随机需求车辆路径问题(capacitated vehicle routing problem with stochastic demand,CVRPSD)是对带容量约束车辆路径问题(capacitated vehicle routing problem,CVRP)的扩展,需求不确定的特点使其较CVRP更复杂,对求解方法要求更高.基于先预优化后重调度思想,提出两阶段的混合变邻域分散搜索算法(variable neighborhood scatter search,VNSS)对该问题进行求解:预优化阶段构建随机机会约束规划模型,对客户点随机需求作机会约束确定型等价处理,生成最优预优化方案;重调度阶段采用新的点重优化策略进行线路调整,降低因失败点而产生的额外成本,减少对人工和车辆的占用.算例验证表明,随机机会约束模型和两阶段变邻域分散搜索算法在求解CVRPSD时较为有效,点重优化策略调整效果较佳.  相似文献   

11.
The capacitated vehicle routing problem with stochastic demands and time windows is an extension of the capacitated vehicle routing problem with stochastic demands, in which demands are stochastic and a time window is imposed on each vertex. A vertex failure occurring when the realized demand exceeds the vehicle capacity may trigger a chain reaction of failures on the remaining vertices in the same route, as a result of time windows. This paper models this problem as a stochastic program with recourse, and proposes an adaptive large neighborhood search heuristic for its solution. Modified Solomon benchmark instances are used in the experiments. Computational results clearly show the superiority of the proposed heuristic over an alternative solution approach.  相似文献   

12.
In this paper, we develop a paired cooperative reoptimization (PCR) strategy to solve the vehicle routing problem with stochastic demands (VRPSD). The strategy can realize reoptimization policy under cooperation between a pair of vehicles, and it can be applied in the multivehicle situation. The PCR repeatedly triggers communication and partitioning to update the vehicle assignments given real-time customer demands. We present a bilevel Markov decision process to model the coordination of a pair of vehicles under the PCR strategy. We also propose a heuristic that dynamically alters the visiting sequence and the vehicle assignment given updated information. We compare our approach with a recent cooperation strategy in the literature. The results reveal that our PCR strategy performs better, with a cost saving of around 20–30%. Moreover, embedding communication can save an average of 1.22%, and applying our partitioning method rather than an alternative can save an average of 3.96%.  相似文献   

13.
This paper studies a vehicle routing problem with soft time windows and stochastic travel times. A model is developed that considers both transportation costs (total distance traveled, number of vehicles used and drivers' total expected overtime) and service costs (early and late arrivals). We propose a Tabu Search method to solve this model. An initialization algorithm is developed to construct feasible routes by taking into account the travel time stochasticity. Solutions provided by the Tabu Search algorithm are further improved by a post-optimization method. We conduct our computational experiments for well-known problem instances. Results show that our Tabu Search method performs well by obtaining very good final solutions in a reasonable amount of time.  相似文献   

14.
针对城市物流配送中客户需求量不确定且时效性要求较高的特点,考虑客户需求量为随机变量且有时间窗的车辆路径优化问题,同时基于不同的信息化调度水平,考虑了配送失败时的三种补救策略。构建了机会约束混合整数规划数学模型并转化为等价的确定性模型进行求解。提出了含有多种算子的改进混合进化算法来求解该模型,并基于算例,验证了算法的优越性。同时,对模型的参数敏感性和三种补救策略下的风险成本进行了分析。结果表明,采用提前预测,实时反馈,即时派出新车的补救策略可以最大程度保证满足客户时间约束,同时还具有降低配送路程的经济优势。  相似文献   

15.
The Vehicle Routing Problem (VRP) has been thoroughly studied in the last decades. However, the main focus has been on the deterministic version where customer demands are fixed and known in advance. Uncertainty in demand has not received enough consideration. When demands are uncertain, several problems arise in the VRP. For example, there might be unmet customers’ demands, which eventually lead to profit loss. A reliable plan and set of routes, after solving the VRP, can significantly reduce the unmet demand costs, helping in obtaining customer satisfaction. This paper investigates a variant of an uncertain VRP in which the customers’ demands are supposed to be uncertain with unknown distributions. An advanced Particle Swarm Optimization (PSO) algorithm has been proposed to solve such a VRP. A novel decoding scheme has also been developed to increase the PSO efficiency. Comprehensive computational experiments, along with comparisons with other existing algorithms, have been provided to validate the proposed algorithms.  相似文献   

16.
简要回顾了车辆路径问题的禁忌搜索算法的发展现状,提出了一种改进的禁忌搜索算法。该算法将路径问题按不同的车辆-顾客分配结构分解成若干子问题,然后用禁忌搜索算法求解每个子问题,最后从所有子问题的最优解中选出全局最优解。理论分析和实验结果表明该算法比以往的算法有以下优点:拓展了搜索空间,提高了最优解的效果;是一种将问题进行空间分解的并行算法,可采用多台计算机同时运算以减少整体运行时间。  相似文献   

17.
对需求随机的分批配送车辆路径问题进行研究,建立带修正的随机规划模型。设计与局部搜索算法相结合的粒子群算法进行求解,算法使用整数编码和基于Bellman方程的允许分割需求的解码方法。并针对允许分批配送时导致的粒子速度、粒子自身最优位置、局部最优位置及全局最优位置等向量非零元素个数不同的问题,设计可行的统一向量长度的方法。算法在调整的Solomon算例测试集和调整的Christiansen和Lysgaard算例测试集上进行测算,测试有效参数、速度长度及速度更新方程。同时与现有结果进行对比,虽然计算效率较低,但在测试的26个算例中,有14个算例的最优解得到更新,剩余的算例最优解与现有最优解相差小于1%。  相似文献   

18.
This paper describes a stochastic short sea shipping problem where a company is responsible for both the distribution of oil products between islands and the inventory management of those products at consumption storage tanks located at ports. In general, ship routing and scheduling is associated with uncertainty in weather conditions and unpredictable waiting times at ports. In this work, both sailing times and port times are considered to be stochastic parameters. A two-stage stochastic programming model with recourse is presented where the first stage consists of routing, loading and unloading decisions, and the second stage consists of scheduling and inventory decisions. The model is solved using a decomposition approach similar to an L-shaped algorithm where optimality cuts are added dynamically, and this solution process is embedded within the sample average approximation method. A computational study based on real-world instances is presented.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号