Evasive flow capture: a multi-period stochastic facility location problem with independent demand

DOI10.1016/j.ejor.2016.08.020zbMath1394.90392OpenAlexW2516846965MaRDI QIDQ1752853

Paul Schonfeld, Nikola Marković, Ilya O. Ryzhov

Publication date: 24 May 2018

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2016.08.020

zbMATH Keywords

locationstochastic flowsnetwork modelflow capturemulti-period planning

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Stochastic programming (90C15) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (6)

The value of the multi-period solution revisited: when to model time in capacitated location problems ⋮ Exact Solution of the Evasive Flow Capturing Problem ⋮ The incremental cooperative design of preventive healthcare networks ⋮ Integrated facility location and capacity planning under uncertainty ⋮ An effective bilevel programming approach for the evasive flow capturing location problem ⋮ Pessimistic evasive flow capturing problems

Uses Software

• Matlab
• Matlog

Cites Work

• Unnamed Item
• Fix-and-relax-coordination for a multi-period location-allocation problem under uncertainty
• A generalized model for locating facilities on a network with flow-based demand
• The multi-period incremental service facility location problem
• A Lagrangian relaxation approach to large-scale flow interception problems
• A Langrangean heuristic for the \(p_ k\)-median dynamic location problem
• 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
• Multistage stochastic programming model for electric power capacity expansion problem
• A multiperiod two-echelon multicommodity capacitated plant location problem
• A branch-and-cluster coordination scheme for selecting prison facility sites under uncertainty
• Strategic facility location: A review
• Solving the competitive discretionary service facility location problem
• Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning
• Location of alternative-fuel stations using the flow-refueling location model and dispersion of candidate sites on arcs
• Heuristic algorithms for siting alternative-fuel stations using the flow-refueling location model
• Multistage stochastic programs with block-separable recourse
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Locating mobile servers on a network with markovian properties
• An Algorithm for Solving Dynamic Capacitated Plant Location Problems with Discrete Expansion Sizes
• Optimal Location of Discretionary Service Facilities
• Dynamic facility location: The progressive p-median problem
• Introduction to Stochastic Programming
• Evasive flow capture: Optimal location of weigh‐in‐motion systems, tollbooths, and security checkpoints
• Capacity planning and warehouse location in supply chains with uncertain demands
• The Inspection Station Location Problem In Hazardous Material Transportation: Some Heuristics And Bounds
• Locating Discretionary Service Facilities, II: Maximizing Market Size, Minimizing Inconvenience
• Near-shortest and K-shortest simple paths
• Finding the K Shortest Loopless Paths in a Network
• Solving the dynamic facility location problem

This page was built for publication: Evasive flow capture: a multi-period stochastic facility location problem with independent demand