| 注册
首页|期刊导航|计算机应用研究|面向不同目标偏好的 CVRP多目标模型及其求解方法

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

王超 金淳 韩庆平

计算机应用研究2016,Vol.33Issue(8):2270-2274,5.
计算机应用研究2016,Vol.33Issue(8):2270-2274,5.DOI:10.3969/j.issn.1001-3695.2016.08.006

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

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

王超 1金淳 2韩庆平1

作者信息

  • 1. 大连理工大学 系统工程研究所,辽宁 大连 116024
  • 2. 大连交通大学 软件学院,辽宁 大连 116052
  • 折叠

摘要

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 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.

关键词

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

Key words

capacitated vehicle routing problem (CVRP)/multi-objective optimization/heuristic algorithms/joint optimi-zation preference

分类

信息技术与安全科学

引用本文复制引用

王超,金淳,韩庆平..面向不同目标偏好的 CVRP多目标模型及其求解方法[J].计算机应用研究,2016,33(8):2270-2274,5.

基金项目

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

计算机应用研究

OA北大核心CSCDCSTPCD

1001-3695

访问量0
|
下载量0
段落导航相关论文