Research in progress · MA289-27-1 Independent Study

Interdicting Taiwan’s Crude Oil Supply

Taiwan imports nearly all of its crude oil, and every barrel passes a handful of named straits. This project turns those sea lanes into a network and asks where an attacker with a limited effort budget would act to cut the supply: at distant chokepoints, or on Taiwan’s own approaches.

Network built · baseline evaluation in progress
61 / 83
Nodes and edges in the network
59
Edges an attacker can act on
11.9
VLCC loads of crude Taiwan needs a month
61%
Of 2025 crude came through Hormuz
The Pitch

Where would an adversary cut Taiwan’s oil, and can an AI trained on rail tell us?

Taiwan imports nearly all of its crude oil by sea, and every barrel passes through a handful of straits. I am turning those shipping routes into a network model, and using LTC Webb’s reinforcement-learning interdiction agent to ask two things: if China put its full effort into cutting Taiwan’s oil supply, where would it act, and can an AI trained on one kind of network reason about a very different one?

Why it matters

Energy is widely identified as Taiwan’s sharpest vulnerability in a blockade or quarantine. The chokepoints are not hypothetical: the Strait of Hormuz, which carried 61% of Taiwan’s crude in 2025, has been largely closed since February 2026, and Taiwan has had to reroute supply. Most open analysis of a Taiwan blockade comes from wargames; this project brings an optimization model to the same question.

Scope

  • In: crude oil only; the four regions that supply it (Persian Gulf, U.S. Gulf Coast, Oman, West Africa); the straits and canals it must pass; Taiwan’s three refinery ports; one month of supply.
  • Out: LNG and coal, detailed military campaigns, escorts and counter-attacks, and anything classified. A proof of concept built from open sources, not a targeting tool.

What I am looking to find

  1. Where the attacker acts. With its full effort (a budget of 100), does China go after distant chokepoints such as Hormuz and Malacca, or Taiwan’s own approaches?
  2. Quarantine versus blockade. How does the answer change between a lower-cost coast-guard quarantine and a higher-cost naval blockade?
  3. Transfer. Does an agent trained on the Ukrainian rail network still find sound strategies on a maritime network without retraining?

Previous work it builds on

  • Network interdiction: the classic optimization models of Wood (1993) and Cormican, Morton and Wood (1998), surveyed in Smith and Song (2020).
  • LTC Webb’s reinforcement-learning approach: Webb and Caplice (2025), which trains an agent to find attacker strategies (defeat, isolate, canalize, divert) on the Ukrainian rail network.
  • Taiwan blockade analysis: CSIS’s quarantine scenarios and its 2025 Lights Out? blockade wargames, which identify energy shipping as the critical factor.
  • Data: the EIA’s Taiwan brief (2026) for import sources and refinery capacity, and IMF PortWatch for shipping traffic.

Goals

  • An open-source, defensible model of Taiwan’s crude oil supply network (built; shown below).
  • A clear picture of where China’s full effort does the most damage, and how that depends on what each action costs.
  • An answer on whether the agent’s learned strategy transfers from rail to sea.
  • A poster presenting the results at the end of the semester.
The Current Model

61 nodes, 83 edges, every lane on a real sea route

Schematic of the oil network: numbered nodes from the super-source on the left through the Middle East, Cape and Pacific corridors to the Taiwan approaches and the super-sink on the right, with edges shaded by effort cost
The network as the model sees it, numbered with the IDs the environment reads. Left to right follows the voyage; the super-sink (Taiwan’s demand) sits inside the Taiwan ring. Edge shade is the effort cost of the action available there; grey dashed edges cannot be interdicted.
World map of the routed sea lanes from the Persian Gulf, the U.S. Gulf Coast and West Africa to Taiwan, with a detail panel of the Taiwan approaches
The same network on the map. Long-haul lanes follow real sea lanes; lanes near Taiwan run on waypoints 12 nautical miles offshore, the territorial-sea limit. All three crude ports are on the west coast.
How It Is Built

Four rules that make the network defensible

  • Sources and sinks from EIA data. Four origin regions weighted by 2025 import shares; three ports weighted by refinery capacity (Kaohsiung 670, Mailiao 540, Shalung 200 thousand barrels a day). Demand is 11.9 VLCC loads a month: 783 thousand barrels a day of throughput, divided by 2 million barrels a load.
  • Straits are edges. Every strait and canal runs from its entrance node to its exit node, so an action against it shuts the transit, and there is a node at every junction where routes meet or separate.
  • Every interdiction point has an alternative. Checked automatically on every build. Hormuz has no sea alternative, and China cannot close it from that far away, only slow ships there. So Hormuz is two lanes: 80% of Gulf oil always gets through, and China can remove a 20% delayed share.
  • Real geometry. Lanes are routed on the scgraph sea-lane network, which is too coarse around Taiwan (14 nodes in the whole theater), so the Taiwan lanes use coastline-derived waypoints. No lane crosses land.
Every edge of the scgraph sea-lane network worldwide, with the oil network's lanes on top, and a zoom showing the network has only one arc through the Taiwan Strait
Why the Taiwan lanes are hand-derived: the sea-lane network (grey) has a single arc down the Taiwan Strait (bottom left); the oil network’s lanes (bottom right) run 12 nm offshore.
How Interdiction Works

