Optimal multiunit transfer over adversarial paths with increasing intercept probabilities

Christopher Garcia

IISE Transactions, 2018, vol. 50, issue 11, 989-996

Abstract: We consider a problem involving transporting a set of items over a set of hostile paths where an adversary seeks to intercept them, with the goal of maximizing the probability that all items successfully cross. Items leave a unique footprint as they cross a path, and the probability that an item is intercepted on a given path increases according to an intercept probability function as the cumulative footprint on that path increases. We provide a problem formulation and demonstrate several properties important for its solution. We then use these to develop four optimization algorithms: an exact algorithm (E), a greedy heuristic (G), a greedy heuristic with local search (LS), and a genetic algorithm (GA). These algorithms were evaluated via computational experiments on a large set of benchmark problems spanning different sizes and characteristics. LS provided the largest number of best solutions while outperforming GA in terms of solution time.

Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1080/24725854.2018.1488306 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:uiiexx:v:50:y:2018:i:11:p:989-996

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/uiie20

DOI: 10.1080/24725854.2018.1488306

Access Statistics for this article

IISE Transactions is currently edited by Jianjun Shi

More articles in IISE Transactions from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().