具有区间参数的VRP及其改进的C-W节约算法  

VRP with Interval Parameters and Its Improved C-W Algorithm

作　　者：刘诚[1] 顾坤坤[1] 

机构地区：[1]中南大学数学科学与计算技术学院,湖南长沙410075

出　　处：《武汉理工大学学报（信息与管理工程版）》2010年第2期182-185,共4页Journal of Wuhan University of Technology：Information & Management Engineering

基　　金：国家自然科学基金资助项目(60804037)

摘　　要：在传统的车辆路径问题的基础上,针对配送中心到客户以及客户到客户之间的费用为区间参数时的车辆路径问题,建立了相应的数学模型。用可能度的区间数排序方法对费用区间参数进行排序并应用到C-W(clark-wright)节约算法中,提出了改进的C-W节约算法。通过算例验证了该算法的有效性和可行性。Based on the traditional vehicle routing problem（VRP）,a mathematical model was established when VRP of which the costs between distribution center to the clients and the clients to the clients were interval parameters was taken into consideration.The interval parameters were ranked based on possibility and it was applied in the Clark-Wright algorithm.A modified Clark Wright algorithm was then proposed.An example was posed to verify the availability and feasibility of the algorithm.

关 键 词：车辆路径问题 C-W节约算法 区间排序 可能度 

分 类 号：F506[经济管理—产业经济]