您的位置:首页  > 论文页面

带容量约束的配送保障区域划分与配送路径集成优化

发表时间:2015-10-31  浏览量:1112  下载量:352
全部作者: 雷洪涛,祁振一
作者单位: 国防科技大学信息系统与管理学院;国防科技大学指挥军官基础教育学院
摘 要: 研究在考虑配送车辆容量约束情况下的配送保障区域划分与配送路径集成优化问题,针对不同需求建立3种集成优化数学模型,提出2种启发式求解算法,在实验中随机生成多组测试示例并进行详细对比分析。实验结果表明,K-means/扫描法求解效率优于K-means/节约法,不同函数目标具有不同特性,带容量约束条件使得各目标函数值增加。
关 键 词: 物流系统管理; 区域划分;路径优化;启发式算法
Title: Regional districting and integrated optimization of distribution routing with capacity constraints
Author: LEI Hongtao, QI Zhenyi
Organization: College of Information Systems and Management, National University of Defense Technology; College of Command Officer Education, National University of Defense Technology
Abstract: This paper studies the capacitated logistics districting routing problem. In the paper, three models of integration optimization are defined for different demands, and two heuristic algorithms are provided for the problem solving. In the extended experiments, several instances are randomly generated and the final results validate the effectiveness of the models and the heuristics. The experimental results confirm that the K-means/scanning method is superior to the K-means/saving method, different objective functions prompt the different characteristics, and the capacity constraint leads higher objective function values.
Key words: logistics system management; regional districting; routing; optimization heuristic algorithm
发表期数: 2015年10月第20期
引用格式: 雷洪涛,祁振一. 带容量约束的配送保障区域划分与配送路径集成优化[J]. 中国科技论文在线精品论文,2015,8(20):2149-2162.
 
0 评论数 0
暂无评论
友情链接