Journal
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH
Volume 16, Issue 1, Pages 69-86Publisher
WILEY
DOI: 10.1111/j.1475-3995.2009.00660.x
Keywords
Location; covering; Leader-follower; Stackelberg equilibrium
Funding
- Natural Sciences and Engineering Research Council of Canada
Ask authors/readers for more resources
Consider a situation where p facilities need to be located by a leader, on the nodes of a network, to provide maximum coverage of demand generated at nodes of the network. At some point in the future it is expected that one of the links of the network will become unusable either due to a terrorist attack or a natural disaster ( by the follower). The follower's objective is which link to remove. The leader's objective is to cover the most demand following such a damage to a link. The problem is formulated and analyzed from the leader's perspective. An efficient approach to solving the follower's problem is constructed. The leader's problem is solved heuristically by an ascent algorithm, simulated annealing, and tabu search, using the efficient algorithm for the solution of the follower's problem. Computational experiments on 40 test problems ranging between 100 and 900 nodes and 5-200 facilities provided good results.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available