|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2010年01 期
| 標(biāo)題 |
| 運(yùn)用學(xué)習(xí)規(guī)則求解編組站靜態(tài)配流問(wèn)題的研究(32 卷) |
| 英文標(biāo)題 |
| Study on Resolving Static Wagon-flow Allocation by Using Learning Rules |
| 摘要 |
| 編組站靜態(tài)配流問(wèn)題需要制定配流方案，明確出發(fā)列車的編組內(nèi)容和車流來(lái)源。算法的思路是通過(guò)構(gòu)建網(wǎng)絡(luò)模型，將靜態(tài)配流問(wèn)題轉(zhuǎn)化為固定費(fèi)用的產(chǎn)銷平衡運(yùn)輸問(wèn)題，并將目標(biāo)函數(shù)轉(zhuǎn)化為求最小虛擬到達(dá)列車車輛數(shù)。首先設(shè)定虛擬到達(dá)列車并對(duì)其賦初值，把出發(fā)列車分為可欠軸與不可欠 |
| 作者 |
| 新聞作者:景 云，王慈光，王如義，唐建橋 |
| 關(guān)鍵字 |
