Exact Solution of the Evasive Flow Capturing Problem

• 成果类型: Article
• 署名作者: Arslan, Okan; Jabali, Ola; Laporte, Gilbert
• 署名单位: Universite de Montreal; HEC Montreal; Polytechnic University of Milan
• 刊物名称: OPERATIONS RESEARCH
• ISSN/ISSBN: 0030-364X
• DOI: 10.1287/opre.2018.1756
• 发表日期: 2018
• 页码: 1625-1640
• 关键词: inspection stations; location problem; bilevel model; road network; transportation; optimization; heuristics

摘要

The Evasive Flow Capturing Problem is defined as the problem of locating a set of law enforcement facilities on the arcs of a road network to intercept unlawful vehicle flows traveling between origin-destination pairs, who in turn deviate from their route to avoid any encounter with such facilities. Such deviations are bounded by a given tolerance. We first propose a bilevel program that, in contrast to previous studies, does not require a priori route generation. We then transform this bilevel model into a single-stage equivalent model using duality theory to yield a compact formulation. We finally reformulate the problem by describing the extreme rays of the polyhedral cone of the compact formulation and by projecting out the auxiliary variables, which leads to facet-defining inequalities and a cut formulation with an exponential number of constraints. We develop a branch-and-cut algorithm for the resulting model, as well as two separation algorithms to solve the cut formulation. Through extensive experiments on real and randomly generated networks, we demonstrate that our best model and algorithm accelerate the solution process by at least two orders of magnitude compared with the best published algorithm. Furthermore, our best model significantly increases the size of the instances that can be solved optimally.