Please use this identifier to cite or link to this item: http://hdl.handle.net/11718/27412
Full metadata record
DC FieldValueLanguage
dc.contributor.authorRamamoorthy, Prasanna
dc.contributor.authorJayaswal, Sachin
dc.contributor.authorSinha, Ankur
dc.contributor.authorVidyarthi, Navneet
dc.date.accessioned2024-07-23T04:36:52Z
dc.date.available2024-07-23T04:36:52Z
dc.date.issued2024-07-14
dc.identifier.issn1872-6860
dc.identifier.urihttp://hdl.handle.net/11718/27412
dc.descriptionIn this paper, we study the problem of designing a hub network that is robust against deliberate attacks (interdictions). The problem is modeled as a three-level, two-player Stackelberg game, in which the network designer (defender) acts first to locate hubs to route a set of flows through the network. The attacker (interdictor) acts next to interdict a subset of the located hubs in the designer’s network, followed again by the defender who routes the flows through the remaining hubs in the network. We model the defender’s problem as a trilevel optimization problem, wherein the attacker’s response is modeled as a bilevel hub interdiction problem. We study such a trilevel problem on three variants of hub location problems studied in the literature namely: p-hub median problem, p-hub center, and p-hub maximal covering problems. We present a cutting plane based exact method to solve the problem. The cutting plane method uses supervalid inequalities, which is obtained from the solution of the lower level interdiction problem. To solve the lower level hub interdiction problem efficiently, we propose a penalty-based reformulation of the problem. Using the reformulation, we present a branch-and-cut based exact approach to solve the problem efficiently. We conduct experiments to show the computational advantages of the above algorithm. To the best of our knowledge, the cutting plane approach proposed in this paper is among the first exact method to solve trilevel location–interdiction problems. Our computational results show interesting implications of incorporating interdiction risks in the hub location problem.
dc.description.abstractIn this paper, we study the problem of designing a hub network that is robust against deliberate attacks (interdictions). The problem is modeled as a three-level, two-player Stackelberg game, in which the network designer (defender) acts first to locate hubs to route a set of flows through the network. The attacker (interdictor) acts next to interdict a subset of the located hubs in the designer’s network, followed again by the defender who routes the flows through the remaining hubs in the network. We model the defender’s problem as a trilevel optimization problem, wherein the attacker’s response is modeled as a bilevel hub interdiction problem. We study such a trilevel problem on three variants of hub location problems studied in the literature namely: p-hub median problem, p-hub center, and p-hub maximal covering problems. We present a cutting plane based exact method to solve the problem. The cutting plane method uses supervalid inequalities, which is obtained from the solution of the lower level interdiction problem. To solve the lower level hub interdiction problem efficiently, we propose a penalty-based reformulation of the problem. Using the reformulation, we present a branch-and-cut based exact approach to solve the problem efficiently. We conduct experiments to show the computational advantages of the above algorithm. To the best of our knowledge, the cutting plane approach proposed in this paper is among the first exact method to solve trilevel location–interdiction problems. Our computational results show interesting implications of incorporating interdiction risks in the hub location problem.
dc.language.isoen_USen_US
dc.publisherElsevieren_US
dc.relation.ispartofEuropean Journal of Operational Researchen_US
dc.subjectLocationen_US
dc.subjectInterdictionen_US
dc.subjectTrilevel programmingen_US
dc.subjectCutting plane algorithmen_US
dc.subjectStackelberg gamesen_US
dc.titleAn exact method for trilevel hub location problem with interdictionen_US
dc.typeArticleen_US
Appears in Collections:Journal Articles

Files in This Item:
There are no files associated with this item.


Items in IIMA Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.