The Vehicle Routing Problem with Time Windows is a generalization of the well knowncapacity constrained Vehicle Routing Problem.A homogeneous fleet of vehicles has to service a setof customers.The service of the customers can only start within a weU-defined time intervaldenoted the time window.The objective is to determine routes for the vehicles that minimizes theaccumulated cost(or distance).Currently the best approaches for determining optimal solutions arebased on column generation and Branch-and-Bound,also known as Branch-and-Price.This paperpresents two ideas for ran-time improvements of the Branch-and-Price framework for the VehicleRouting Problem with Time Windows.Both ideas reveal a significant potential for run-timerefinements when speeding up an exact approach without compromising optimality. The Vehicle Routing Problem with Time Windows is a generalization of the well-known fleacity constrained Vehicle Routing Problem. A homogeneous fleet of vehicles has to service a set of customers. The service of the customers can only start within a we-defined time intervaldenoted the time window. The objective is to determine routes for the vehicles that minimize theaccumulated cost (or distance) .Currently the best approaches for determining optimal solutions are based on column generation and Branch-and-Bound, also known as Branch-and-Price.This paperpresents two ideas for ran-time improvements of the Branch-and-Price framework for the Vehicle Routing Problem with Time. B. bob ideas reveal a significant potential for run-time refinements when speeding up an exact approach without compromising optimality.