Simulated NBody: New Particle PhysicsBased Heuristics for a Euclidean LocationAllocation Problem
 Rahul Simha,
 Weidong Cai,
 Valentin Spitkovsky
 … show all 3 hide
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Get AccessAbstract
The general facility location problem and its variants, including most locationallocation and Pmedian problems, are known to be NPhard combinatorial optimization problems. Consequently, there is now a substantial body of literature on heuristic algorithms for a variety of location problems, among which can be found several versions of the wellknown simulated annealing algorithm. This paper presents an optimization paradigm that, like simulated annealing, is based on a particle physics analogy but is markedly different from simulated annealing. Two heuristics based on this paradigm are presented and compared to simulated annealing for a capacitated facility location problem on Euclidean graphs. Experimental results based on randomly generated graphs suggest that one of the heuristics outperforms simulated annealing both in cost minimization as well as execution time. The particular version of location problem considered here, a locationallocation problem, involves determining locations and associated regions for a fixed number of facilities when the region sizes are given. Intended applications of this work include location problems with congestion costs as well as graph and network partitioning problems.
 Appel, A.W. (1985) An Efficient Program for ManyBody Simulation. SIAM J. Sci. Stat. Comput. 6: pp. 85103
 Batta, R., Berman, O. (1989) A Location Model for a Facility Operating as an M/G/k Queue. Networks 19: pp. 717728
 Berman, O., Larson, R.C. (1982) Optimal 2facility Network Districting in the Presence of Queueing. Transportation Science 19: pp. 207216
 Berman, O., Mandowsky, R.R. (1986) LocationAllocation on Congested Networks. Euro. J. Oper. Res. 26: pp. 238250
 Burkard, R.E., Rendl, R. (1984) A Thermodynamically Motivated Simulation Procedure for Combinatorial Optimization Problems. Euro. J. Oper. Res. 17: pp. 169174
 Choi, H.A., B. Narahari, and R. Simha. (1997). “Algorithms for Mapping Task Graphs to a Network of Hetergeneous Workstations.” In Proc. ADCOMP 97, 1997.
 Cooper, L. (1964) Heuristic Methods for LocationAllocation Problems. SIAM Review 6: pp. 3753
 Daskin, M.S. (1995) Network and Discrete Location: Models, Algorithms and Applications. John Wiley & Sons, Inc., New York
 Francis, R.L., Goldstein, J.M. (1974) “Location Theory: A Selective Bibliography.”. Operations Research 22: pp. 400410
 Hockney, R.W., Eastwood, J.W. (1981) Computer Simulation Using Particles. McGrawHill, NY
 Houck, C.R., Joines, J.A., Kay, M.G. (1996) Comparison of Genetic Algorithms, Random Restart and TwoOpt Switching for Solving Large LocationAllocation Problems. Computers & Operations Research 23: pp. 587
 Jacobsen, S.K. (1982) Heuristics for the Capacitated Plant Location Model. European Journal of Operational Research 12: pp. 253261
 Keeney, R.L. (1972) A Method of Districting Among Facilities. Operations Research 20: pp. 613618
 Kernighan, B.W., Lin, S. (1970) An Efficient Heuristic Procedure for Partitioning Graphs. Bell Sys. Tech. J. 49: pp. 291307
 Khuller, S., Sussman, Y. (1996) The Capacitated kCenter Problem. SpringerVerlag, Berlin
 Love, R.L., Morris, J.G., Wesolowsky, G.O. (1988) Facilities Location: Models and Methods. NorthHolland, Amsterdam
 Maffioli, F., Righini, G. (1994) An Annealing Approach to MultiFacility Location Problems in Euclidean Space. Location Science 2: pp. 205222
 Mirchandani, P.B., Francis, R.L. (1990) Discrete Location Theory. John Wiley & Sons, Inc., New York
 Rolland, E., Schilling, D.A., Current, J.R. (1996) An Efficient Tabu Search Procedure for the pMedian Problem. Euro. J. Op. Res. 96: pp. 329342
 Rosing, K.E. (1991) Towards the Solution of the (Generalized) MultiWeber Problem. Environment and Planning, Series B 18: pp. 347360
 Sharpe, R., Marksjo, B.S. (1985) Facility Layout Optimization Using the Metropolis Algorithm. Environment and Planning B 12: pp. 443453
 Sharpe, R., Marksjo, B.S., Mitchell, J.R., Crawford, J.R. (1985) An Interactive Model for the Layout of Buildings. Applied Mathematics and Modelling 9: pp. 207214
 Tansel, B.C., Francis, R.L., Lowe, T.J. (1983) Location on Networks: A Survey. Management Science 29: pp. 482511
 Warren, M.S. and J.K. Salmon. (1992). “Astrophysical Nbody Simulation Using Hierarchical Tree Data Structures.” In Proc. Supercomputing 92, 1992, pp. 570–576.
 Wilson, J.D. (1994) College Physics. PrenticeHall, NJ
 Wong, R.T. Location and Network Design. In: O'Eigeartaigh, eds. (1985) Combinatorial Optimization: Annotated Bibliographies. John Wiley and Sons, New York
 Title
 Simulated NBody: New Particle PhysicsBased Heuristics for a Euclidean LocationAllocation Problem
 Journal

Journal of Heuristics
Volume 7, Issue 1 , pp 2336
 Cover Date
 20010101
 DOI
 10.1023/A:1026561511574
 Print ISSN
 13811231
 Online ISSN
 15729397
 Publisher
 Kluwer Academic Publishers
 Additional Links
 Topics
 Keywords

 facility location
 Pmedian
 locationallocation
 simulated annealing
 graph partitioning
 Industry Sectors
 Authors

 Rahul Simha ^{(1)}
 Weidong Cai ^{(2)}
 Valentin Spitkovsky ^{(3)}
 Author Affiliations

 1. Department of Computer Science, The George Washington University, Washington, DC, 20052
 2. Open System Software Division, HewlettPackard, MS 47 LA 1, 19447 Pruneridge Avenue, Cupertino, CA, 94086, USA
 3. Electrical Engg. and Computer Science Dept., Massachusetts Institute of Technology, Boston, MA, USA