CAJ | 학술논문

大地震后的救灾中交通运输任务十分紧急,而地震对于道路的破坏使交通网络结构发生明显变动,无法实施原有的配送计划.前人的救灾运输路径优选算法只能解决运输的单发点问题,难以满足救灾中多处救援物资及时到达和救援物资量上的需要.为此,设计的优化算法将救援的单发点扩展为多发点,将各条路段的最大运输量考虑进去同时兼顾震后道路权值的修正,以此得出的最优路径,不仅能满足运输任务的及时性,同时又能满足运输量上的需求.
대지진후적구재중교통운수임무십분긴급,이지진대우도로적파배사교통망락결구발생명현변동,무법실시원유적배송계화.전인적구재운수로경우선산법지능해결운수적단발점문제,난이만족구재중다처구원물자급시도체화구원물자량상적수요.위차,설계적우화산법장구원적단발점확전위다발점,장각조로단적최대운수량고필진거동시겸고진후도로권치적수정,이차득출적최우로경,불부능만족운수임무적급시성,동시우능만족운수량상적수구.
Transportation assignment is very urgent during the earthquake rescue after large earthquake. Roads are always destroyed by the earthquake, which can change the structure of the traffic network. Therefore, the traffic volume can't be fulfilled. Furthermore, previous researchers' algorithm on shortcut can only solve single-start issue , but can' t solve Multi-start issue, let alone satisfying the traffic volume. So we switch the single-start issue to the Multi-start one, and take every road section' s maximal capacity into account, which can fulfill not only the goods' timeliness, but also the goods' adequacy.