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, 85–103.
 Batta, R. and O. Berman. (1989). “A Location Model for a Facility Operating as an M/G/k Queue.” Networks 19, 717–728.
 Berman, O. and R.C. Larson. (1982). “Optimal 2facility Network Districting in the Presence of Queueing.” Transportation Science 19(3), 207–216.
 Berman, O. and R.R. Mandowsky (1986). “LocationAllocation on Congested Networks.” Euro. J. Oper. Res. 26(2), 238–250.
 Burkard, R.E. and R. Rendl. (1984). “A Thermodynamically Motivated Simulation Procedure for Combinatorial Optimization Problems.” Euro. J. Oper. Res. 17, 169–174.
 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, 37–53.
 Daskin, M.S. (1995). Network and Discrete Location: Models, Algorithms and Applications. New York: JohnWiley & Sons, Inc.
 Francis, R.L. and J.M. Goldstein. (1974). “Location Theory: A Selective Bibliography.” Operations Research 22, 400–410.
 Hockney, R.W. and J.W. Eastwood. (1981). Computer Simulation Using Particles. NY: McGrawHill.
 Houck, C.R., J.A. Joines, and M.G. Kay. (1996). “Comparison of Genetic Algorithms, Random Restart and TwoOpt Switching for Solving Large LocationAllocation Problems.” Computers & Operations Research 23(6),587.
 Jacobsen, S.K. (1982). “Heuristics for the Capacitated Plant Location Model.” European Journal of Operational Research 12, 253–261.
 Keeney, R.L. (1972). “A Method of Districting Among Facilities.” Operations Research 20(3), 613–618.
 Kernighan, B.W. and S. Lin. (1970). “An Efficient Heuristic Procedure for Partitioning Graphs.” Bell Sys. Tech. J. 49, 291–307.
 Khuller, S. and Y. Sussman. (1996). “The Capacitated kCenter Problem.” Berlin: SpringerVerlag. Lecture Notes in Computer Science, Vol. 1136.
 Love, R.L., J.G. Morris, and G.O. Wesolowsky. (1988). Facilities Location: Models and Methods. Amsterdam: NorthHolland.
 Maffioli, F. and G. Righini. (1994). “An Annealing Approach to MultiFacility Location Problems in Euclidean Space.” Location Science 2(4), 205–222.
 Mirchandani, P.B. and R.L. Francis. (1990). Discrete Location Theory. New York: John Wiley & Sons, Inc.
 Rolland, E., D.A. Schilling, and J.R. Current. (1996). “An Efficient Tabu Search Procedure for the pMedian Problem.” Euro. J. Op. Res. 96, 329–342. 36 SIMHA, CAI AND SPITKOVSKY
 Rosing, K.E. (1991). “Towards the Solution of the (Generalized) MultiWeber Problem.” Environment and Planning, Series B 18, 347–360.
 Sharpe, R. and B.S. Marksjo (1985). “Facility Layout Optimization Using the Metropolis Algorithm.” Environment and Planning B 12, 443–453.
 Sharpe, R., B.S. Marksjo, J.R. Mitchell, and J.R. Crawford. (1985). “An Interactive Model for the Layout of Buildings.” Applied Mathematics and Modelling 9, 207–214.
 Tansel, B.C., R.L. Francis, and T.J. Lowe. (1983). “Location on Networks: A Survey.” Management Science 29,482–511.
 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. NJ: PrenticeHall, 1994.
 Wong, R.T. (1985). “Location and Network Design.” In O'Eigeartaigh et al. (eds), Combinatorial Optimization: Annotated Bibliographies. New York: John Wiley and Sons.
 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
 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