Cat Pathfinder Optimizer · Bio-inspired optimization

Plan like a cat: avoid what matters, remember what failed.

A bio-inspired reliability optimizer for planning under uncertainty — selective risk avoidance, detour generation, outcome memory and adaptive exploration — now running behind domain-neutral contracts on real supply-chain data.

The question

Plan like a cat: avoid what matters, remember what failed.

Classical planners tend to fail in one of two directions: minimise cost and ignore reliability, or avoid every risk and overpay. Real networks need to tell a fatal hazard from a nuisance — and learn from what already went wrong.

Cat behaviour is the motivating reference: perception, selective obstacle avoidance, detours, memory of outcomes and adaptive exploration. The product model is not limited to cats or to geometric routing.

Approach

How it works

  1. Bio-inspired operators. Severity classification, outcome memory, adaptive exploration and alternative generation — conceptually related to PSO, ant-colony and slime-mold methods.

  2. Domain-neutral core. Scenarios, risk models, executors and planners sit behind stable contracts; a GraphBioPlanner runs the same operators over any graph a domain supplies.

  3. Real data. 91k daily rows — 50 SKUs × 5 warehouses × 10 suppliers × 4 regions. Lane reliability is the empirical on-time rate per supplier–warehouse pair, which varies from 0.20 to 1.00.

  4. Controlled ablations. Every operator can be switched off and compared against cost-only, risk-aware and reliability-first classical policies, reporting success rate, cost and risk percentiles, replans and expected economic loss.

Results & insight

What came out of it

The most useful finding was a calibration lesson rather than a headline number.

−38%

fewer replans with severity + memory + alternatives, at equal 100% success (3 seeds × 10 episodes)

−11%

lower objective cost than the ablated baseline

Density, not severity, was the tuning knob
Route success rate on real supplier–warehouse data
Density, not severity, was the tuning knob
One obstacle per lane (50)67%
One obstacle per supplier (10)100%

With 50 obstacles, hazard exposure stacks up everywhere on the map and compounds over up to 110 hops per route. Aggregating per supplier matches the calibrated density with real severity values unchanged.

Full model vs. ablated baseline
Indexed, ablated baseline = 100 · lower is better
Full model vs. ablated baseline
Replans · baseline100
Replans · full model62
Objective cost · baseline100
Objective cost · full model89

Indexed from the reported ≈38% fewer replans and ≈11% lower objective cost. A regression test locks in the replan advantage.

Severity classification on its own — without alternative generation to recover from a bad choice — performs far worse than the cost-only baseline. Only the full combination outperforms every single-operator ablation.

Limits

Stated plainly

What this does not show
  • These are algorithm-validation benchmarks, not production evidence. A real claim of superiority would additionally require 100+ scenarios, train/validation/test splits and domain-standard solver baselines.
Stack & sources

Under the hood

PythonA* searchNumPypandas
Discuss this research

Working on a similar problem?

Collaboration, an application of Cat Pathfinder Optimizer in your context, or a speaking slot — I reply personally.

Start a conversation