| 普零货物多车配装优化问题的遗传算法 |
| |
| 引用本文： | 卜雷,尹传忠,蒲云.普零货物多车配装优化问题的遗传算法[J].科技通报,2004,20(6):497-500. |
| |
| 作者姓名： | 卜雷 尹传忠 蒲云 |
| |
| 作者单位： | 1. 西南交通大学,交通运输学院,成都,610031
2. 西南交通大学,研究生院,成都,610031 |
| |
| 摘 要： | 普零货物多车配装优化问题属NP-hard问题，随着问题规模的不断增大，传统的优化算法在求解过程中会产生时间维数灾难问题．提出在铁路货物运输中应用遗传算法确定普零货物合理的多车配装方式，结合货物配装过程中指令性优先装车的要求采用巧妙的个体编码方式以确保其在遗传操作过程中的有效性，同时结合装载容积和装载质量约束构造恰当的适应函数，并通过实例计算对文中提出算法的可行性和有效性进行验证．
|
| 关 键 词： | 货物配装 遗传算法 优化 多车 |
| 文章编号： | 1001-7119(2004)06-0497-04 |
| 修稿时间： | 2003年9月20日 |
Genetic Algorithm for Optimal Problem of General Piece Goods Arranged in Groups in a Few Railway Wagons |
| |
| BU Lei,YIN Chuan-zhong,PU Yun.Genetic Algorithm for Optimal Problem of General Piece Goods Arranged in Groups in a Few Railway Wagons[J].Bulletin of Science and Technology,2004,20(6):497-500. |
| |
| Authors: | BU Lei YIN Chuan-zhong PU Yun |
| |
| Institution: | BU Lei~1,YIN Chuan-zhong~1,PU Yun~2 |
| |
| Abstract: | Optimal problem of general piece goods arranged in groups in a few railway wagons is NP-hard problem. And when traditional optimization method is used to resolve it, a time-dimensional disaster problem will emerge along with broad scale. Subject of this paper is that a optimal problem of general piece goods arranged in groups in a few railway wagons could be resolved by genetic algorithm, and reasonable coding insuring its validity during inheritance combined with first load and evaluation function combined with volume and gravity are used to make it effective and feasible. |
| |
| Keywords: | Arranging goods in groups genetic algorithm Optimization a few railway wagons |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
