A heuristic method for large-scale multi-facility location problems

Computers and Operations Research

Volumn 31, Issue 2, 2004, Pages 257-272

  Levin, Yuri ^a   Ben Israel, Adi ^b  

^a QUEEN S UNIVERSITY   (Canada)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

Clustering; Cooper method; Multi facility location problems; Nearest center reclassification; Parallel heuristic method

Indexed keywords

CUSTOMER SATISFACTION; HEURISTIC METHODS; NUMERICAL ANALYSIS; PROBLEM SOLVING;

CONVEX MINIMIZATION;

OPERATIONS RESEARCH;

HEURISTICS;

EID: 0347723781     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(02)00191-0     Document Type: Article

References (22)

1. Hansen P, Jaumard B. Cluster analysis and mathematical programming. Mathematical Programming 1997;79: 191-215.
2. Cooper L. Heuristic methods for location-allocation problems. SIAM Review 1964;6:37-53.
3. Duran B, Odell P. Cluster analysis. Berlin: Springer, 1974.
4. Jambu M, Lebeaux M. Cluster analysis and data analysis. Amsterdam: North-Holland Publishing Co, 1983.
5. Everitt B. Cluster analysis, 3rd ed. London: Edward Arnold, 1993.
6. Drezner Z. Facility location: a survey of applications and methods. New York: Springer, 1995.
7. Ghosh A, Rushton G, editors. Spatial analysis and location-allocation models. New York: Van Nostrand Reinhold, 1987.
8. Love R, Morris J, Wesolowsky G. Facilities location: models & methods. New York: North-Holland Publishing Co, 1988.
9. Brimberg J, Hansen P, Mladenovic N, Taillard E. Improvements and comparison of heuristics for solving the multisource Weber problem. Operations Research 2000;48(3):444-60.
10. Drezner Z, Wesolowsky G. Allocation of discrete demand with changing costs. Computers and Operations Research 1999;26:1335-49.
11. Drezner Z. Locating a single new facility among existing, unequally attractive facilities. Journal of Regional Science 1994;34:237-52.
12. Hakimi S. On locating new facilities in a competitive environment. European Journal of Operations Research 1983;12:29-35.
13. Dobson G, Karmarkar U. Competitive location on a network. Operations Research 1987;35:565-74.
14. Darzentas J, Bairaktaris P. On the set partitioning type formulation for the discrete location problem. Computers and Operations Research 1986;13:671-9.
15. Weiszfeld E. Sur le point par lequel la somme des distances de n points donnés est minimum. Tohoku Mathematical Journal 1937;43:355-86.
16. Levin Y, Ben-Israel A. The Newton Bracketing method for convex minimization. Computational Optimization and Applications 2002;21:213-29.
17. Fukunaga K. Introduction to statistical pattern recognition, 2nd ed. Boston, MA: Academic Press Inc, 1990.
18. Kuhn H. A note on Fermat's problem. Mathematical Programming 1973;4:98-107.
19. Katz IN. Local convergence in Fermat's problem. Mathematical Programming 1974;6:89-104.
20. Chandrasekaran R, Tamir A. Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem. Mathematical Programming Series A 1989;44(3):293-5.
21. Levin Y, Ben-Israel A. Directional Newton methods in n variables. Mathematics of Computation 2002;71:251-62.
22. Drezner Z. A note on accelerating the Weiszfeld procedure. Location Science 1995;3(4):275-9.