Branch-and-price and constraint programming for solving a real-life technician dispatching problem
Design of optimal routes for technicians that was motivated by a real problem. Treatment of soft time windows for arrival times at client locations. An exact solution procedure for the VRPSTW is proposed. A branch-and-price framework using constraint programming is implemented. Results obtained compare favorably with the current practice.
branch-and-price constraint programming technician dispatch problem routing