|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2006年08 期
| 標題 |
| 鐵路空車調整蟻群算法的研究(28 卷) |
| 英文標題 |
| Research on Ant Colony Optimization Algorithms for Railway Empty Wagons Distribution |
| 摘要 |
| 數量調配和網絡配流是空車調整的兩個核心問題。據以建立了空車調整協同優(yōu)化模型，并設計了相應的蟻群算法。共同徑路約束與模型是不協調的；對流約束不會對模型的最優(yōu)解產生影響，故而模型可以描述為線性整數規(guī)劃模型。同時，研究表明蟻群算法對求解空車調整問題具有一定優(yōu)勢 |
| 作者 |
| 新聞作者:閆海峰1， 譚云江2，朱健梅2 |
| 關鍵字 |
