论文信息 - A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems

A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems

AbstractA fast algorithm is described for implementing the greedy interchange heuristic for lise in solving large scale clustering and uncapacitated median location problems. Computational experience is reported for these algorithms on a number of large randomly generated networks and on some difficult problem sets, and comparisons with some other implementations are made. An additional heuristic is proposed for solving these set partitioning problems based on an efficient procedure for achieving the interchange.

R. A. Whitaker | R. A. Whitaker

[1] M. J. Hodgson. Toward More Realistic Allocation in Location—Allocation Models: An Interaction Approach , 1978 .

[2] G. Nemhauser,et al. Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms , 1977 .

[3] K E Rosing,et al. The Robustness of Two Common Heuristics for the p-Median Problem , 1979 .

[4] Donald Erlenkotter,et al. A Dual-Based Procedure for Uncapacitated Facility Location , 1978, Oper. Res..

[5] Polly Bart,et al. Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph , 1968, Oper. Res..

[6] Alfred A. Kuehn,et al. A Heuristic Program for Locating Warehouses , 1963 .

[7] H. Crowder,et al. Cluster Analysis: An Application of Lagrangian Relaxation , 1979 .

[8] Patrick D. Krolak,et al. A man-machine approach toward solving the traveling salesman problem , 1970, DAC '70.

[9] R. A. Whitaker. Some Interchange Algorithms for Median Location Problems , 1982 .

[10] Robert E. Markland,et al. Theory and Application of an Optimizing Procedure for Lock Box Location Analysis , 1981 .