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

物流配送车辆路径优化的模糊规划模型与算法
引用本文:蒋忠中,汪定伟. 物流配送车辆路径优化的模糊规划模型与算法[J]. 系统仿真学报, 2006, 18(11): 3301-3304,3312
作者姓名:蒋忠中  汪定伟
作者单位:1. 东北大学工商管理学院,辽宁,沈阳,110004
2. 东北大学信息科学与工程学院,辽宁,沈阳,110004
摘    要:将实际的物流配送网络描述为由配送中心和顾客两类节点构成的不完全无向图,并采用模糊数表示车辆行驶时间和顾客服务时间的不确定性,建立了物流配送车辆路径优化的模糊规划模型。为了求解上述模型,首先将模型进行清晰化处理,使之转化为一类确定性多设施车辆路径模型,然后设计了嵌入FLOYD算法的捕食搜索算法对之进行求解。通过仿真实例计算,并与遗传算法比较,取得了满意的结果。

关 键 词:物流配送  车辆路径  模糊规划  捕食搜索算法
文章编号:1004-731X(2006)11-3301-04
收稿时间:2005-07-04
修稿时间:2005-07-042005-10-11

Fuzzy Programming Model and Algorithm of Logistics Distribution Vehicle Routing Problem
JIANG Zhong-zhong,WANG Ding-wei. Fuzzy Programming Model and Algorithm of Logistics Distribution Vehicle Routing Problem[J]. Journal of System Simulation, 2006, 18(11): 3301-3304,3312
Authors:JIANG Zhong-zhong  WANG Ding-wei
Affiliation:1.School of Business Administration, Northeastern University, Shenyang, 110004, China; 2.School of Information Science and Engineering, Northeastern University, Shenyang, 110004, China
Abstract:The logistics distribution networks were described in a way of an incomplete undigraph, which consisted of two kinds of nodes, the distribution center nodes and the customer nodes. A fuzzy programming model was built to optimize logistics distribution vehicle routing problem, where vehicle travel time and customer service time are fuzzy. The model was firstly converted into a crisp multi-depot vehicle routing problem, and then it was solved by a predator search algorithm with FLOYD. Computation on simulation examples and comparison with genetic algorithm show the model and algorithm are effective.
Keywords:FLOYD
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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