|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2010年01 期
| 標(biāo)題 |
| 基于啟發(fā)式函數(shù)蟻群算法的VRP優(yōu)化研究(32 卷) |
| 英文標(biāo)題 |
| Research on VRP Optimization based on Heuristic Function of the Ant Colony Algorithm |
| 摘要 |
| 車輛路徑問題是一個(gè)NP難題，蟻群算法是求解諸如車輛路徑安排等組合優(yōu)化問題的有效工具，為此利用啟發(fā)式函數(shù)對(duì)傳統(tǒng)的蟻群算法進(jìn)行改進(jìn)和優(yōu)化。并通過實(shí)例對(duì)該方法進(jìn)行檢驗(yàn)，其結(jié)果顯示，啟發(fā)式函數(shù)蟻群算法的性能，優(yōu)于傳統(tǒng)的蟻群算法。 |
| 作者 |
| 新聞作者:鄭小雪 |
| 關(guān)鍵字 |
