Solving capacitated part-routing problems with setup times and costs: a Dantzig-Wolfe decomposition-based solution approach

Abstract

We develop a Dantzig–Wolfe decomposition‐based approach for solving the capacitated part‐routing problem with routing flexibilities, setup times, and setup costs. Large instances of the problem are solved to near‐optimality using the proposed approach. The computational performance of the approach is compared with that of the existing Lagrangean relaxation‐based approach in terms of solution quality and computational times.