CAJ | 학술논문

以死亡人数最少化为目标，研究大规模伤亡事件应对流程的前摄性调度优化问题。首先，使用伤情等级和伤情随机转化的马尔可夫链，建立伤员死亡概率与伤员处置时间的函数关系。随后，将研究问题转化为柔性作业车间静态调度问题，并设计遗传算法求解。最后用一个随机算例对算法进行仿真，结果表明：该算法可行有效；与现有研究中救援时间最短化的调度方法相比，伴随着可接受的救援时间跨度增加，该方法可大幅降低救援过程中的死亡人数。本文研究有助于决策者优化应急救援过程，有效减少死亡人员数量。
이사망인수최소화위목표，연구대규모상망사건응대류정적전섭성조도우화문제。수선，사용상정등급화상정수궤전화적마이가부련，건립상원사망개솔여상원처치시간적함수관계。수후，장연구문제전화위유성작업차간정태조도문제，병설계유전산법구해。최후용일개수궤산례대산법진행방진，결과표명：해산법가행유효；여현유연구중구원시간최단화적조도방법상비，반수착가접수적구원시간과도증가，해방법가대폭강저구원과정중적사망인수。본문연구유조우결책자우화응급구원과정，유효감소사망인원수량。
This paper investigates proactive scheduling optimization problem of emergency response , with fatalities minimization as objective .First, triage levels and its stochastic Markov Chain are introduced , to establish func-tion from rescued time to probability of death .Then we translate proposed problem to a proactive job shop sched-uling problem, and design a genetic algorithm to find solution .Finally, a simulation experiment is done , and it shows: the algorithm works feasibly and efficiently; although makespan increases , the proposed scheduling reduces number of fatalities significantly comparing to min-makespan scheduling .The research in this paper can provide decision supports for the organization and coordination of emergency response .