Maximal Covering Location Problem with Different Levels of interdiction

Maximal Covering Location Problem with Different Levels of interdiction

May 6th, 2015

Studypool Tutor

Price: $10 USD

Tutor description

Abstract: 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

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