Abstract
A dynamic programming algorithm is presented to locate m variable facilities in relation to n existing facilities situated on one route. Each of the n existing facilities has a requirement flow which must be supplied by the variable facilities. The algorithm does the allocation simultaneously with the location. Computational experience indicates that relatively large problems may be solved optimally.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have