首页 | 本学科首页   官方微博 | 高级检索  
     

一种解决多库房随机车辆路径问题方法
引用本文:娄山佐. 一种解决多库房随机车辆路径问题方法[J]. 系统仿真学报, 2007, 19(4): 879-882
作者姓名:娄山佐
作者单位:山东大学控制科学与工程学院,济南,250061
摘    要:基于分解协调技术(DCT),根据启发式法,将用户分解为耦合和非耦合用户。针对解决此问题,使用传统协调参数收敛性差的问题,应用遗传算法(GA)设计了协调参数。对解决子系统随机需求车辆路径问题,为提高交叉熵法性能,对用于更新Markov转移矩阵的路径,设计了根据分位值改变大小的自适应调整方法。仿真结果验证了该算法的有效性。

关 键 词:随机规划  位置-路径  遗传算法  交叉熵  分解协调
文章编号:1004-731X(2007)04-0879-04
收稿时间:2005-12-09
修稿时间:2006-05-31

Method for Solving Multi-depot Stochastic Vehicle Routing Problems
LOU Shan-zuo. Method for Solving Multi-depot Stochastic Vehicle Routing Problems[J]. Journal of System Simulation, 2007, 19(4): 879-882
Authors:LOU Shan-zuo
Affiliation:School of Control Science and Engineering, Shandong University, Jinan 250061, China
Abstract:Based on decomposition and coordination technology(DCT),the customers were firstly divided into coupling and non-coupling customers by a heuristic algorithm.Secondly,due to the bad convergence while using traditional DCT to solve the problems,the coordination values were designed by using genetic algorithm(GA).While dealing with the vehicle routing problems with stochastic demands for each subsystem,in order to improve the cross-entropy algorithm's performance,an adaptive adjustment scheme was developed for the routes used to update Markov transition matrix in terms of the improvement level of quintiles.Simulation results prove the validity of the proposed method.
Keywords:stochastic programming  location-routing  genetic algorithm  cross-entropy  decomposition and coordination.
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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