A New bi-objective Linear Model for Defensive Maximal Covering Problem on a Network
Publish Year: 1391
Type: Conference paper
Language: English
View: 1,401
This Paper With 5 Page And PDF Format Ready To Download
- Certificate
- I'm the author of the paper
Export:
Document National Code:
ICNMO01_111
Index date: 9 March 2013
A New bi-objective Linear Model for Defensive Maximal Covering Problem on a Network abstract
Defensive maximal covering problem (DMCP) is a typical problem in the context of competitive facility location problem. In this problem, a leader locates p facilities to the nodes of a network in order to provide maximum coverage of demand generated at nodes of the network. A follower decides that one of the network links become unusable either due to an attack or a disaster. The follower wants to remove this link and the leader wants to coverthe most demand following such damage to a link. In this paper we proposed a new model, based on backup coverage theory. To do this, we define a new objective as maximization of the total demand covered twice. Thus we obtain a bi-objective linear programming model forDMCP which is an extension of the model introduced in
A New bi-objective Linear Model for Defensive Maximal Covering Problem on a Network Keywords:
A New bi-objective Linear Model for Defensive Maximal Covering Problem on a Network authors
H. R. Maleki
Department of Basic Sciences, Shiraz University of Technology, I. R. of Iran
R Khanduzi
Department of Basic Sciences, Shiraz University of Technology, I. R. of Iran