Hub interdiction problem variants: Models and metaheuristic solution algorithms

Nader Ghaffarinasab and Alireza Motallebzadeh

European Journal of Operational Research, 2018, vol. 267, issue 2, 496-512

Abstract: Hub location problem (HLP) is one of the strategic problems encountered in designing transportation and telecommunication networks. Regardless of the considered objective in design of hub networks, such as cost minimization or service level maximization, the located hubs can be subject to natural or intentional disruptions after installation. In this paper, we address the multiple allocation p-hub median, p-hub maximal covering, and p-hub center problems under intentional disruptions. In each case, the problem is considered as a Stackelberg game where the leader locates p hubs to optimize his/her objective function, whereas the follower tries to identify and interdict r hubs that their loss would diminish the network performance the most. Bilevel and single level mathematical formulations are presented to model the problem from the leader’s and the follower’s perspectives. Furthermore, efficient Simulated Annealing (SA) heuristics are proposed for solving the problems. Extensive computational experiments show the capability of the proposed SA algorithms to obtain the optimal solutions in short computational times. Some managerial insights are also derived based on the obtained numerical results.

Keywords: Location; Hub interdiction problems; Competitive models; Bilevel programming; Simulated annealing (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S037722171731069X
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:2:p:496-512

DOI: 10.1016/j.ejor.2017.11.058

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 ().