Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2014, Article ID 124343, 8 pages
Research Article

A Study of Network Violator Interception Based on a Reliable Game Model

School of Transportation Science and Engineering, Harbin Institute of Technology, Harbin 150090, China

Received 29 March 2014; Revised 28 May 2014; Accepted 28 May 2014; Published 15 June 2014

Academic Editor: Hamid Reza Karimi

Copyright © 2014 Shi An et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


This study focuses on planning interceptor locations in a general transportation network to maximize the expected benefits from catching violators mixing in public traveler flow. Two reliability-related characteristics are also integrated into the planning model to make it more practical. One is that each interceptor (e.g., a sensor or a checkpoint) has a failure probability. The second is the existence of a “game” between the interceptor planner and violators. A nonlinear nonconvex binary integer programming model is presented. We develop a simulated annealing (SA) algorithm to solve this model, and numerical experiments are conducted to illustrate the computational efficiency of the proposed algorithm. We also analyze the sensitivity of the disruption probability of interceptors to optimal objective function values and discuss how to determine the values of these parameters in a violator route choice model.