Solving the p-hub median problem under intentional disruptions using simulated annealing
From MaRDI portal
Publication:264277
DOI10.1007/S11067-013-9189-3zbMATH Open1332.90140OpenAlexW2008321972MaRDI QIDQ264277FDOQ264277
Authors: F. Parvaresh, S. A. Hashemi Golpayegany, S. M. Moattar Husseini, B. Karimi 
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
Recommendations
- Hub interdiction problem variants: models and metaheuristic solution algorithms
- An implicit enumeration algorithm for the hub interdiction median problem with fortification
- Managing facility disruption in hub-and-spoke networks: formulations and efficient solution methods
- The impact of hub failure in hub-and-spoke networks: mathematical formulations and solution techniques
- On the \(p\)-hub interdiction problem
simulated annealing\(p\)-hub median problembi-level programmingdisruptionmultiple allocationTaguchi method
Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Hierarchical games (including Stackelberg games) (91A65) Discrete location and assignment (90B80)
Cites Work
- Optimization by simulated annealing
- Equation of State Calculations by Fast Computing Machines
- Orthogonal arrays. Theory and applications
- A bilevel mixed-integer program for critical infrastructure protection planning
- A hybrid neural network approach to bilevel programming problems
- Exponential distribution-based genetic algorithm for solving mixed-integer bilevel programming problems
- A simple tabu search method to solve the mixed-integer linear bilevel programming problem
- Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
- Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
- Efficient solution procedure and reduced size formulations for \(p\)-hub location problems
- Integer programming formulations of discrete hub location problems
- Locating service facilities whose reliability is distance dependent.
- Preprocessing and cutting for multiple allocation hub location problems.
- Incorporating the threat of terrorist attacks in the design of public service facility networks
- A bilevel fixed charge location model for facilities under imminent attack
- Hub-and-spoke network design with congestion
- New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem
- Linear bilevel programming solution by genetic algorithm
- The stochastic interdiction median problem with disruption intensity levels
- Resolution method for mixed integer bi-level linear problems based on decomposition technique
- Network-based accessibility measures for vulnerability analysis of degradable transportation networks
- Network hub location problems: The state of the art
- On a bi-level formulation to protect uncapacitated \(p\)-median systems with facility recovery time and frequent disruptions
- Reliable facility location design under the risk of disruptions
- Facility Reliability Issues in Network p-Median Problems: Strategic Centralization and Co-Location Effects
- A facility reliability problem: Formulation, properties, and algorithm
- A defensive maximal covering problem on a network
- Convergence of an annealing algorithm
- Heuristic Solution Methods for Two Location Problems with Unreliable Facilities
- Allocation strategies in hub networks
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- A dual algorithm for the uncapacitated hub location problem
- Title not available (Why is that?)
- Hub Location and the p-Hub Median Problem
- Optimizing system resilience: a facility protection model with recovery time
- An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
- Genetic algorithm based approach to bi-level linear programming
- Hub location-allocation in intermodal logistic networks
- On solving unreliable planar location problems
- HubLocator: An exact solution method for the multiple allocation hub location problem
- Scheduling open shops with parallel machines to minimize total completion time
- Designing robust coverage networks to hedge against worst-case facility losses
- Location and allocation for distribution systems with transshipments and transportion economies of scale
- Adapting polyhedral properties from facility to hub location problems
- Analysis of facility protection strategies against an uncertain number of attacks: the stochastic R-interdiction median problem with fortification
- Uncapacitated Euclidean hub location: strengthened formulation, new facets and a relax-and-cut algorithm
- New formulations for the uncapacitated multiple allocation hub location problem
- Hub location for time definite transportation
- Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique
- Benders decomposition for the uncapacitated multiple allocation hub location problem
- Routing traffic at hub facilities
- Application of particle swarm optimization algorithm for solving bi-level linear programming problem
- Improved immune algorithm for global numerical optimization and job-shop scheduling problems
- Strategic network restoration
Cited In (18)
- A new distributionally robust \(p\)-hub median problem with uncertain carbon emissions and its tractable approximation method
- Design of a reliable multi-modal multi-commodity model for hazardous materials transportation under uncertainty
- Hub location problems with price sensitive demands
- Title not available (Why is that?)
- Multiple allocation hub interdiction and protection problems: model formulations and solution approaches
- Hub interdiction problem variants: models and metaheuristic solution algorithms
- Endogenous effects of hubbing on flow intensities
- Spatial analysis of single allocation hub location problems
- Solving a location problem of a Stackelberg firm competing with Cournot-Nash firms
- A statistical analysis of simulated annealing applied to the \(p\)-median problem
- An efficient environmentally friendly transportation network design via dry ports: a bi-level programming approach
- Optimizing dynamic investment decisions for railway systems protection
- Reliable p-hub network design under multiple disruptions
- Algorithms of ant system and simulated annealing for the \(p\)-median problem
- Design of a reliable logistics network with hub disruption under uncertainty
- An implicit enumeration algorithm for the hub interdiction median problem with fortification
- On the \(p\)-hub interdiction problem
- Risk-averse hub location: formulation and solution approach
Uses Software
This page was built for publication: Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q264277)
