主管:中国科学院
主办:中国优选法统筹法与经济数学研究会
   中国科学院科技战略咨询研究院

Chinese Journal of Management Science ›› 2014, Vol. 22 ›› Issue (7): 131-139.

• Articles • Previous Articles     Next Articles

Emergency Network Model and Algorithm Based on Min-Max Regret Robust Optimization

ZHANG Ling1, CHEN Tao2, HUANG Jun2   

  1. 1. Department of Economics and Management, Huizhou University, Guangdong 516007, China;
    2. School of Mathematica Science, University of Chinese Academy of Sciences, Beijing 100049, China
  • Received:2013-02-04 Revised:2013-09-01 Online:2014-07-20 Published:2014-07-24

Abstract: After emergency, rescue process is represented by two stage. First stage is to start the emergency rescue network, including building temporary distribution centers, allocating reasonable emergency resource to assure rescue process working smoothly. The second stage is to dispatch emergency resource from temporary distribution centers to demand points. A min-max regret robust emergency network model is proposed for natural disasters under uncertainty, taking the second stage as auxiliary decision. Uncertain information is random and represented by finite scenarios. The proposed model is solved using scenario relaxation algorithm. Finally, a case study is proposed to highlight efficiency of the proposed model and solution algorithm.

Key words: emergency rescue network plan, uncertain information, two-stage programing, min-max regret criterion, robust optimization, scenairio relaxation

CLC Number: