Locating service facilities whose reliability is distance dependent.

DOI10.1016/S0305-0548(02)00099-0zbMath1039.90022OpenAlexW2050766297MaRDI 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

LocationReliabilityNetworkDistance-dependent demandService facilitiesWorst case analysis

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Reliability, availability, maintenance, inspection in operations research (90B25) Discrete location and assignment (90B80) Reliability and life testing (62N05)

Related Items (10)

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 ⋮ A stochastic gradual cover location problem ⋮ Maximizing the minimum cover probability by emergency facilities ⋮ Network location of a reliable center using the most reliable route policy ⋮ Location-allocation planning of stockpiles for effective disaster mitigation ⋮ A defensive maximal covering problem on a network ⋮ Hub interdiction problem variants: models and metaheuristic solution algorithms ⋮ Optimizing the location of a production firm

Uses Software

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: Locating service facilities whose reliability is distance dependent.