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

两种类型车辆随机需求路由问题
引用本文:刘浩,袁健,卢厚清.两种类型车辆随机需求路由问题[J].南京航空航天大学学报,2001,33(2):155-158.
作者姓名:刘浩  袁健  卢厚清
作者单位:1. 南京航空航天大学理学院
2. 南京航空航天大学机电学院
摘    要:主要研究两种类型车辆随机需求路由问题。因为两种类型车辆随机需求路由问题的处理不同于单类型车辆随机需求路由问题,引进了单位容积和路程的花费的新概念,在服务仅能失败一次的情况下,结合车辆的容积和最大服务结点数,根据平均花费和最大服务结点数之间的关系,得到了两个派车策略,节约了计算量,使得两阶级的模拟退火算法能更有效地解决问题。对需求为二项分布下的VRP(Vehicle routing prolem)问题作了数值实验,给出了派车方案和总的平均花费,得到了较好的结果。

关 键 词:模拟退火  两种类型车辆  VRP  随机需求路由
文章编号:1005-2615(2001)02-0155-04
修稿时间:2000年6月26日

Vehicle Routing Problem with Two Type Vehicles in the Case of Stochastic Demand
Liu Hao,Yuan Jian,Lu Houqing.Vehicle Routing Problem with Two Type Vehicles in the Case of Stochastic Demand[J].Journal of Nanjing University of Aeronautics & Astronautics,2001,33(2):155-158.
Authors:Liu Hao  Yuan Jian  Lu Houqing
Institution:Liu Hao 1) Yuan Jian 1) Lu Houqing 2)
Abstract:The vehicle routing problem (VRP) with two different types of vehicles in the case of stochastic demand is studied. Because this problem is different from the VRP with one type vehicle in the case of stochastic demand, this paper introduces a new conception, the cost of unit capacity and distance. Provided that there is only one chance of failure, we connect the capacity of the vehicles with the maximum nodes of service. According to the mean cost, the paper discusses the strategy of dispatching vehicles. On the basis of the relation between the maximum nodes of service, we get two strategies and decrease the amount of calculation, making the two phase simulated annealing algorithm solve the problem effectively. Under the binomial distribution the digital experiment is done. The experiment gives the dispatching plan and the total mean cost. A good result is obtained.
Keywords:vehicles  vehicle routing  stochastic demand  simulated annealing  two type vehicles
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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