A generalized model for locating facilities on a network with flow-based demand

DOI10.1007/S11067-008-9073-8zbMath1202.90179OpenAlexW2022532912MaRDI QIDQ613557

Ignacio Castillo, Weiping Zeng, M. John Hodgson

Publication date: 21 December 2010

Published in: Networks and Spatial Economics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11067-008-9073-8

zbMATH Keywords

facility locationtransportation networkflow interceptionflow-based demand

Mathematics Subject Classification ID

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

Related Items (10)

Capacitated refueling station location problem with traffic deviations over multiple time periods ⋮ Heuristic algorithms for solving an integrated dynamic center facility location -- network design model ⋮ Optimal deployment of alternative fueling stations on transportation networks considering deviation paths ⋮ A continuous network location problem for a single refueling station on a tree ⋮ Multi-commodity location-routing: flow intercepting formulation and branch-and-cut algorithm ⋮ Optimizing the electrification of roads with charge-while-drive technology ⋮ Evasive flow capture: a multi-period stochastic facility location problem with independent demand ⋮ Agent-based modelling of locating public transport facilities for conventional and electric vehicles ⋮ Maximizing expected coverage of flow and opportunity for diversion in networked systems ⋮ Tabu search heuristic for joint location-inventory problem with stochastic inventory capacity and practicality constraints

Uses Software

• AMPL
• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• An improved IP formulation for the uncapacitated facility location problem: capitalizing on objective function structure
• Location coverage models with demand originating from nodes and paths: Application to cellular network design
• Facility siting and integer-friendly programming
• Applying the flow-capturing location-allocation model to an authentic network: Edmonton, Canada
• Locating flow-capturing units on a network with multi-counting and diminishing returns to scale
• COBRA: A new formulation of the classic \(p\)-median location problem
• Solving the competitive discretionary service facility location problem
• Algorithms for a facility location problem with stochastic customer demand and immobile servers
• Locating multiple competitive facilities: Spatial interaction models with variable expenditures
• Using GIS to assess the risks of hazardous materials transport in networks
• Location of alternative-fuel stations using the flow-refueling location model and dispersion of candidate sites on arcs
• The p-Median and Its Linear Programming Relaxation: An Approach to Large Problems
• Optimal Location of Discretionary Service Facilities
• Deterministic flow-demand location problems
• The Inspection Station Location Problem In Hazardous Material Transportation: Some Heuristics And Bounds
• Locating Discretionary Service Facilities, II: Maximizing Market Size, Minimizing Inconvenience
• A branch‐bound algorithm for the capacitated facilities location problem

This page was built for publication: A generalized model for locating facilities on a network with flow-based demand