A broker's margin is information asymmetry: it knows which trucks are empty and charges for the knowledge. ASCA routes over the graph itself and clears rates without anyone revealing their number.
Road, rail and maritime legs are modelled as a weighted directed acyclic graph. An edge is not just distance: it carries transit time, fuel burn, carbon, and border clearance delay, so the cheapest path for a load is rarely the shortest one on a map.
The empty return is the expensive part. A trailer that delivers to Munich and drives back to Hamburg burns fuel carrying nothing, and that cost is priced into every load. Pairing a return leg against an outbound one is what removes 37.2% of that distance — the amber and blue routes above are the same vehicle doing both.
A carrier will not quote honestly if the quote reveals what its costs are, and a shipper will not bid openly if the bid reveals its budget. ASCA clears rates in a multi-party computation: participants submit sealed values, the winning price is computed across shares, and nobody learns a competitor's number — only whether they won and at what price.
Weighted multi-modal DAG, corridor costs, path pruning.
Backhaul matching across the corridor set, deadhead accounting.
Sealed-bid rate clearing over secret shares.
Formal properties over the graph, checked at test time.
git clone https://github.com/KELLERBABG/Algorithmic-Supply-Chain-Arbitrage.git cd Algorithmic-Supply-Chain-Arbitrage && cargo test --workspace