Algorithmcore
Clarke-Wright savings algorithm
Also called savings heuristic.
Merge routes greedily by the savings from connecting customer pairs.
Merge routes greedily by the savings from connecting customer pairs.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag BGTTNH Edit this page History Report an error