Flow intercepting facility location: Problems, models and heuristics

DOI10.1007/S10852-008-9098-5MaRDI QIDQ841607zbMATH OpenOpenAlexFDO

Authors Maurizio Boccia, Claudio Sterle, Antonio Sforza

Publication date 18 September 2009

Published in JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10852-008-9098-5

zbMATH Keywords

facility locationpath coveringflow interceptionnetwork monitoring and control

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Recommendations

• Locating flow-intercepting facilities: New approaches and results
• Generalized flow-interception facility location models with probabilistic customer flows
• A generalized model for locating facilities on a network with flow-based demand
• Deterministic flow-demand location problems
• Publication:4488781

Cites work

• scientific article; zbMATH DE number 1471488 (Why is no real title available?)
• scientific article; zbMATH DE number 2096636 (Why is no real title available?)
• A Network Based Model for Traffic Sensor Location with Implications on O/D Matrix Estimates
• Algorithms for Path-Based Placement of Inspection Stations on Networks
• Deterministic flow-demand location problems
• Locating Discretionary Service Facilities, II: Maximizing Market Size, Minimizing Inconvenience
• Locating active sensors on traffic networks
• Locating flow-capturing units on a network with multi-counting and diminishing returns to scale
• Locating flow-intercepting facilities: New approaches and results
• Models and algorithms for the screen line-based traffic-counting location problems
• Optimal Location of Discretionary Service Facilities
• 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
• The Inspection Station Location Problem In Hazardous Material Transportation: Some Heuristics And Bounds
• The budgeted maximum coverage problem

Cited in

(12)

• Optimal shrinking of the distribution chain: the facilities delocation decision
• Bi-level programming model and hybrid genetic algorithm for flow interception problem with customer choice
• Deterministic flow-demand location problems
• Multi-commodity location-routing: flow intercepting formulation and branch-and-cut algorithm
• An effective bilevel programming approach for the evasive flow capturing location problem
• The multi terminal \(q\)-FlowLoc problem: a heuristic
• A generalized model for locating facilities on a network with flow-based demand
• scientific article; zbMATH DE number 1471488 (Why is no real title available?)
• Evasive flow capture: optimal location of weigh-in-motion systems, tollbooths, and security checkpoints
• A network location-allocation model trading off flow capturing and \(p\)- median objectives
• A unified solving approach for two and three dimensional coverage problems in sensor networks
• Locating flow-intercepting facilities: New approaches and results

This page was built for publication: Flow intercepting facility location: Problems, models and heuristics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q841607)