Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing

DOI10.1007/s11067-013-9189-3zbMath1332.90140MaRDI QIDQ264277

F. Blanchet-Sadri, M. Dambrine

Publication date: 31 March 2016

Published in: Networks and Spatial Economics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11067-013-9189-3

zbMATH Keywords

Taguchi method; simulated annealing; bi-level programming; \(p\)-hub median problem; disruption; multiple allocation

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C11: Mixed integer programming

91A65: Hierarchical games (including Stackelberg games)

90B80: Discrete location and assignment

Uses Software

• OR-Library