Consider an array of storage locations, as illustrated below. The array represents storage bays. Rectilinear travel is used and is assumed to originate and/or terminate at the centroid of the storage bay. Products are received through one of the I/O points

(docks). The storage activity is divided equally between the docks.

Define the following parameters and variables:

Transcribed Image Text:

m = number of items A, = number of grid squares required by item i = 1,..., m; assume n = , dj = distance between dock k (=1,..., p) and the centroid of grid j (j = 1,..., n) => Wik cost/unit distance incurred in transporting item i between dock k and its storage == region Xij = if item i is assigned to grid square j; 0 otherwise a. Calculate the average distance item i travels between dock k and its storage region. b. Calculate the average cost of transporting item between dock k and its storage region. c. Formulate an integer programming model that minimizes the total transportation cost. 12 Dock 1 * Dock 2 * Dock 3 n