Correct predictions are in blue. If we detect only a subset of a labelled sentence, we highlight the caught part as blue, the missing part light blue. False positives are in green and false negatives are in red.

Problem Depot_Placement — Constraint detection

There are two warehouses , A and B . Each warehouse has a fixed set of customers . No customer is served by both warehouses - so the two sets are disjoint . Each warehouse has a truck . There is a table of distances from customer to warehouse and between the customers . A truck is allowed to deliver not only to customers of its own warehouse , but also to customers of the other warehouse . To make this possible there is a `` depot '' where one truck can leave some goods for the other truck to pick up and deliver to the customer . The choice of depot is a decision variable ranging over customer and warehouse locations . Naturally before delivering to a customer of another warehouse , the truck must first visit the depot to collect the goods for delivery to the customer . The other truck must also visit the depot , of course , to drop off the goods . There are no time constraints , and therefore no restriction on which truck visits the depot first . Since there are no time constraints , the first truck to arrive could simply wait till the other truck came . The objective is to minimise the maximum of the distances travelled by the trucks .

Problem Depot_Placement — Detection of the decisions and objects to be modeled

There are two warehouses , A and B . Each warehouse has a fixed set of customers . No customer is served by both warehouses - so the two sets are disjoint . Each warehouse has a truck . There is a table of distances from customer to warehouse and between the customers . A truck is allowed to deliver not only to customers of its own warehouse , but also to customers of the other warehouse . To make this possible there is a `` depot '' where one truck can leave some goods for the other truck to pick up and deliver to the customer . The choice of depot is a decision variable ranging over customer and warehouse locations . Naturally before delivering to a customer of another warehouse , the truck must first visit the depot to collect the goods for delivery to the customer . The other truck must also visit the depot , of course , to drop off the goods . There are no time constraints , and therefore no restriction on which truck visits the depot first . Since there are no time constraints , the first truck to arrive could simply wait till the other truck came . The objective is to minimise the maximum of the distances travelled by the trucks .

Back to list