首页 | 官方网站   微博 | 高级检索  
     

面向不同目标偏好的CVRP多目标模型及其求解方法*
引用本文:王超,金淳,韩庆平. 面向不同目标偏好的CVRP多目标模型及其求解方法*[J]. 计算机应用研究, 2016, 33(8)
作者姓名:王超  金淳  韩庆平
作者单位:大连理工大学 系统工程研究所,大连理工大学 系统工程研究所,美国佛罗里达大西洋大学 信息技术及运作管理系,FL ,USA
基金项目:国家自然科学基金资助项目
摘    要:为了更有效地求解车辆路径问题、全方位地评估物流运输成本,本文提出了面向不同目标偏好的车载能力约束车辆路径问题(CVRP)的多目标优化模型(MOCVRPFDTP),其包括三种不同的偏好结构:装载与CVRP联合优化、绝对最小车辆数偏好及路径优化偏好。为了求解该模型,本文设计了算法架构及具体算法。在实验中,该模型及其求解方法对CVRP国际标准算例VRPLIB的测试结果,显示了令人满意的性能,并且它更适用于实际CVRP问题的求解。

关 键 词:车载能力约束车辆路径问题(CVRP)   多目标优化   启发式算法  联合优化偏好
收稿时间:2015-03-26
修稿时间:2016-06-20

Multi-objective Model and Methods for Capacitated Vehicle Routing Problem Facing Different Target Preference
WANG Chao,JIN Chun and Jim C. Han. Multi-objective Model and Methods for Capacitated Vehicle Routing Problem Facing Different Target Preference[J]. Application Research of Computers, 2016, 33(8)
Authors:WANG Chao  JIN Chun  Jim C. Han
Affiliation:Institute of Systems Engineering,Dalian University of Technology,,Department of Information Technology and Operations Management,Florida Atlantic University Boca Raton,FL ,USA
Abstract:This paper proposed a multi-objective model for capacitated vehicle routing problem (CVRP) facing different target preference (MOCVRPFDTP) to solve CVRP more effectively and evaluate transportation cost comprehensively. There are three different preference structures in this model, which are joint optimization of loading and CVRP, absolute minimum vehicles preference, and path optimization preference. To solve it, we constructed an algorithm framework with corresponding algorithms. In experiments, the model and its solving methods display satisfactory performance in the testing for VRPLIB, and they are more suitable for practical instance.
Keywords:Capacitated vehicle routing problem (CVRP)   multi-objective optimization   heuristic algorithms   joint optimization preference
点击此处可从《计算机应用研究》浏览原始摘要信息
点击此处可从《计算机应用研究》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号