首页 | 官方网站   微博 | 高级检索  
     

一类非确定性车辆路径问题模型及其算法设计
引用本文:陈森,姜江,陈英武,沈永平. 一类非确定性车辆路径问题模型及其算法设计[J]. 计算机工程, 2011, 37(14): 186-188. DOI: 10.3969/j.issn.1000-3428.2011.14.062
作者姓名:陈森  姜江  陈英武  沈永平
作者单位:国防科学技术大学信息系统与管理学院,长沙,410073
摘    要:提出一类路网结构未定、需求随机的非确定性车辆路径问题(N-DVRP),通过分析路网结构变动和需求随机双重不确定性对车辆路径选择的影响,建立N-DVRP的优化模型,并设计求解该问题的动态加速自适应遗传算法.仿真实验结果验证了该问题模型及其求解算法的合理性和有效性.

关 键 词:非确定性车辆路径问题  随机需求  车辆调度  动态加速
收稿时间:2010-12-24

A Class of Non-deterministic Vehicle Routing Problem Model and Its Algorithm Design
CHEN Sen,JIANG Jiang,CHEN Ying-wu,SHEN Yong-ping. A Class of Non-deterministic Vehicle Routing Problem Model and Its Algorithm Design[J]. Computer Engineering, 2011, 37(14): 186-188. DOI: 10.3969/j.issn.1000-3428.2011.14.062
Authors:CHEN Sen  JIANG Jiang  CHEN Ying-wu  SHEN Yong-ping
Affiliation:(College of Information System & Management,National University of Defense Technology,Changsha 410073,China)
Abstract:This paper proposes a class of Non-deterministic Vehicle Routing Problem(N-DVRP) with stochastic demand and variable network structure. By analyzing the impact derived from uncertainty of stochastic demand and variable network structure, a N-DVRP model is constructed, and a Dynamical Accelerating Adaptive Genetic Algorithm(DA-AGA) is designed to solve the problem. Simulation results show the rationality and feasibility Of the model and algorithm proposed.
Keywords:Non-deterministic Vehicle Routing Problem(N-DVRP)  stochastic demand  vehicle schedule  dynamical accelerating
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程》浏览原始摘要信息
点击此处可从《计算机工程》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号