A fast tabu search algorithm for the reliable P-median problem

DOI10.1007/978-3-319-08377-3_41zbMATH Open1327.90032OpenAlexW210669725MaRDI QIDQ2942500FDOQ2942500

Authors: Qingwei Li, Alex Savachkin 

Publication date: 11 September 2015

Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-08377-3_41

Recommendations

• Reliable facility location design under disruptions
• Reliable distribution networks design with nonlinear fortification function
• A facility reliability problem: Formulation, properties, and algorithm
• Reliable facility location design under the risk of disruptions
• The reliable \(p\)-median problem with at-facility service

zbMATH Keywords

facility failure probabilitiesfacility fortification

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Integer programming (90C10) Stochastic network models in operations research (90B15)

Cites Work

• An efficient tabu search procedure for the \(p\)-median problem
• Reliable facility location design under the risk of disruptions
• A facility reliability problem: Formulation, properties, and algorithm
• Reliable facility location design under disruptions
• Optimal location of facilities on a network with an unreliable node or link

Cited In (3)

• Reliable distribution networks design with nonlinear fortification function
• Reliable production process design problem: compact MILP model and ALNS-based primal heuristic
• Reliable facility location design under disruptions

This page was built for publication: A fast tabu search algorithm for the reliable \(P\)-median problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2942500)