, Volume 7, Issue 1, pp 2336
Simulated NBody: New Particle PhysicsBased Heuristics for a Euclidean LocationAllocation Problem
 Rahul SimhaAffiliated withDepartment of Computer Science, The George Washington University
 , Weidong CaiAffiliated withOpen System Software Division, HewlettPackard
 , Valentin SpitkovskyAffiliated withElectrical Engg. and Computer Science Dept., Massachusetts Institute of Technology
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.
 Title
 Simulated NBody: New Particle PhysicsBased Heuristics for a Euclidean LocationAllocation Problem
 Journal

Journal of Heuristics
Volume 7, Issue 1 , pp 2336
 Cover Date
 200101
 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