A network location-allocation model trading off flow capturing and \(p\)- median objectives

DOI10.1007/BF02060480zbMath0781.90061OpenAlexW1979869601MaRDI QIDQ689248

M. John Hodgson, Kenneth E. Rosing

Publication date: 17 February 1994

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02060480

zbMATH Keywords

\(p\)-median location-allocation modelsdemand for service in a networkflow capturing

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)

Related Items

A reliable budget-constrained FL/ND problem with unreliable facilities ⋮ Location of organ procurement and distribution organisation decisions and their impact on kidney allocations: a developing country perspective ⋮ An efficient heuristic algorithm for the alternative-fuel station location problem ⋮ Effects of multipurpose shopping trips on retail store location in a duopoly ⋮ Capacitated facility location/network design problems. ⋮ Agent-based modelling of locating public transport facilities for conventional and electric vehicles ⋮ A combined facility location and network design problem with multi-type of capacitated links ⋮ Applying the flow-capturing location-allocation model to an authentic network: Edmonton, Canada

Cites Work

• A comparison of two dual-based procedures for solving the p-median problem
• Multiobjective programming and planning
• A Heuristic Algorithm for the Traveling Salesman Location Problem on Networks
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph