面向不同目标偏好的CVRP多目标模型及其求解方法  

Multi-objective model and methods for capacitated vehicle routing problem facing different target preference

作　　者：王超[1,2] 金淳[1] 韩庆平 

机构地区：[1]大连理工大学系统工程研究所,辽宁大连116024 [2]大连交通大学软件学院,辽宁大连116052 [3]美国佛罗里达大西洋大学信息技术及运作管理系

出　　处：《计算机应用研究》2016年第8期2270-2274,共5页Application Research of Computers

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

摘　　要：为了更有效地求解车辆路径问题、全方位地评估物流运输成本,提出了面向不同目标偏好的车载能力约束车辆路径问题的多目标优化模型(MOCVRPFDTP),其包括三种不同的偏好结构:装载与CVRP联合优化、绝对最小车辆数偏好及路径优化偏好。为了求解该模型,设计了算法架构及具体算法。在实验中,该模型及其求解方法对CVRP国际标准算例VRPLIB的测试结果显示了令人满意的性能,并且它更适用于实际CVRP问题的求解。This paper proposed a multi-objective model for capacitated vehicle routing problem （CVRP） fa^ing different target preference （MOCVRPFDTP） to solve CVRP more effectively and evaluate transportation cost comprehensively. There were three different preference structures in this model, which were joint optimization of loading and CVRP, absolute minimum vehi- cles preference, and path optimization preference. To solve this model, this paper constructed an algorithm framework with cor- responding algorithms. In experiments, the model and its solving methods display satisfactory performance in the testing for VR- PLIB, and they are more suitable for practical instance.

关 键 词：车载能力约束车辆路径问题 多目标优化 启发式算法 联合优化偏好 

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