A Robust Model for the Network Violator Interception Problem

This paper studies planning interceptor locations in a general transportation network to maximize the benefits of reducing public exposure to violators (e.g., violators in urban transportation networks and terrorists in airline networks). A robust optimization model is proposed to address uncertainties associated with link traffic volumes and the likelihood of having a violator on a particular network route. The potential failure of interceptors and subsequent uncertainties is also considered. The consequent mathematical model has a bi-level program structure and a non-convex inner problem. We propose a number of solution approaches, including the alternating ascent algorithm, convex relaxation, duality techniques and commercial solvers for the inner problem, and greedy randomized adaptive search program (GRASP) algorithms for the outer problem. Several numerical experiments are conducted to illustrate the computational efficiency and solution quality of the proposed algorithms.

[1]  Oded Berman,et al.  Locating Discretionary Service Facilities Based on Probabilistic Customer Flows , 1995, Transp. Sci..

[2]  Kenneth E. Train,et al.  Discrete Choice Methods with Simulation , 2016 .

[3]  Celso C. Ribeiro,et al.  Greedy Randomized Adaptive Search Procedures , 2003, Handbook of Metaheuristics.

[4]  Yosef Sheffi,et al.  Urban Transportation Networks: Equilibrium Analysis With Mathematical Programming Methods , 1985 .

[5]  David P. Morton,et al.  Stochastic Network Interdiction , 1998, Oper. Res..

[6]  M. John Hodgson,et al.  A Generalized Model for Locating Facilities on a Network with Flow-Based Demand , 2010 .

[7]  R. Kevin Wood,et al.  Deterministic network interdiction , 1993 .

[8]  M. J. Hodgson A Flow-Capturing Location-Allocation Model , 2010 .

[9]  Obed Berman The maximizing market size discretionary facility location problem with congestion , 1995 .

[10]  Alan W. McMasters,et al.  Optimal interdiction of a supply network , 1970 .

[11]  Tai-Hsi Wu,et al.  Solving the competitive discretionary service facility location problem , 2003, Eur. J. Oper. Res..

[12]  Oded Berman,et al.  Optimal Location of Discretionary Service Facilities , 1992, Transp. Sci..

[13]  Peter A. Rogerson,et al.  Location coverage models with demand originating from nodes and paths: Application to cellular network design , 2008, European Journal of Operational Research.

[14]  K. Train Discrete Choice Methods with Simulation , 2003 .

[15]  Claudio Sterle,et al.  Flow Intercepting Facility Location: Problems, Models and Heuristics , 2009, J. Math. Model. Algorithms.

[16]  M. John Hodgson,et al.  A network location-allocation model trading off flow capturing andp-median objectives , 1992, Ann. Oper. Res..

[17]  Christodoulos A. Floudas,et al.  Global Optimization of Nonlinear Bilevel Programming Problems , 2001, J. Glob. Optim..

[18]  Oded Berman,et al.  Locating flow-intercepting facilities: New approaches and results , 1995, Ann. Oper. Res..

[19]  O. Berman Deterministic flow-demand location problems , 1997 .

[20]  D. Krass,et al.  Generalized flow-interception facility location models with probabilistic customer flows , 1997 .

[21]  Mohd Khairol Anuar Mohd Ariffin,et al.  An Optimization Approach for A Joint Location Inventory Model Considering Quantity Discount Policy , 2013 .

[22]  M. John Hodgson,et al.  Applying the flow-capturing location-allocation model to an authentic network: Edmonton, Canada , 1996 .

[23]  James E. Falk,et al.  Jointly Constrained Biconvex Programming , 1983, Math. Oper. Res..

[24]  Oded Berman,et al.  Locating Discretionary Service Facilities, II: Maximizing Market Size, Minimizing Inconvenience , 1995, Oper. Res..

[25]  M. John Hodgson,et al.  The Pickup Problem: Consumers' Locational Preferences in Flow Interception , 2009 .

[26]  Harvey J. Greenberg,et al.  Digital Object Identifier (DOI) 10.1007/s10107-005-0689-x , 2005 .

[27]  Christodoulos A. Floudas,et al.  αBB: A global optimization method for general constrained nonconvex problems , 1995, J. Glob. Optim..

[28]  J. Y. Yen Finding the K Shortest Loopless Paths in a Network , 1971 .

[29]  Oded Berman,et al.  Flow intercepting spatial interaction model: a new approach to optimal location of competitive facilities , 1998 .

[30]  Mark W. Horner,et al.  Network flow-based strategies for identifying rail park-and-ride facility locations , 2007 .

[31]  Oded Berman,et al.  Locating Multiple Competitive Facilities: Spatial Interaction Models with Variable Expenditures , 2002, Ann. Oper. Res..

[32]  Erhan Erkut,et al.  A Lagrangian relaxation approach to large-scale flow interception problems , 2009, Eur. J. Oper. Res..

[33]  Yanfeng Ouyang,et al.  Optimal fueling strategies for locomotive fleets in railroad networks , 2010 .