In this paper we present a branch and price algorithm for the combined vehicle routing and scheduling problem with synchronization constraints. The synchronization constraints are used to model situations when two or more customers need simultaneous service. The synchronization constraints...

In this paper, we consider an operational routing problem to decide the daily routes of logging trucks in forestry. The industrial problem is difficult and includes aspects such as pickup and delivery with split pickups, multiple products, time windows, several time periods, multiple depots,...

We describe the decision support system RuttOpt, which is developed for scheduling logging trucks in the Swedish forest industry. The system is made up of a number of modules. One module is the Swedish road database NVDB which consists of detailed information of all the roads in Sweden. This...

We present a mathematical programming model for the combined vehicle routing and scheduling problem with time windows and additional temporal constraints. The temporal constraints allow for imposing pairwise synchronization and pairwise temporal precedence between customer visits, independently...