需求随机车辆调度问题的遗传算法研究  

Study of Genetic Algorithm for Vehicle Routing Problem with Stochastic Demands

作　　者：宋远清[1] 李永生[1] 梁慎清[1] 石小英[1] 

机构地区：[1]广东省气象信息中心,广东广州510080

出　　处：《计算机技术与发展》2009年第2期230-233,共4页Computer Technology and Development

基　　金：广东省重点工程计划项目(0809-0741GDG14818)

摘　　要：文中主要研究了需求随机的车辆调度问题,其中服务需求量满足二项式分布。首先分析了随机分布规律中分布参数与车辆调度服务失败的允许次数之间的关系,并在此基础上建立了需求随机的车辆调度问题数学模型,由于对允许服务失败的次数没有明确限制,使得模型能适应多种实际问题。针对建立的数学模型设计了问题求解的遗传算法,算法中对遗传算子进行了改进。数值计算结果表明:文中所提出的模型和设计的遗传算法能够有效地解决服务需求随机的车辆调度问题。The vehicle routing problems （VRP） with the stochastic demand is studied in this paper. The demand at service nodes is subjected to the binomial distribution, the influence of distribution parameter On the VRP with stochastic demand is analyzed firstly . On the basis of which the mathematical model to solve the problem is established. Because the number of route failures in the nod is not restricted, the new models are suitable for many kinds of practical problems, and then the genetic algorithm for the mathematical model is designed. Numerical calculation results indicate that the proposal model and algorithm can effectively solve vehicle routing problem in case of stochastic demand.

关 键 词：车辆调度问题 随机需求 遗传算法 二项式分布 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]