Maximizing expected coverage of flow and opportunity for diversion in networked systems

DOI10.1007/s11067-018-9431-0OpenAlexW2905020933MaRDI QIDQ2005813

Timothy C. Matisziw

Publication date: 8 October 2020

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

Full work available at URL: https://doi.org/10.1007/s11067-018-9431-0

zbMATH Keywords

uncertaintyfacility locationnetwork optimizationroutingflow capturingmulti-objective modeling

Mathematics Subject Classification ID

Computer science (68-XX) Operations research, mathematical programming (90-XX)

Related Items (2)

An edge scanning method for the continuous deviation‐flow refueling station location problem on a general network ⋮ Dynamic wireless charging facility location problem for battery electric vehicles under electricity constraint

Uses Software

• SITATION
• MOD-DIST
• MENU-OKF

Cites Work

• Optimal deployment of alternative fueling stations on transportation networks considering deviation paths
• A branch and price approach for routing and refueling station location model
• A generalized model for locating facilities on a network with flow-based demand
• Multiobjective programming and planning
• Applying the flow-capturing location-allocation model to an authentic network: Edmonton, Canada
• Capacitated refueling station location problem with traffic deviations over multiple time periods
• Locating Discretionary Service Facilities, II: Maximizing Market Size, Minimizing Inconvenience
• Unnamed Item

This page was built for publication: Maximizing expected coverage of flow and opportunity for diversion in networked systems