|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2003年01 期
| 標(biāo)題 |
| 基于遺傳算法的列車運(yùn)行圖初始布點(diǎn)配對(duì)模型(12 卷) |
| 英文標(biāo)題 |
| Model of first-distributed paired-train based on genetic algorithm |
| 摘要 |
| 單線區(qū)段列車運(yùn)行圖初始布點(diǎn)是列車運(yùn)行圖優(yōu)化的一個(gè)關(guān)鍵問題。首先討論了其約束條件，然后建立了一個(gè)基于遺傳算法的列車運(yùn)行圖初始布點(diǎn)模型——配對(duì)運(yùn)行模型，并對(duì)該模型進(jìn)行了分析。 |
| 作者 |
| 新聞作者:劉愛江，許長(zhǎng)楓，何大可 |
| 關(guān)鍵字 |
