Coverage versus Supply Cost in Facility Location: Physics of Frustrated Spin Systems

Abstract

A comprehensive coverage is crucial for communication, supply and transportation networks, yet it is limited by the requirement of extensive infrastructure and heavy energy consumption. Here we draw an analogy between spins in antiferromagnet and outlets in supply networks, and apply techniques from the studies of disordered systems to elucidate the effects of balancing the coverage and supply costs on the network behavior. A readily applicable, coverage optimization algorithm is derived. Simulation results show that magnetized and antiferromagnetic domains emerge and coexist to balance the need for coverage and energy saving. The scaling of parameters with system size agrees with the continuum approximation in two dimensions and the tree approximation in random graphs. Due to frustration caused by the competition between coverage and supply cost, a transition between easy and hard computation regimes is observed. We further suggest a local expansion approach to greatly simplify the message updates which shed light on simplifications in other problems.

arXiv comment15 pages, 14 figures

References in corpus (6)

• The random K-satisfiability problem: from an analytic solution to an efficient algorithm
• Survey-propagation decimation through distributed local computations
• From the Physics of Interacting Polymers to Optimizing Routes on the London Underground
• The Competition for Shortest Paths on Sparse Graphs
• Equilibration through local information exchange in networks
• Minimizing Unsatisfaction in Colourful Neighbourhoods

Cited by in corpus (3)

• The Futility of Being Selfish -- The Impact of Selfish Routing on Uncoordinated and Optimized Transportation Networks
• Coordinating Dynamical Routes with Statistical Physics on Space-time Networks
• Bilevel optimization in flow networks: A message-passing approach