Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Computational procedure, the example, pp. 575–576 — every run on Table I ends with total distance 290

Proved
ClarkeWright64.Savings.example_290

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

examplep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1savings-algorithmvehicle-routing

On the twelve-customer instance of Table I with the fleet of p. 573 (unlimited 4000-gallon trucks, three of 5000 gallons, four of 6000 gallons), every run of the savings procedure, whichever way the ties are broken, stops in a state whose runs serve the customer sets

{1,2,3,4},{5},{6,8,9},{7,10,11,12},\{1,2,3,4\},\quad \{5\},\quad \{6,8,9\},\quad \{7,10,11,12\},{1,2,3,4},{5},{6,8,9},{7,10,11,12},

with total distance 290290290 units.

The paper reports the routes P0P1P2P3P4P0P_0P_1P_2P_3P_4P_0P0​P1​P2​P3​P4​P0​, P0P5P0P_0P_5P_0P0​P5​P0​, P0P6P8P9P0P_0P_6P_8P_9P_0P0​P6​P8​P9​P0​, P0P10P12P11P7P0P_0P_{10}P_{12}P_{11}P_7P_0P0​P10​P12​P11​P7​P0​. The order of customers within a run depends on the tie-breaks, so only the partition and the total are stated.

Preamble
import Mathlib
import Definitions.Def_SupplyChainTheory_vrp
import Definitions.Def_ClarkeWright64_Savings_Instance
import Definitions.Def_ClarkeWright64_Savings_Procedure
import Definitions.Def_ClarkeWright64_Savings_TableI
Formal statement
namespace ClarkeWright64.Savings

/-- Clarke & Wright (1964), the numerical example, pp. 575–576: on the data of Table I with
the fleet of p. 573, every run of the procedure (every tie-break) stops with the customers
partitioned into the runs `{1,2,3,4}`, `{5}`, `{6,8,9}`, `{7,10,11,12}` and a total
distance of 290 units. -/
theorem example_290 (s : State 12) (hs : Reachable tableI s) (hterm : Terminal tableI s) :
    tableI.mileage s = 290 ∧
    (↑(s.map List.toFinset) : Multiset (Finset (Fin 13))) =
      {{1, 2, 3, 4}, {5}, {6, 8, 9}, {7, 10, 11, 12}} := by sorry

end ClarkeWright64.Savings
Source
Clarke & Wright, Scheduling of vehicles from a central depot to a number of delivery points, Oper. Res. 12 (1964), pp. 575–576, Computational procedure (Tables V, VI and the routes)
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me