|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2009年04 期
| 標(biāo)題 |
| 混沌蟻群算法在空車調(diào)整問題中的應(yīng)用(18 卷) |
| 英文標(biāo)題 |
| Application of Chaos Ant Colony Optimization Algorithm in railway empty wagon adjustment problem |
| 摘要 |
| 根據(jù)空車車流的混沌特性，以空車走行公里數(shù)最少為優(yōu)化目標(biāo)，提出了采用混沌蟻群算法求解空車調(diào)整問題。通過算例求解，驗(yàn)證了采用混沌蟻群算法求解空車調(diào)整問題的合理性和有效性。 |
| 作者 |
| 新聞作者:常 琦，崔 莉，解興申，王 棟 |
| 關(guān)鍵字 |
