Computational & Technology Resources
an online resource for computational,
engineering & technology publications |
|
Civil-Comp Proceedings
ISSN 1759-3433 CCP: 103
PROCEEDINGS OF THE THIRD INTERNATIONAL CONFERENCE ON SOFT COMPUTING TECHNOLOGY IN CIVIL, STRUCTURAL AND ENVIRONMENTAL ENGINEERING Edited by: Y. Tsompanakis
Paper 16
Optimal Restoration Scheduling considering Group Priority of Restoration Works for Uncertain Environments H. Furuta1, Y. Nomura2, K. Nakatsu3, K. Ishibashi4 and M. Uchida4
1Department of Informatics, Kansai University, Japan
H. Furuta, Y. Nomura, K. Nakatsu, K. Ishibashi, M. Uchida, "Optimal Restoration Scheduling considering Group Priority of Restoration Works for Uncertain Environments", in Y. Tsompanakis, (Editor), "Proceedings of the Third International Conference on Soft Computing Technology in Civil, Structural and Environmental Engineering", Civil-Comp Press, Stirlingshire, UK, Paper 16, 2013. doi:10.4203/ccp.103.16
Keywords: restoration schedule, genetic algorithm, .
Summary
The purpose of the research described in this paper is to propose an early restoration for lifeline systems after earthquake disasters. Here, two issues are focused on, the first is an allocation problem that determines which groups will restore which disaster places, and the second is such a scheduling problem i.e. what order is the best for the restoration. In order to solve the two problems simultaneously, a genetic algorithm (GA) is applied. However, since road networks after earthquake disasters have an uncertain environment, the restoring works do not progress on schedule. Therefore, the method that can formulate the flexible schedule according to changes in situations in an uncertain environment is needed. In this paper, the priority of an allocation that determines which groups will restore which disaster locations is optimized subject to uncertain environments. Then, the restoration schedules are adapted to various situations. An attempt is made to develop a decision support system of the optimal restoration scheduling by using the proposed method. purchase the full-text of this paper (price £20)
go to the previous paper |
|