|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2010年03 期
| 標(biāo)題 |
| 在時間窗條件下應(yīng)急物資運輸路徑優(yōu)化問題研究(32 卷) |
| 英文標(biāo)題 |
| Research on Route Optimization of Emergent Materials Transportation under Condition of Time Window |
| 摘要 |
| 應(yīng)急物資調(diào)運主要是應(yīng)急車輛在最短的時間內(nèi)把應(yīng)急物資運送到需求點，其研究的核心是最短路徑選擇問題。通過對研究問題的描述，界定其中交通網(wǎng)絡(luò)的道路和節(jié)點均帶有禁止時間窗，模型目標(biāo)是通過路徑選擇最小化調(diào)運時間，鑒于模型的組合屬性，利用動態(tài)規(guī)劃和標(biāo)號法算法對設(shè)計問 |
| 作者 |
| 新聞作者:陳鋼鐵，帥 斌 |
| 關(guān)鍵字 |
