In the truck-loading problem in Example 8.3, we assumed that any product could be loaded into any compartment. Suppose the following are not allowed: product 1 in compartment 2, product 2 in...

In the truck-loading problem in Example 8.3, we assumed that any product could be loaded into any compartment. Suppose the following are not allowed: product 1 in compartment 2, product 2 in compartment 1, and product 3 in compartment 4. Modify the model appropriately, and then use Evolutionary Solver to find the new optimal solution. (Hint: Add a penalty to the objective for violating these new constraints.)

EXAMPLE 8.3 LOADING A GAS STORAGE TRUCK

Agas truck contains five compartments with the capacities listed in Table 8.1. Three products must be shipped on the truck, and there can be only one product per compartment. The demand for each product, the shortage cost per gallon, and the maximum allowable shortage for each product are listed in Table 8.2. How should the truck be loaded to minimize the shortage costs?

Objective To use Evolutionary Solver to find the combination of products to load in compartments that minimizes the total shortage cost.

WHERE DO THE NUMBERS COME FROM? The data would be based on the truck dimensions and presumably on contracts the company has with its customers.