A near‐exact method for solving the log‐truck scheduling problem

Abstract

Abstract We propose a solution method for the log‐truck scheduling problem, which is a generalisation of the pick‐up and delivery problem with time windows. Our approach is based on column generation and pseudo branch and price. Each column in the proposed mathematical model represents one feasible route for one truck. We start by designing a priori an initial set of routes. Then, the subproblem, which is a constrained shortest path problem, is solved by applying a k‐shortest path algorithm. Numerical results from a case study are presented.