Technical Note: Iterative Value-Centric Perturbation (IVCP) Route Optimizer Algorithm

The Iterative Value-Centric Perturbation (IVCP) algorithm is a high-performance routing engine designed to provide near-optimal solutions to the Traveling Salesperson Problem (TSP) under priority-based operational constraints. Rather than seeking a singular global optimum through exhaustive computation, IVCP utilizes node values to establish a prioritized origin before applying a deterministic 2-Opt refinement process. This approach is specifically engineered to resolve geometric path inefficiencies in real-time, delivering commercially significant reductions in Euclidean distance for dynamic logistics environments.