Acceleration of Lagrangian Method for the Vehicle Routing Problem with Time Windows

The analytic center cutting plane method (accpm) is one of successful methods to solve nondifferentiable optimization problems. in this paper, accpm is used to accelerate lagrangian relaxation procedure for solving a vehicle routing problem with time windows (vrptw). first, a basic cutting plane algorithm and its relationship with a column generation technique is clarified. then, the proposed method based on accpm is explained as a stabilization technique for lagrangian relaxation. both approaches are tested on a benchmark instance to demonstrate the advantages of the proposed method in terms of computational time and quality of lower bounds.