Mathematical Programming Formulation

The problem is formulated as a periodic vehicle routing problem with a node for each farm. Williams (1999) uses the fact that the number of days in the planning horizon is two to reduce the number of decision variables and constraints. The formulation shown here generalizes to any number of days and arbitrary frequencies (not just 1 or 2).