| 车间配送路径优化的研究 |
| |
| 引用本文： | 黄志刚,林凤涛. 车间配送路径优化的研究[J]. 华东交通大学学报, 2007, 24(4): 111-114 |
| |
| 作者姓名： | 黄志刚 林凤涛 |
| |
| 作者单位： | 华东交通大学,机电工程学院,江西,南昌,330013;华东交通大学,机电工程学院,江西,南昌,330013 |
| |
| 摘 要： | 路径优化问题是车间配送系统中重要的环节之一,最短路径的选择决定着配送效率.但随着问题规模的扩大,很难精确求解.实验表明采用蚁群算法来解决路径搜索问题,能有效地发现最优解.
|
| 关 键 词： | 路径优化 蚁群算法 最优解 |
| 文章编号： | 1005-0523（2007）04-0011-04 |
| 收稿时间： | 2007-02-16 |
| 修稿时间： | 2007-02-16 |
The Research on Path Optimization of Workshop Distribution Route |
| |
| HUANG Zhi-gang,LIN Feng-tao. The Research on Path Optimization of Workshop Distribution Route[J]. Journal of East China Jiaotong University, 2007, 24(4): 111-114 |
| |
| Authors: | HUANG Zhi-gang LIN Feng-tao |
| |
| Affiliation: | School of Mechanical ancl Electronical Engineering, East China Jiaotong University, Nanchang 330013, China |
| |
| Abstract: | Path optimization is one of the most important problems in workshop distribution route since shortest path decision is essential for the efficiency of delivery.But it is difficult to gain the precise answer with the problem scale magnifying.The experimental calculation results demonstrate that the optimal solution to the path searching problem can be easily obtained by using Ant Colony Algorithm. |
| |
| Keywords: | path optimization ant colony algorithm optimal solution |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《华东交通大学学报》浏览原始摘要信息 |
|
点击此处可从《华东交通大学学报》下载全文 |
