|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2007年01 期
| 標(biāo)題 |
| 單線區(qū)間列車最優(yōu)運(yùn)行次序的量子遺傳算法(16 卷) |
| 英文標(biāo)題 |
| Quantum Genetic Algorithm for obtaining optimal schedule of trains on single track line division |
| 摘要 |
| 討論在單線區(qū)間上以車站接續(xù)時(shí)間最好為目標(biāo)的優(yōu)化列車運(yùn)行次序問題。首先建立該問題的數(shù)學(xué)模型，然后結(jié)合排序理論給出求解該問題的一個(gè)量子遺傳算法，闡述算法的實(shí)現(xiàn)方法。通過對(duì)某車站實(shí)際運(yùn)行圖實(shí)例計(jì)算結(jié)果表明，該算法能在較短的時(shí)間內(nèi)以97 %以上的概率得到最優(yōu)解，所得 |
| 作者 |
| 新聞作者:何奉道1，何冬昀2 |
| 關(guān)鍵字 |
