|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2008年09 期
| 標(biāo)題 |
| 應(yīng)急物流配送問題的蟻群聚類算法研究(30 卷) |
| 英文標(biāo)題 |
| Research on Ant Colony Clustering Algorithm for the Problem of Emergency Logistics Distribution |
| 摘要 |
| 提出了一種用于解決突發(fā)事件下，物流配送多目標(biāo)優(yōu)化問題的蟻群聚類優(yōu)化算法。突發(fā)事件下的物流配送規(guī)劃一般包含兩方面內(nèi)容，將救災(zāi)物資運往受災(zāi)地區(qū)和將災(zāi)區(qū)的傷員及時送至各醫(yī)療點。將多目標(biāo)問題轉(zhuǎn)化為單目標(biāo)問題，結(jié)合蟻群的墓地構(gòu)造行為特點，利用改進(jìn)LF蟻群聚類模型，以 |
| 作者 |
| 新聞作者:唐連生，程文明，梁 劍，張則強 |
| 關(guān)鍵字 |
