A tree search algorithm for the multi-commodity location problem |
| |
Authors: | Richard S. Laundy |
| |
Affiliation: | CAP Scientific Limited, London WC1N 3LF, United Kingdom |
| |
Abstract: | The multi-commodity location problem is an extension of the simple plant location problem. The problem is to decide on locations of facilities to meet customer demands for several commodities in such a way that total fixed plus variable costs are minimized. Only one commodity may be supplied from any location.In this paper a primal and a dual heuristic for producing good bounds are presented. A method of improving these bounds by using a new Lagrangean relaxation for the problem is also presented. Computational results with problems taken from the literature are provided. |
| |
Keywords: | Location integer programming heuristics |
本文献已被 ScienceDirect 等数据库收录! |