A Milk Collection Problem with Incompatibility Constraints

摘要: The milk collection problem is well known in rural areas of the world. This paper considers this real-life for an Italian dairy company that collects raw from farmers. In our problem, we address constraint some farms are small and inaccessible by large vehicles; moreover, these farmers produce different types, tank trucks used transporting have multiple compartments. generates additional at most one type can be assigned to a compartment. goal show how operations research techniques helped improve its daily performance. particular, present solution approach based on two mathematical formulations local search, all embedded within multiple-restart mechanism. first formulation minimizes number vehicles routed network; second tour length. We also discuss experiments conducted as part case study compare with process previously.