|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2003年02 期
| 標(biāo)題 |
| 用蟻群算法求解類TSP問(wèn)題的研究(25 卷) |
| 英文標(biāo)題 |
| Study on Ant Colony System Applied to Quasi-TSP |
| 摘要 |
| 鐵路運(yùn)輸調(diào)度問(wèn)題能否很好解決對(duì)于鐵路運(yùn)輸公司至關(guān)重要，旅行商問(wèn)題（簡(jiǎn)稱TSP）經(jīng)常被用來(lái)研究運(yùn)輸調(diào)度問(wèn)題。根據(jù)某化工集團(tuán)鐵路運(yùn)輸公司的生產(chǎn)實(shí)際，提出了“類TSP”問(wèn)題，但由于“類TSP”和TSP有很大區(qū)別，以前求解TSP的優(yōu)化算法不能直接用于“類TSP”的求解。利用蟻群算 |
| 作者 |
| 新聞作者:趙清江，邵之江，錢積新 |
| 關(guān)鍵字 |