One effort budget, a different action on each kind of lane

The attacker spends a single effort budget. Each edge carries the one action that fits where it is, with an effort cost and a probability p that the action shuts the edge, read as the expected share of the month it is closed. That is the same per-edge cost and probability the environment already uses. China’s budget is fixed at 100, so each cost is the percent of its total effort the action uses. p is anchored on real disruptions; costs are ranked by the legal threshold crossed and the distance from PRC bases.

ActionWhere it is allowedCost (of 100)pWhat p is anchored on
Cyber on a canal or portPanama and Suez canals, the three port entries50.10Nagoya and DP World Australia port shutdowns, 2023 (about 3 days)
Cyber on an open straitMalacca, Sunda, Lombok, the Sulu route, Miyako50.05GPS jamming in Hormuz, 2025: collisions, but traffic kept moving
Jamming delayHormuz, the 20% delayed share50.80Assumption: jamming and harassment reliably slow ships; slower trips mean fewer cargoes a month
Quarantine (variant A)Taiwan approaches100.80CSIS quarantine scenarios; Iran’s 2026 Hormuz permit regime
Blockade (variant B)Taiwan approaches200.95Hormuz 2026: mines, attacks and permits cut traffic about 95%
Proxy disruptionBab el-Mandeb100.60Houthi campaign since 2023: Red Sea traffic down 50–67%
Kinetic (naval)South China Sea only150.90CSIS Lights Out? blockade wargames, 26 games (2025)
Economic pressureThe four supplier arcs150.20Sanctions succeed in 34% of 116 cases (Hufbauer, Schott & Elliott, 1990); 4% on Pape’s recount
Naval presence (carrier group)Indian Ocean, western Pacific200.20Assumption, between the Tanker War (about 2%) and the Houthis (about 60%)

The other 23 edges cannot be interdicted, each with a stated reason: the demand arcs, loading inside the Gulf, the share of Hormuz that always gets through, the Atlantic, Mediterranean, eastern Pacific and Red Sea legs, and Indonesian archipelagic waters.

First baseline (a graph calculation, not a simulation)

Counting p, the cheapest way to cut off all of Taiwan’s crude is a five-lane cordon around the west coast (50 of China’s budget of 100; 62.5 counting p), because all three crude ports sit on that coast. Ignoring p would pick three cyber attacks on the ports instead, which is why p has to stay in the model. This is the number the agent has to beat.

Assumptions and Limits

What the model holds fixed, stated up front

Kept from LTC Webb’s framework

  • Two players, attacker leading and defender following (Stackelberg).
  • Full information, zero-sum, one round.
  • Outcomes: the meeting notes say deterministic; the training code runs stochastic. To confirm.

Added by this network

  • The 2025 supplier mix is held fixed; no spot-market substitution.
  • One month, one commodity: no stock drawdown, rationing, or switch to coal or LNG.
  • No escorts or defender counter-force; the defender re-routes but does not fight back.
  • One action per edge; quarantine and blockade are run as two variants.
  • China always spends its full budget of 100. Effort costs are a ranking scaled to that budget, and the carrier group’s p is assumed; both are varied for sensitivity.
  • Similar nodes are merged: one node per origin region, Kaohsiung and Dalin as one port, Oman and Fujairah as one terminal.
  • Open, unclassified sources only. A proof of concept, not a targeting model.

Still open

  • Shalung’s exact position, which appears in neither PortWatch nor Natural Earth.
Next

How the questions get answered

  1. Baselines on the graph (exact min-cut, greedy), with sourced capacities.
  2. Agent evaluation on an Army cloud environment (LTC Webb): zero-sum and canalize strategies, quarantine and blockade variants.
  3. Transfer test: the rail-trained agent on this network without retraining. If it transfers, it learned interdiction rather than a map; if it does not, that is also a result.
  4. Future work: a traveling salesman problem (TSP) formulation, possibly with k-nearest neighbors, once the current model is working. Not yet decided.

Random and fixed: whether each action works is random (its chance of success); the network, capacities, costs, China’s budget and Taiwan’s best rerouting are fixed.

Products: crude delivered when China spends its full budget of 100 (min-cut, greedy and the agent), how that changes as action costs change (a blockade at 15, 20 and 30 first), a map of where the agent acts, the transfer result, and a poster.

Sources

Where every number comes from

Method

  • Wood, R. K. (1993). Deterministic network interdiction. Mathematical and Computer Modelling, 17(2), 1–18.
  • Cormican, K. J., Morton, D. P., & Wood, R. K. (1998). Stochastic network interdiction. Operations Research, 46(2), 184–197.
  • Smith, J. C., & Song, Y. (2020). A survey of network interdiction models and algorithms. European Journal of Operational Research, 283(3), 797–811.
  • Webb, M., & Caplice, C. (2025). Solving maximum flow network interdiction using reinforcement learning. SSRN 5392397.

Data

Effort values and current events

Files

The documents behind this page

Everything is kept in the project repository on GitHub; this page is a compact view of the parts that matter.