Locating service facilities whose reliability is distance dependent.

DOI10.1016/S0305-0548(02)00099-0zbMath1039.90022MaRDI QIDQ1422360

Zvi Drezner, Oded Berman, George O. Wesolowsky

Publication date: 14 February 2004

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(02)00099-0

zbMATH Keywords

Location; Reliability; Network; Distance-dependent demand; Service facilities; Worst case analysis

Mathematics Subject Classification ID

60K25: Queueing theory (aspects of probability theory)

90B25: Reliability, availability, maintenance, inspection in operations research

90B80: Discrete location and assignment

62N05: Reliability and life testing

Related Items

Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing, Pre-positioning disaster response facilities at safe locations: an evaluation of deterministic and stochastic modeling approaches, The maximin gradual cover location problem, Maximizing the minimum cover probability by emergency facilities, Hub interdiction problem variants: models and metaheuristic solution algorithms, Network location of a reliable center using the most reliable route policy, Optimizing the location of a production firm, Location-allocation planning of stockpiles for effective disaster mitigation, A stochastic gradual cover location problem, A defensive maximal covering problem on a network

Uses Software

• SITATION
• MOD-DIST
• MENU-OKF
• Tabu search
• Algorithm 97

Cites Work

• Optimization by Simulated Annealing
• An analysis of approximations for maximizing submodular set functions—I
• Defining tabu list size and aspiration criterion within tabu search methods
• Unnamed Item
• Unnamed Item
• Unnamed Item