|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2007年11 期
| 標(biāo)題 |
| 基于連通可靠性的車輛路徑問題(29 卷) |
| 英文標(biāo)題 |
| Vehicle Routing Problem based on Connectivity Reliability |
| 摘要 |
| 物流配送車輛路徑問題(VRP)是一個(gè)NP-hard問題，很多求解方法僅考慮路網(wǎng)連通無窮大的情況，將其看成平均旅行時(shí)間問題，對(duì)于突發(fā)事件下造成路網(wǎng)擁堵情況下的車輛路徑問題很少涉及，對(duì)此結(jié)合蟻群算法，對(duì)突發(fā)事件下各路段的連通可靠性進(jìn)行比較后選擇合適路段通過，用以提高路網(wǎng) |
| 作者 |
| 新聞作者:唐連生，程文明，張則強(qiáng)，梁 劍 |
| 關(guān)鍵字 |
