|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2007年11 期
| 標(biāo)題 |
| 單車場大規(guī)模車輛路徑優(yōu)化問題研究(29 卷) |
| 英文標(biāo)題 |
| Study on Optimizing the Routing for Large Scale Vehicles in Single Depot |
| 摘要 |
| 針對傳統(tǒng)優(yōu)化技術(shù)在解決大規(guī)模車輛路徑問題中存在的缺陷，提出了一種解決單車場大規(guī)模車輛路徑優(yōu)化問題的綜合啟發(fā)式算法。首先，采用Sweep技術(shù)將區(qū)域分解成幾個子區(qū)。其次，設(shè)計了分區(qū)的禁忌搜索算法，并采用相鄰區(qū)域綜合優(yōu)化技術(shù)，提高了算法的全局搜索能力。仿真試驗(yàn)表明， |
| 作者 |
| 新聞作者:李 松，劉 興，李瑞彩 |
| 關(guān)鍵字 |
