Naval Postgraduate School
Dudley Knox Library
NPS Dudley Knox Library
View Item 
  •   Calhoun Home
  • Theses and Dissertations
  • 1. Thesis and Dissertation Collection, all items
  • View Item
  •   Calhoun Home
  • Theses and Dissertations
  • 1. Thesis and Dissertation Collection, all items
  • View Item
  • How to search in Calhoun
  • My Accounts
  • Ask a Librarian
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

All of CalhounCollectionsThis Collection

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors

Two-person zero-sum network-interdiction game with multiple inspector types

Thumbnail
Download
Icon10Jun_Unsal.pdf (603.9Kb)
Download Record
Download to EndNote/RefMan (RIS)
Download to BibTex
Author
Unsal, Omur
Date
2010-06
Advisor
Wood, R. Kevin
Second Reader
Salmeron, Javier
Metadata
Show full item record
Abstract
Wood (1995) to handle multiple types of interdiction assets (e.g., aircraft, ground-based inspection teams), referred to here as "inspectors." A single evader attempts to traverse a path between two vertices in a directed network while an interdictor, controlling inspectors of different types, attempts to detect the evader by assigning inspectors to edges in the network. Each edge has a known probability of detection if the evader traverses the edge when an inspector of a given type is present. The problem for the interdictor is to find a mixed inspector-to-edge assignment strategy that maximizes the average probability of detecting the evader, i.e., the "interdiction probability." The problem for the evader is to find a mixed "path-selection strategy" that minimizes the interdiction probability. The problem is formulated as a two-person zero-sum game with a surrogate objective that evaluates expected number of detections. That model is solved with a "direct solution procedure" and a "marginal-probability solution procedure." On numerous test problems, both procedures correctly compute expected number of detections, but the latter more often finds a solution that simultaneously optimizes interdiction probability. The latter procedure is also much faster and is therefore preferred.
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.
URI
http://hdl.handle.net/10945/5334
Collections
  • 1. Thesis and Dissertation Collection, all items

Related items

Showing items related by title, author, creator and subject.

  • Thumbnail

    Robust search policies against an intelligent evader 

    Lin, Kyle Y.; Singham, Dashi I. (Monterey, California. Naval Postgraduate School, 2015-11); NPS-OR-15-009
    In a classical search model, an object is hidden in one of many cells. Knowing the probability that the object is in each cell, a searcher wishes to find it. Each search in a cell incurs a cost and will discover the object ...
  • Thumbnail

    Modeling strategic strikes against transportation networks. 

    Loh, Kok-Hua (Monterey, California. Naval Postgraduate School, 1991-09);
    We present deterministic and probabilistic models for the analysis of strategic strikes against transportation networks. The deterministic models use integer programming to solve problems on single and multicommodity ...
  • Thumbnail

    Stochastic network interdiction for optimizing defensive counter air operations planning 

    Tsamtsaridis, Charalampos I. (Monterey, California. Naval Postgraduate School, 2011-12);
    This thesis describes a stochastic, network interdiction optimization model to guide defensive, counter-air (DCA) operations planning. We model a layered, integrated air-defense system, which consists of fighter and missile ...
NPS Dudley Knox LibraryDUDLEY KNOX LIBRARY
Feedback

411 Dyer Rd. Bldg. 339
Monterey, CA 93943
circdesk@nps.edu
(831) 656-2947
DSN 756-2947

    Federal Depository Library      


Start Your Research

Research Guides
Academic Writing
Ask a Librarian
Copyright at NPS
Graduate Writing Center
How to Cite
Library Liaisons
Research Tools
Thesis Processing Office

Find & Download

Databases List
Articles, Books & More
NPS Theses
NPS Faculty Publications: Calhoun
Journal Titles
Course Reserves

Use the Library

My Accounts
Request Article or Book
Borrow, Renew, Return
Tech Help
Remote Access
Workshops & Tours

For Faculty & Researchers
For International Students
For Alumni

Print, Copy, Scan, Fax
Rooms & Study Spaces
Floor Map
Computers & Software
Adapters, Lockers & More

Collections

NPS Archive: Calhoun
Restricted Resources
Special Collections & Archives
Federal Depository
Homeland Security Digital Library

About

Hours
Library Staff
About Us
Special Exhibits
Policies
Our Affiliates
Visit Us

NPS-Licensed Resources—Terms & Conditions
Copyright Notice

Naval Postgraduate School

Naval Postgraduate School
1 University Circle, Monterey, CA 93943
Driving Directions | Campus Map

This is an official U.S. Navy Website |  Please read our Privacy Policy Notice  |  FOIA |  Section 508 |  No FEAR Act |  Whistleblower Protection |  Copyright and Accessibility |  Contact Webmaster

Export search results

The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

A logged-in user can export up to 15000 items. If you're not logged in, you can export no more than 500 items.

To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.