Maximal Covering Location Problem with Different Levels of interdiction
6th International Conference of Iranian Operations Research Society
May 8-9, 2013
Research Center of Operations Research
Maximal Covering Location Problem with Different
Levels of interdiction
Asefe 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 Mashhad
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. 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 interdictor’s 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 is proposed.
Keywords: Maximal Covering Location Problem (MCLP), Multi- level interdiction, Fortification,
Dummy facility
1. INTRODUCTION
The first Maximum deterministic covering models was proposed by Church and ReVelle in 1974, named MCLP
[1]. In this paper the maximal covering system faces different levels of attack. Multi-level interdiction is applied in [2].
In this problem locating dummy facility and fortification of real facilities are two defensive strategies that the defender applies for maximizing the covered demand points. The
May 8-9, 2013
Research Center of Operations Research
Maximal Covering Location Problem with Different
Levels of interdiction
Asefe 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 Mashhad
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. 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 interdictor’s 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 is proposed.
Keywords: Maximal Covering Location Problem (MCLP), Multi- level interdiction, Fortification,
Dummy facility
1. INTRODUCTION
The first Maximum deterministic covering models was proposed by Church and ReVelle in 1974, named MCLP
[1]. In this paper the maximal covering system faces different levels of attack. Multi-level interdiction is applied in [2].
In this problem locating dummy facility and fortification of real facilities are two defensive strategies that the defender applies for maximizing the covered demand points. The
References: Operations Research. 2011. Vol. 74, Issue 3, pp. 281-310. levels," Annals of Operations Research. 2012. Vol. 201, Issue 1, p.