سال انتشار: ۱۳۹۱

محل انتشار: کنفرانس بین المللی مدل سازی غیر خطی و بهینه سازی

تعداد صفحات: ۵

نویسنده(ها):

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

چکیده:

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