Optimizing system resilience

May 11th, 2015
Studypool Tutor
Price: $10 USD

Tutor description

Optimizing system resilience is concerned with the development of strategies to restore a system to normal operations as quickly and efficiently as possible following potential disruption. To this end, we present in this article a bilevel mixed integer linear program for protecting an uncapacitated median type facility network against worst-case losses, taking into account the role of facility recovery time on system performance and the possibility of multiple disruptions over time.

Word Count: 1153
Showing Page: 1/11
Maximal Covering Location Problem with Different Levels of interdiction6th International Conference of Iranian Operations Research Society May 8-9, 2013Research Center of Operations ResearchMaximal Covering Location Problem with DifferentLevels of interdictionAsefe Forghani1, M.Sc. student of Industrial Engineering, Ferdowsi University of Mashhad, asefe_forghani@yahoo.com Farzad Dehghanian, Assistant Professor, Department of Industrial Engineering, Ferdowsi University of MashhadAbstract: In this paper we introduce an interdiction problem for a maximal covering location problem in which an interdictor can attack each facility in different levels. The system includes real and dummy facilities in candidate locations and also identifies fortified facilities in order to maximize the covering of demand points. Dummy facility is a facility that cannot service demand points, but the interdictor considers every facility as a real one. He has different levels of weapons to interdict facilities. Each weapon reduces a specific amount of the covering radius. The interdictors objective is to identify an interdiction scenario with his limited resources in order to minimize the covering of the demand points. A bi-level formulation is presented to model this two-player game problem. To solve this problem we use a combination of exact linear programming optimization technique and comprehensive enumeration. To reduce the computing time a heuristic approach based on local search i

Review from student

Studypool Student
" Top quality work from this guy! I'll be back! "
Ask your homework questions. Receive quality answers!

Type your question here (or upload an image)

1828 tutors are online

Brown University

1271 Tutors

California Institute of Technology

2131 Tutors

Carnegie Mellon University

982 Tutors

Columbia University

1256 Tutors

Dartmouth University

2113 Tutors

Emory University

2279 Tutors

Harvard University

599 Tutors

Massachusetts Institute of Technology

2319 Tutors

New York University

1645 Tutors

Notre Dam University

1911 Tutors

Oklahoma University

2122 Tutors

Pennsylvania State University

932 Tutors

Princeton University

1211 Tutors

Stanford University

983 Tutors

University of California

1282 Tutors

Oxford University

123 Tutors

Yale University

2325 Tutors