Applying the flow-capturing location-allocation model to an authentic network: Edmonton, Canada

DOI10.1016/0377-2217(95)00034-8zbMath0907.90129OpenAlexW2099549450MaRDI QIDQ1268426

M. John Hodgson, A. Leontien G. Storrier, Kenneth E. Rosing

Publication date: 24 November 1998

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: http://repub.eur.nl/pub/65197

zbMATH Keywords

location-allocationnetwork trafficurban road networkflow-capturing modelnetwork facilities

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)

Related Items (11)

A continuous network location problem for a single refueling station on a tree ⋮ Heuristic algorithms for siting alternative-fuel stations using the flow-refueling location model ⋮ A generalized model for locating facilities on a network with flow-based demand ⋮ Evasive flow capture: a multi-period stochastic facility location problem with independent demand ⋮ Maximizing expected coverage of flow and opportunity for diversion in networked systems ⋮ Bi-level programming model and hybrid genetic algorithm for flow interception problem with customer choice ⋮ Distributions of rectilinear deviation distance to visit a facility ⋮ Locating flow-capturing units on a network with multi-counting and diminishing returns to scale ⋮ Heuristic concentration: Two stage solution construction ⋮ A Benders decomposition algorithm for the maximum availability service facility location problem ⋮ Solving the competitive discretionary service facility location problem

Cites Work

• Unnamed Item
• A network location-allocation model trading off flow capturing and \(p\)- median objectives
• Statistics of extremes in climatology
• The p-Median and Its Linear Programming Relaxation: An Approach to Large Problems
• Optimal Location of Discretionary Service Facilities
• Sample extremes: an elementary introduction
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• Locating Discretionary Service Facilities Based on Probabilistic Customer Flows
• Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph

This page was built for publication: Applying the flow-capturing location-allocation model to an authentic network: Edmonton, Canada