|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2010年07 期
| 標(biāo)題 |
| 多出救點(diǎn)應(yīng)急調(diào)度研究(32 卷) |
| 英文標(biāo)題 |
| Study on Multi-depot Emergency Scheduling |
| 摘要 |
| 針對(duì)多出救點(diǎn)、多受災(zāi)點(diǎn)應(yīng)急物資調(diào)度問(wèn)題，在滿足時(shí)間約束條件下，建立以應(yīng)急出救總行程最短和應(yīng)急車(chē)輛數(shù)最少的雙目標(biāo)模型。在判斷各受災(zāi)點(diǎn)配送方式基礎(chǔ)上，考慮物流應(yīng)急中心供給量、車(chē)輛載重、時(shí)間限制，先用啟發(fā)式算法分派直送車(chē)輛的調(diào)度任務(wù)，再對(duì)剩余受災(zāi)點(diǎn)設(shè)計(jì)遺傳算法 |
| 作者 |
| 新聞作者:王玲玲 |
| 關(guān)鍵字 |
