Mathematical Modeling of the Problem of Locating Temporary Accommodation Centers and Assigning Victims After A Possible Earthquake To Safe Places and Solving Using Meta-Heuristic Algorithms

Introduction: earthquakes, one of the most important natural disasters of the earth, have always caused irreparable damage to human settlements in short time. one of the most important issues that we face after an earthquake is the transfer of earthquake victims and traumatized civilians to safe places and medical centers. the city of mashhad with different geographical faults and the presence of enormous religious, cultural, historical and industrial assets make mashhad the most dangerous city in terms of earthquake hazards. in the 9th district of this city, the existence of wornout structures along the narrow passages and the importance to save time in providing relief proves the need to locate temporary accommodation centers and allocate the injured to safe places.material and methods:the process of optimizing the accommodation of people includes 2 main steps 1) determining candidate locations for temporary accommodation 2) optimal allocation of population blocks (origin).the weight of criteria was calculated using the pairwise comparison method. then suitable places for deployment are identified. criterion in the form of giving a specific weight to each, in order to prepare the final map, is of importance. accordingly, the opinions of experts in the field of urban crisis management have been utilized. subsequently, using gams software and 7 superinnovative algorithms such as sa, pso, ica, aco, abc, fa, lafa.results:the average process time and cost of 7 algorithms out of ten random problems with 1000 repetitions, and an average of 10 execution times show, that the 3 algorithms aco, abc and lafa have lower cost and process time than the other metainnovative algorithms. therefore, we use the above three algorithms to solve the case studyconclusion: finally, the lafa optimization algorithm had obtained a better and more appropriate result due to its execution time and cost being less than the other two algorithms.