|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2007年03 期
| 標(biāo)題 |
| 基于混合禁忌搜索算法的物流配送路徑優(yōu)化問題研究(29 卷) |
| 英文標(biāo)題 |
| Study on Optimization of Logistics Distribution Route Based on Mixed Tabu Search Algorithm |
| 摘要 |
| 在對配送路徑優(yōu)化問題進(jìn)行描述的基礎(chǔ)上，建立物流配送路徑優(yōu)化問題的數(shù)學(xué)模型，提出了一種求解車輛路徑問題的混合禁忌搜索算法。在該混合算法中，通過車輛—任務(wù)分配結(jié)構(gòu)的劃分將大規(guī)模問題拆分成可并行計(jì)算的若干小規(guī)模問題，減少了算法的計(jì)算時間。并通過理論分析和仿真算 |
| 作者 |
| 新聞作者:李 松，劉 興，李瑞彩 |
| 關(guān)鍵字 |
