Consider the uncapacitated fixed charge facility location problem associated with the network shown in Figure 7.15. The numbers in the box beside each node are the demand and the fixed facility location cost associated with the node. Using a cost per unit distance per unit demand of 1, solve the problem using the following approaches:
(a) The ADD algorithm
(b) The DROP algorithm
(c) The ADD algorithm followed by the exchange algorithm
(d) Lagrangian relaxation
Compare the solutions that you found using these approaches in terms of (i) the number of facilities located, (ii) the total cost, (iii) the fixed facility location costs that are incurred, and (iv) the transport costs incurred.
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here