协同车辆路径问题的模糊规划模型和算法  

Fuzzy programming model on collaborative vehicle route problem and algorithm

作　　者：温惠英[1] 孙博[1] 

机构地区：[1]华南理工大学土木与交通学院,广州510640

出　　处：《计算机应用研究》2011年第2期442-444,共3页Application Research of Computers

基　　金：国家自然科学基金资助项目(50578064);广东省科技攻关项目(2005A10101001)

摘　　要：属于不同公司的配送中心共享车队、仓储等资源为客户协同配送货物的协同车辆路径问题是一个热点问题。考虑车辆行驶时间和顾客服务时间的不确定性,建立以车辆配送总费用最小为目标的一类带时间窗协同车辆路径问题模糊规划模型,将其进行清晰化处理使之转换为一类确定性数学模型,采用魏明等人的自适应离散粒子群算法求解该问题。最后通过一个算例得出结论:同普通物流配送情形相比,该模型求解的总配送里程和费用均有效减少,验证了模型的正确性和合理性。Collaborative vehicle routing problem（CVRP）,where depots belonged to different companies serve their customers by sharing motorcades and warehousing to optimize total cost of collaborative transport,is a hot issue.This paper firstly built a fuzzy programming model on CVRP,considering time window,depot＇s capacity and maximum mileage of diffe-rent vehicles.And then converted into a deterministic one.The model was solved by self-adaptive discrete particle swarm optimization algorithm proposed by Wei Ming,et al.The experimental results show that the collaborative transport can significantly reduce total mileage and cost of the distribution compared to general logistics,which proves the model＇s correctness and reasonableness.

关 键 词：车辆路径问题 离散粒子群算法 协同运输 

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