大规模突发事件下医疗资源配置建模及算法
|
摘要
以医疗急救资源的配置问题为建模核心,运用次梯度最优算法对传统的拉格朗日松弛算法进行了改进。经迭代的拉格朗日乘数和改进LocAlloc算法对其上下限值的间距进行优化,加快了收敛速度,而贪婪算法可以连续完成对未覆盖的需求点的搜寻,实现了有效的医疗急救资源最优覆盖解。通过汶川地震的大规模医疗急救案例验证了该模型及算法的有效性和可行性。
This paper focuses on the modeling of the resources location of medical rescue.At first,the traditional Lagrangean relaxation algorithm is improved by using subgradient optimization algorithm.The iterative Lagrangean multipliers and im-proved LocAlloc algorithm are used to realize the gap optimization between upper and lower bounds of Lagrangean relaxation algorithm and improve the convergence rate.In addition,the greedy algorithm locates the resources of medical rescue sequentially with an attempt to cover the most uncovered demand points and gets the optimal solution of maximal coverage. Eventually,mass medical rescue for Wenchuan earthquake is provided to demonstrate the validity and feasibility of this model and algorithm.
This paper focuses on the modeling of the resources location of medical rescue.At first,the traditional Lagrangean relaxation algorithm is improved by using subgradient optimization algorithm.The iterative Lagrangean multipliers and im-proved LocAlloc algorithm are used to realize the gap optimization between upper and lower bounds of Lagrangean relaxation algorithm and improve the convergence rate.In addition,the greedy algorithm locates the resources of medical rescue sequentially with an attempt to cover the most uncovered demand points and gets the optimal solution of maximal coverage. Eventually,mass medical rescue for Wenchuan earthquake is provided to demonstrate the validity and feasibility of this model and algorithm.
引文
[1]Marianov V,ReVelle C.The queueing maximal availability loca-tion problem:A model for the sitting of emergency vehicles[J].European Journal of Operational Research,1996,93:110-120.
[2]Jia H Z,Ordonez F,Dessouky M M.A modeling framework for facility location of medical services for large-scale emergencies[J].IIE Transactions,2007,39(1):41-55.
[3]Snyder L V.Facility location under uncertainty:A review[J].IIE Transactions,2006,38(7):547-564.
[4]Beasley J E,Chu P C.A genetic algorithm for the set covering problem[J].European Journal of Operational Research,1996,94(2):392-404.
[5]Al-Sultan K S,Al-Fawzan M A.A tabu search approach to the uncapacitated facility location problem[J].Annals of Operations Research,1999,86:91-103.
[6]Pirkul H,Schilling D A.The maximal covering location problem with capacities on total workload[J].Management Science,1991,37(2).
[7]Taillard E D.Heuristic methods for large centroid clustering problems[J].Journal of Heuristics,2003,9:51-73.
[8]Pirkul H,Schilling D.The capacitated maximal covering location problem with backup service[J].Annal of Operations Research,1989,18:141-154.
[9]Galvao R D,ReVelle C.A Lagrangean heuristic for the maximal covering location problem[J].European Journal of Operational Research,1996,88(1):114-123.
[10]Holmberg K,Ling J.A Lagrangean heuristic for the facility lo-cation problem with staircase costs[J].European Journal of Op-erational Research,1997,97(1):63-74.
[11]李福祥,徐朝霞,高国民,等.汶川地震灾区灾后3个月疾病谱的变化及医学救援分期[J].山东医药,2009,49(6):18-20.
[12]Lorena L,deSouza-Lopez L.GAs applied to computationally dif-ficult set covering problem[J].Journal of Operational Research Society,1977,48:440-445.
[2]Jia H Z,Ordonez F,Dessouky M M.A modeling framework for facility location of medical services for large-scale emergencies[J].IIE Transactions,2007,39(1):41-55.
[3]Snyder L V.Facility location under uncertainty:A review[J].IIE Transactions,2006,38(7):547-564.
[4]Beasley J E,Chu P C.A genetic algorithm for the set covering problem[J].European Journal of Operational Research,1996,94(2):392-404.
[5]Al-Sultan K S,Al-Fawzan M A.A tabu search approach to the uncapacitated facility location problem[J].Annals of Operations Research,1999,86:91-103.
[6]Pirkul H,Schilling D A.The maximal covering location problem with capacities on total workload[J].Management Science,1991,37(2).
[7]Taillard E D.Heuristic methods for large centroid clustering problems[J].Journal of Heuristics,2003,9:51-73.
[8]Pirkul H,Schilling D.The capacitated maximal covering location problem with backup service[J].Annal of Operations Research,1989,18:141-154.
[9]Galvao R D,ReVelle C.A Lagrangean heuristic for the maximal covering location problem[J].European Journal of Operational Research,1996,88(1):114-123.
[10]Holmberg K,Ling J.A Lagrangean heuristic for the facility lo-cation problem with staircase costs[J].European Journal of Op-erational Research,1997,97(1):63-74.
[11]李福祥,徐朝霞,高国民,等.汶川地震灾区灾后3个月疾病谱的变化及医学救援分期[J].山东医药,2009,49(6):18-20.
[12]Lorena L,deSouza-Lopez L.GAs applied to computationally dif-ficult set covering problem[J].Journal of Operational Research Society,1977,48:440-445.
版权所有：© 2023 中国地质图书馆 中国地质调查局地学文献中心