Theorem 11.6 (Haimovich and Rinnooy Kan):
ProvedSupplyChainTheory.vrp_tsp_boundsboundsoperations-researchtraveling-salesmanvehicle-routing
Theorem 11.6. For a VRP instance on nodes with metric distances, for every customer, vehicle capacity and an unrestricted number of vehicles,
where is the optimal VRP objective, the length of the optimal TSP tour through all the nodes, and the average distance from the depot to the customers. The lower bound combines the radial bound on each route with ; the upper bound is the iterated optimal tour partition heuristic applied to the optimal tour, using . Both bounds are tight (Problem 11.18); the first term of the upper bound is the radial distance to the customers and the second the local delivery distance, and as both bounds approach .
Preamble
import Definitions.Def_SupplyChainTheory_vrp
Formal statement
namespace SupplyChainTheory
theorem vrp_tsp_bounds {n : ℕ} (c : Fin (n + 1) → Fin (n + 1) → ℝ) (hc : VRPMetric c)
(hn : 1 ≤ n) (C : ℕ) (hC : 1 ≤ C) :
max (2 * ((n : ℝ) / C) * avgDepotDist c) (tspOpt c) ≤ vrpOpt c C
∧ vrpOpt c C ≤ 2 * ⌈(n : ℝ) / C⌉₊ * avgDepotDist c + (1 - 1 / (C : ℝ)) * tspOpt c := by sorry
end SupplyChainTheory
Source
Lawrence V. Snyder and Zuo-Jun Max Shen, Fundamentals of Supply Chain Theory, 2nd ed., Wiley 2019, DOI 10.1002/9781119584445, pp. 495-496, Sect. 11.4.1, Theorem 11.6, Eq. (11.57), and its proof; after Haimovich and Rinnooy Kan (1985)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.