CAJ | 학술논문

对一个存在最大风险约束的运输网络而言，由于各路段的固有风险不同，使得运输网络的总风险会随着垃圾运输车辆在不同路段的行驶变化而变化。受网络总风险的约束，运输网络所能接纳的运输车辆总数也将处于动态变化的状态。文中针对任意起点存在运输车辆进入运输网络需求时，如何进行风险分配的问题，构造了网络优化的数学模型，并给出了模型求解的算法及不同优化策略比较分析。
대일개존재최대풍험약속적운수망락이언，유우각로단적고유풍험불동，사득운수망락적총풍험회수착랄급운수차량재불동로단적행사변화이변화。수망락총풍험적약속，운수망락소능접납적운수차량총수야장처우동태변화적상태。문중침대임의기점존재운수차량진입운수망락수구시，여하진행풍험분배적문제，구조료망락우화적수학모형，병급출료모형구해적산법급불동우화책략비교분석。
For a transport network existing the biggest risk constraint, the inherent risk of each section is different, which makes the total risk of the transport network vary with the garbage transport vehicles travelling in the different section. Due to the constraint of the total risk of the transport network, the total number of garbage transport vehicles what the transport network can accommodate is in a dynamic state. Aiming at the problem of how to conduct risk al-location when a starting point exists a need which transport vehicles enter the transport network, this paper constructs the mathematical model of network optimization and gives the solving algorithm of the model and the comparative analysis of different optimization strategy.