|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2010年09 期
| 標(biāo)題 |
| 運(yùn)輸路徑優(yōu)化蟻群算法問題研究(32 卷) |
| 英文標(biāo)題 |
| Research on ant colony algorithm for transport route optimization |
| 摘要 |
| 對(duì)于某一特定源點(diǎn)和目的地之間的車輛運(yùn)輸調(diào)度問題，建立基于風(fēng)險(xiǎn)、考慮成本和時(shí)變條件下的路徑優(yōu)化模型，采用蟻群算法的信息素更新策略，使邊上殘留信息素能夠正確反映時(shí)變網(wǎng)絡(luò)中邊上權(quán)值的變化，并結(jié)合遺傳算法，采取最優(yōu)個(gè)體交叉策略將蟻群每次遍歷后形成的解作為初始群種 |
| 作者 |
| 新聞作者:陳鋼鐵，帥 斌 |
| 關(guān)鍵字 |
