| 有时间窗约束非满载车辆调度问题的节约算法 |
| |
| 引用本文： | 宋伟刚,张宏霞,佟玲.有时间窗约束非满载车辆调度问题的节约算法[J].东北大学学报(自然科学版),2006,27(1):65-68. |
| |
| 作者姓名： | 宋伟刚 张宏霞 佟玲 |
| |
| 作者单位： | 东北大学,机械工程与自动化学院,辽宁,沈阳,110004;东北大学,机械工程与自动化学院,辽宁,沈阳,110004;东北大学,机械工程与自动化学院,辽宁,沈阳,110004 |
| |
| 基金项目： | 辽宁省普通高等学校优秀青年骨干教师基金 |
| |
| 摘 要： | 车辆调度问题(Vehicle Routing Problem,简称为VRP)是物流配送中广泛存在的一类问题,VRP属于强NP问题.在建立了带有时间窗的非满载的VRP问题的数学模型基础上,对启发式算法中的节约算法进行改进,设计出带时间窗的非满载的VRP问题的节约算法.通过对8个客户和13个客户算例的具体计算结果分析该算法的性能,研究表明:节约算法具有易于计算机实现,易于调整,方法易行、效果理想等优点,但在客户规模增加,解的空间增加后,其解的精度也随之下降.
|
| 关 键 词： | 车辆调度 节约算法 时间窗 配送路线 |
| 文章编号： | 1005-3026（2006）01-0065-04 |
| 收稿时间： | 2005-03-14 |
| 修稿时间： | 2005年3月14日 |
C-W Algorithm for Vehicle Routing Problem of Non-Full Loads with Time Windows |
| |
| SONG Wei-gang,ZHANG Hong-xia,TONG Ling.C-W Algorithm for Vehicle Routing Problem of Non-Full Loads with Time Windows[J].Journal of Northeastern University(Natural Science),2006,27(1):65-68. |
| |
| Authors: | SONG Wei-gang ZHANG Hong-xia TONG Ling |
| |
| Institution: | (1) School of Mechanical Engineering and Automation, Northeastern University, Shenyang 110004, China |
| |
| Abstract: | Vehicle Routing Problem(VRP) as a common problem in the logistics distribution is also a typical NP-hard problem.On the basis of developing a mathematic model for VRP of non-full loads with time windows,the C-W(Clark-Wright) algorithm used in heuristic algorithm is improved with a new C-W algorithm proposed for the VRP of non-full loads with time windows.The performance of this algorithm is analyzed through two different computational examples involving 8 customers and 13 customers.The results showed the new C-W algorithm is easy to implement and readjust on computers with ideal computational results available.However,the precision of the solution will be reduced if the number of customers increases with increasing solution spaces. |
| |
| Keywords: | vehicle routing C-W algorithm time windows distribution route |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《东北大学学报(自然科学版)》浏览原始摘要信息 |
| 点击此处可从《东北大学学报(自然科学版)》下载免费的PDF全文 |
|
