An implicit enumeration algorithm for the hub interdiction median problem with fortification

Nader Ghaffarinasab and Reza Atayi

European Journal of Operational Research, 2018, vol. 267, issue 1, 23-39

Abstract: Hubs are intermediate facilities that play a pivotal role in efficient functioning of transportation and telecommunication systems. Like any other service infrastructure, hub facilities can be subject to natural or man-made disruptions after installation. In this paper, we address the problem of optimally allocating protective resources among a set of p existing hub facilities in such a manner that the damage inflicted by an intentional strike against the service system is minimized. Casting the problem as a Stackelberg game, the leader (i.e., the network protector or defender) fortifies q of the p operating hubs in order to minimize the impact of the upcoming strike, whereas the follower (i.e., the attacker) tries to identify and interdict r of the p−q unprotected hubs that their loss would diminish the network performance the most. A bilevel programming formulation is presented to model the problem and using a min-max approach the model is reduced to a single level mixed integer programming (MIP) model. Furthermore, an efficient exact solution algorithm based on implicit enumeration is proposed for solving the problem. Extensive computational experiments show the capability of the proposed algorithm to obtain the optimal solutions in short computational times. Some managerial insights are also derived based on the obtained numerical results.

Keywords: Transportation; Hub interdiction problem; Fortification; Bilevel programming; Implicit enumeration (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (11)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221717310469
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:267:y:2018:i:1:p:23-39

DOI: 10.1016/j.ejor.2017.11.035

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().