×

Heuristic methods for location-allocation problems. (English) Zbl 0956.90014

Summary: A number of heuristic algorithms have been devised for solving large location-allocation problems. The algorithms have been extensively tested and several are in use in at least one industrial corporation. It has been found that one of the algorithms, the random destination algorithm, appears to provide satisfactorily close approximations to the optimal solution to location-allocation problems in reasonable amounts of computation time.

MSC:

90B85 Continuous location
90C52 Methods of reduced gradient type
PDF BibTeX XML Cite
Full Text: DOI