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...

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...

In this paper we consider a combined supply chain and ship routing problem for a large pulp producer in Scandinavia. The problem concerns the distribution of pulp to customers, with route scheduling of ships as a central part of modeling. It is an operative planning problem with daily ship...

We describe a new approach to produce integer feasible columns to a set partitioning problem directly in solving the linear programming (LP) relaxation using column generation. Traditionally, column generation is aimed to solve the LP relaxation as quick as possible without any concern of the...

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...

Transportation planning is an important part of the supply chain or wood flow chain in forestry. There are often several forest companies operating in the same region and collaboration between two or more companies is rare. However, there is an increasing interest in collaborative planning as...

In this paper, we describe a new method to solve Linear Programming (LP) problems which have uncertain right-hand-sides. We apply this to planning problems where a rolling planning horizon is used and where robustness is important. In particular, we are interested in applications where the...

Transportation planning in forestry is divided into strategic, tactical and operational depending on the length of the planning horizon. We consider a tactical problem of finding efficient backhauling routes. Given a set of supply and demand points the backhauling problem is to identify a set of...

Traditionally, most applications in the initial stage of forest supply chain deal with sawlogs to sawmills, pulpwood to pulp or paper mills and forest residues to heating plants. However, in the past decades, soaring prices of fossil fuel, global awareness about CO2 emission and increasing...

In this paper, the integrated planning of production and distribution for a pulp company is considered. The tactical decisions included regard transportation of raw materials from harvest areas to pulp mills; production mix and contents at pulp mills; inventory; distribution of pulp products...